目录
1.使用函数输出一个整数的逆序数
int reverse( int number )
{
int sum=0;
while(number){
sum=sum*10+number%10;
number/=10;
}
return sum;
}
2. 递归实现指数函数
double calc_pow( double x, int n ){
double sum;
if(n==0)
sum=1;
else{
sum=calc_pow(x,n-1)*x;
}
return sum;
}
3.统计个位数字
int Count_Digit ( const int N, const int D ){
int m;
if(N<0)
m=-N;
else m=N;
if(N==0&&D==0)
return 1;
int count=0;
while(m){
if(m%10==D)
count++;
m/=10;
}
return count;
}
4.统计各位数字之和是5的数
int is( int number )
{
int t,s=0,i=0;
while(number!=0){
t=number%10;
s+=t;
number=number/10;
}
if(s==5) return 1;
else return 0;
}
void count_sum( int a, int b )
{
int s=0,c=0,i;
for(i=a;i<=b;i++){
if(is(i)){
c++;
s+=i;
}
}
printf("count = %d, sum = %d",c,s);
}