《C语言题库完整.doc》由会员分享，可在线阅读，更多相关《C语言题库完整.doc（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;在数组中查找指定元素#i
11、nclude 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+) scanf(%d, &ai); scanf(%d, &x);res=search(a,n,x); if(res != -1) printf(index = %dn, res); else printf(Not fo
12、undn); 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, 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);
13、 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); sc
14、anf(%d, &repeat); getchar(); for(ri = 1; ri = repeat; ri+) gets(str); scanf(%c, &c); getchar();/*-*/delchar(str,c); printf(result: ); puts(str); /*-*/void delchar(char *str,char c)int i,j;for(i=j=0;stri!=0;i+)if(stri!=c)strj+=stri;strj=0;使用函数实现字符串复制#include#includevoid main() char s80, t80; int m; i
15、nt repeat, ri; void strmcpy(char *s,char *t, int m); scanf(%d, &repeat); getchar(); for(ri = 1; ri = repeat; ri+) gets(t); scanf(%d, &m); getchar(); if(strlen(t) m) printf(error input); else/*-*/strmcpy(s,t,m); puts(s); void strmcpy(char *s,char *t,int m)int i,j;j=0;for(i=m-1;ti!=0;i+)sj+=ti;sj=0;/*
16、-*/判断回文字符串#include void main() char s80; int repeat, ri; int mirror(char *p); scanf(%d, &repeat); getchar(); for(ri = 1; ri = repeat; ri+) gets(s); if(mirror(s) != 0) printf(YESn); else printf(NOn); /*-*/int mirror(char *p)char *q;q=p;while(*q!=0)q+;p-;while(pq)if(*p!=*q)return 0;p+;q-;return 1;分类统计
17、字符个数#includevoid main() char s80; char *p; int blank, digit, lower, other, upper; gets(s); upper = lower = blank = digit = other = 0;/*-*/for(p=s;*p!=0;p+)if(*p=A&*p=a&*p=0&*p=9)digit+;else if(*p= )blank+;elseother+;printf(upper: %d lower: %d blank: %d digit: %d other: %dn, upper, lower, blank, digi
18、t, other);显示水果的价格#include int main(void) int ri, repeat; int choice; float price; scanf(%d, &repeat); for(ri=1; ri=repeat; ri+) printf(1 applesn); printf(2 pearsn); printf(3 orangesn); printf(4 grapesn); scanf(%d, &choice); if(choice=0) printf(price=0); switch(choice) case 1:price=3.00;break; case 2
19、:price=2.50;break; case 3:price=4.10;break; case 4:price=10.20;break; printf(price=%.2fn, price); return 0;求n!#include int main(void) int ri, repeat; int i, n; double fact; scanf(%d, &repeat); for(ri=1; ri=repeat; ri+) scanf(%d, &n); fact=1; for(i=1;i=n;i+) fact=fact*i; printf(%.0fn, fact); return 0
20、;求最大值#include int main( ) int ri, repeat; int i , max, n, x; scanf(%d, &repeat); for(ri=1; ri=repeat; ri+) scanf(%d, &n); max=n; for(i=1;i=n;i+) scanf(%d,&x); if(maxx)max=x; printf(%dn, max); return 0;求整数的位数以及各位数之和#include int main( ) int ri, repeat; int number, sum; long in; scanf(%d, &repeat); for
21、(ri=1; ri=repeat; ri+) number=0; sum=0; scanf(%ld, &in); if(in0) in=-in; do sum=sum+in%10; in=in/10; number+; while(in!=0); printf(number=%d, sum=%dn, number, sum); 求aaaaaaaaa#include void main() int ri, repeat; int i, n; long int a, sn, tn; scanf(%d, &repeat); for(ri=1; ri=repeat; ri+) scanf(%ld%d,
22、 &a, &n); sn=a;tn=a; for(i=1;i=n-1;i+) tn=10*tn+a; sn=sn+tn; printf(%ldn,sn); 求平均值#include int main(void) int i, n, sum; int repeat, ri; int a10; double aver; scanf(%d, &repeat); for(ri = 1; ri = repeat; ri+) scanf(%d, &n);sum=0; for(i = 0; i n; i+) scanf(%d, &ai); sum=sum+ai; aver=sum/(n*1.0); prin
23、tf(average = %.2fn, aver); 交换最小值和最大值#include int main(void) int i, index, n, t; 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);index=0;for(i=0;in;i+)if(aiaindex)index=i;t=a0;a0=aindex;aindex=t;for(i=0;iaindex)index=i;t=an-
24、1;an-1=aindex;aindex=t; printf(After swap: ); for(i = 0; i n; i+) printf(%d , ai); printf(n); 将数组中的数逆序存放#include int main(void) int i, n, temp; 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); for(i=0;in/2;i+) temp=ai; ai=a
25、n-1-i; an-1-i=temp; for(i = 0; i n; i+) printf(%d , ai); printf(n); 选择法排序#include int main(void) int i, index, k, n, temp; 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);for(k=0;kn-1;k+)index=k;for(i=k+1;iaindex)index=i;te
26、mp=aindex;aindex=ak;ak=temp; printf(After sorted: ); for(i = 0; i n; i+) printf(%d , ai); printf(n); 调试示例error09_1.cpp#include int main (void) int i, n; struct emp char name10; double jbg; double fdg; double zc; s10;scanf(%d, &n);for(i=0;in;i+) scanf(%s%lf%lf%lf,si.name,&si.jbg,&si.fdg,&si.zc);for (
27、i = 0; i n; i+) printf (%5s 实发工资：%7.2fn, si.name, si.jbg + si.fdg - si.zc);return 0; 计算平均成绩#include int main(void) int i, n; double average, sum=0; struct student int num; char name10; int score; s10; scanf(%d, &n); for(i=1;i=n;i+) scanf(%d%s%d,&si.num,si.name,&si.score); sum=sum+si.score; average=s
28、um/n; printf(average: %.2fn, average); 查找书籍#include int main (void) int i, max_index, min_index, n; double x; struct book char name50; double price; book10; scanf(%d, &n); getchar(); for(i = 0; i n; i+) gets(booki.name); scanf(%lf, &x); getchar(); booki.price = x; min_index=0; for(i=0;in;i+) if(book
29、i.pricebookmin_index.price) min_index=i; max_index=0; for(i=0;ibookmax_index.price) max_index=i; printf(highest price: %.1f, %sn, bookmax_index.price, bookmax_index.name); printf(lowest price: %.1f, %sn, bookmin_index.price, bookmin_index.name); return 0;找出总分最高的学生（改错题error09_2）#include int main (voi
30、d) int i, j, k, max_index, n; struct student int number; char name20; int score3; int sum; stu10; scanf(%d, &n);/*-*/ for(i=0;in;i+) scanf(%d,&stui.number); scanf(%s,stui.name); scanf(%d,&stui.score0); scanf(%d,&stui.score1); scanf(%d,&stui.score2); stui.sum=stui.score0+stui.score1+stui.score2; max_
31、index=0; for(i=0;istumax_index.sum)max_index=i; printf(总分最高的学生是: %s，%d分, stumax_index.name, stumax_index.sum);计算两个复数之积#include int main(void) struct complex int real; int imag; product, x, y; scanf(%d%d%d%d, &x.real, &x.imag, &y.real, &y.imag); product.real=x.real*y.real-x.imag*y.imag;product.imag=x.real*y.imag+y.real*x.imag;printf(%d+%di) * (%d+%di) = %d + %din, x.real, x.imag, y.real, y.imag, product.real, product.imag);return 0;#includeInt main(void)Printf(“Hello World!n
