《北工大c语言题库》由会员分享，可在线阅读，更多相关《北工大c语言题库（44页珍藏版）》请在金锄头文库上搜索。
1、#i nclude stdio.hint main()int ri,repeat;int i,n;double s;double fact(i nt n);scan f(%d,&repeat);for(ri=1;ri=repeat;ri+)scan f(%d,&n);s=0;for(i=1;i=n ;i+)s=s+1fact(i);prin tf(%0.4fn,s);return 0;double fact(i nt n)int i;#i nclude stdio.hint main()int ri,repeat;int i,n,j;float s,t;sca nf(%d,&repeat);f
2、or(ri=1;ri=repeat;ri+)scan f(%d,&n);s=0;for(i=1;i=n; i+) t=1; for(j=1;j=i;j+)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 number, int digit);scanf(%d,&repeat);for(ri=1;ri=repeat;ri+)scan
3、f(%ld,&in);count=countdigit(in,2);printf(count=%dn,count);int countdigit(long number, int digit)int i,count=O,t;if(nu mber0)nu mber=-nu mber;for(i=1; ;i+)t=nu mber%10; if(t=digit)co un t+; nu mber =nu mber/10;if(nu mber=0) break;retur n count;统计素数并求和#i nclude stdio.h#in clude math.hint main()int ri,
4、repeat;#i nclude stdio.h#in clude math.hint main()int ri,repeat;int count, digit, i, j, k, m, n, sumsca nf(%d,&repeat);for(ri=1;ri=repeat;ri+)scan f(%d%d, &m, &n);int count, i, m, n, sum;int 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
5、/ 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=factorsum(i) printf(%d , i);printf(n);long factorsum(int number)int i,sum=0;if(nu mber=1) retur n 1;for(i=1;i nu mber;
6、i+)if(nu mber%i=O)sum=sum+i;return sum;输出Fibo nacci序列Fibonacci序列的前十项X1=1;X2=1;Printf( %6d%6d”,x1,x2);For(i=1;i=8;i+)X=x1+x2;Printf( %6d”,x);#i nclude stdio.h#in clude math.hint main()int ri,repeat;int i, m, n;long f;long fib(i nt n);scan f(%d,&repeat);for(ri=1;ri=m&fn) break;printf(n);return 0;long
7、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;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);prin
8、tf(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 in, 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
9、=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;循环移动(调试示例 error08_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);
10、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;
11、 ri+)scanf(%d, &n);for(i = 0; i n; i+)scanf(%d, &ai); scanf(%d, &x); res=search(a,n,x);if(res != -1)printf(index = %dn, res);elseprintf(Not foundn);int search(int list,int n,int x)int i,res;res=-1;for(i=0;in;i+)if(listi=x)res=i;return res;使用函数的选择法排序#include void sort(int a,int n);int main(void)int i
12、, n;int repeat, ri;int a10;scanf(%d, &repeat);for(ri = 1; ri = repeat; ri+)scanf(%d, &n);for(i = 0; i n; i+) scanf(%d, &ai);sort(a,n);printf(After sorted: ); for(i = 0; i n; i+) printf(%d , ai);printf(n);void sort(int *p,int n)int k,i,index,t;for(k=0;kn-1;k+)index=k;for(i=k+1;in;i+)if(pipindex)index=i;t=pindex;pindex=pk;pk=t;使用函数删除字符串中的字符#includevoid main()char c;char str80;int repeat, ri;void delchar(char *str, char c);scanf(%d, &repeat
