69,369
社区成员
发帖
与我相关
我的任务
分享
#include <iostream>
using namespace std;
void each_digit_recursion(int a) //递归函数
{
if (a == 0)
return ;
each_digit_recursion(a / 10);
cout << a % 10 << ' '; //显示余数
}
void output_each_digit(int a)
{
cout << "each digit: ";
if (a == 0)
cout << '0';
else
each_digit_recursion(a);
}
void reverse(int a)
{
cout << "reverse: ";
while (true)
{
cout << a % 10;
a /= 10;
if (a == 0)
break;
}
}
int main()
{
int n = 1234567;
cout << "num: " << n << endl;
output_each_digit(n);
cout << endl;
reverse(n);
cout << endl;
cout << endl;
n = 0;
cout << "num: " << n << endl;
output_each_digit(n);
cout << endl;
reverse(n);
cout << endl;
system("pause");
return 0;
}
void divproc(int a) //递归函数
{
if(a!=0)
{
divproc(a/10);
cout<<a%10<<endl; //显示余数
}
return;
}
int main( )
{
//若n为0,则需打印出‘0’
//if(n==0)
//cout<<'0'<<endl;
divproc(n);
system("pause");
return 0;
}
#include <stdio.h>
int main(void)
{
int a, b = 0, dig, count = 0;
printf("Please input a integer: ");
scanf("%d", &a);
while(a)
{
dig = a % 10;
printf("%d\n", dig); // 输出每个数字
b = b * 10 + dig;
a /= 10;
count++;
}
printf("Digit number is %d\n", count); // 输出位数
printf("Reverse order is %d\n", b); // 输出反序
getchar();
getchar();
return 0;
}