给定一个整数n,输出这个数的位数，顺序、逆序输出每一为数

#include<stdio.h>
#include<math.h>
int Count(long long n)//得到这个数,计算位数
{
if(n == 0)
{
return 1;
}
int tmp = 0;
while(n !=0)
{
tmp ++;
n /= 10;
}
return tmp;
}
void PrintReverse(long long n)//得到个位，再丢弃个位(顺序输出)
{
if(n < 0)
{
printf(" - “);
n=-n;
}
do
{
printf(”%d “,n%10);//输出个位
n /=10;//丢弃个位
}while(n != 0);
printf(”\n");
}
void PrintOrder(long long n)//得到高位，丢弃高位(逆序输出)
{
if(n < 0 )
{
printf(" - “);
n=-n;
}
if(n == 0 )
{
printf(“0\n”);
return ;//退出本函数
}
int tmp = Count(n);//位数
int power = (int)pow(10.0,tmp-1);
while(n != 0)
{
printf(”%d “,n/power);
n %= power;
power /= 10;
}
printf(”\n");
}
int main()
{
printf("%d\n",Count(12345));
printf("%d\n",Count(1));
printf("%d\n",Count(0));
printf("%d\n",Count(-12345));
printf("%d\n",Count(-1));
printf("%d\n",Count(-1234567890987654321));
printf("%d\n",Count(1234567890987654321));
PrintOrder(123456789);
PrintOrder(1);
PrintOrder(0);
PrintOrder(-1);
PrintOrder(-123456789);
PrintReverse(123456789);
PrintReverse(1);
PrintReverse(0);
PrintReverse(-1);
PrintReverse(-123456789);
return 0;
}