《C语言题库完整》由会员分享，可在线阅读，更多相关《C语言题库完整（47页珍藏版）》请在金锄头文库上搜索。
1、求1 + 1/2! +.+ 1/n!#include stdio.hint main( ) int ri,repeat; int i,n,j; float s,t; scanf(%d,&repeat); for(ri=1;ri=repeat;ri+) scanf(%d,&n);s=0;for(i=1;i=n;i+)t=1;for(j=1;j=i;j+)t=t*j;s=s+1.0/t; printf(%0.4fn,s); #include stdio.hint main( ) int ri,repeat; int i,n; double s; double fact(int n); scanf(
2、%d,&repeat); for(ri=1;ri=repeat;ri+) scanf(%d,&n);s=0; for(i=1;i=n;i+)s=s+1/fact(i); printf(%0.4fn,s); return 0;double fact(int n)int i;double result;result=1;for(i=1;i=n;i+)result=result*i;return result;统计一个整数中数字的个数#include stdio.hint main( ) int ri,repeat; int count; long in; int countdigit(long n
3、umber, int digit); scanf(%d,&repeat); for(ri=1;ri=repeat;ri+) scanf(%ld,&in);count=countdigit(in,2); printf(count=%dn,count); int countdigit(long number, int digit)int i,count=0,t;if(number0) number=-number;for(i=1; ;i+)t=number%10;if(t=digit)count+;number=number/10;if(number=0)break;return count;#i
4、nclude stdio.h#include math.hint main( ) int ri,repeat; int count, digit, i, j, k, m, n, sum; scanf(%d,&repeat); for(ri=1;ri=m&i=n;i+)for(j=2;ji/2&i!=1)count+;sum=sum+i; printf(count=%d,sum=%dn, count, sum); 统计素数并求和#include stdio.h#include math.hint main( ) int ri,repeat; int count, i, m, n, sum; in
5、t prime(int m); scanf(%d,&repeat); for(ri=1;ri=repeat;ri+) scanf(%d%d, &m, &n);sum=0;count=0;for(i=m;i1)for(i=2;im/2) return 1; 求完数#include stdio.hint main( ) int ri,repeat; int i, m, n; long factorsum(int number); scanf(%d,&repeat); for(ri=1;ri=repeat;ri+) scanf(%d%d, &m, &n); for(i=m;i=n;i+)if(i=f
6、actorsum(i)printf(%d , i); printf(n); long factorsum(int number)int i,sum=0;if(number=1) return 1;for(i=1;inumber;i+)if(number%i=0)sum=sum+i;return sum;Fibonacci序列的前十项X1=1;X2=1;Printf(“%6d%6d”,x1,x2);For(i=1;i=8;i+)X=x1+x2;Printf(“%6d”,x);X1=x2;X2=x;输出 Fibonacci 序列#include stdio.h#include math.hint
7、main( ) int ri,repeat; int i, m, n; long f; long fib(int n); scanf(%d,&repeat); for(ri=1;ri=m&fn) break; printf(n); return 0;long fib(int n)int i,a=1,b=1,t;if(n=1) return 1;if(n=2) return 1;for(i=3;i=n;i+)t=a+b; a=b;b=t;return t;求各位数字的立方和等于它本身的数#include stdio.hint main( ) int ri,repeat; int i, m, n;
8、 int is(int number); scanf(%d,&repeat); for(ri=1;ri=repeat;ri+) scanf(%d%d, &m, &n);for(i=m;i=n;i+)if(i=is(i)printf(%d , i); printf(n); return 0;int is(int number)int t,sum=0;dot=number%10;sum=sum+t*t*t;number=number/10;while(number!=0);return sum;将一个整数逆序输出#include int main( ) int ri, repeat; long i
9、n, res,k; long reverse(long number); scanf(%d, &repeat); for(ri=1; ri=repeat; ri+) scanf(%ld, &in); if(in0) in=-in; k=1; else k=0; res=reverse(in); if(k=1) res=-res; printf(%ldn, res); long reverse(long number)int a,b;b=0;while(number!=0)a=number%10;b=b*10+a;number=number/10;return b;循环移动（调试示例error0
10、8_1）#include void mov(int *x, int n, int m);int main(void) int i, m, n,*p; int a80; scanf(%d%d, &n, &m); for(i = 0; i n; i+) scanf(%d, &ai); mov(a,n,m); printf(After move: ); for(i = 0; i n; i+) printf(%d , ai); printf(n); void mov(int *x,int n,int m)int i,j,k;for(i=0;i0;j-)xj=xj-1;x0=k;在数组中查找指定元素#include int main(void) int i, index, n, res, x; int repeat, ri; int a10; int search(int list, int n, int x); scanf(%d, &repeat); for(ri = 1; ri = repeat; ri+) scanf(%d, &n); for(i = 0; i n; i+)
