[电脑基础知识]C语言题库1.doc

《[电脑基础知识]C语言题库1.doc》由会员分享，可在线阅读，更多相关《[电脑基础知识]C语言题库1.doc（47页珍藏版）》请在三一办公上搜索。

1、基本操作题#includemain() int i,j,k,n=0; for(i=1;i=5;i+) for(j=1;j=10;j+) for(k=1;k=10;k+) if(i*10+j*5+k*1=100) n+;printf(i=%d j=%d k=%dn,i,j,k); printf(n=%d,n);#includemain() int a,b,*pa,*pb; pa=&a;pb=&b; scanf(%d,%d,&a,&b); *pa=a+b; *pb=a+b; printf(a=%d,b=%dn,a,b);#includemain() int x=1,y=0,a=0,b=0; swi

2、tch(x) case 1: switch(y) case 0:a+;break; case 1:b+;break; case 2:a+;b+;break; printf(a=%d,b=%dn,a,b);#includemain() char str80; int i,num; printf(输入一个字符串:); gets(str); num=0; for(i=0;stri!=0;i+) if(stri=a) num+; printf(字符串中有%d个字母an,num);#includemain() int a,b; for(a=1,b=1;a=20) break; if(b%3=1) b+=

3、3;continue; b-=5; printf(%dn,a);#includemain() char s120,s220; int i; printf(Input a string:n); gets(s2); for(i=0;s2i!=0;i+) s1i=s2i; s1i=0; printf(Output the new string:n); printf(%sn,s1);#include#includemain() float a,x,x1,e; printf( a= ); scanf(%f,&a); x=a; while(1) x1=2*x/3+a/(3*x*x); e=fabs(x1-

4、x); if(e0.00001)break; else x=x1; printf(a=%.0fn,a); printf(x=%.5fn,x1); printf(pow=%.5f,a,pow(a,1.0/3);#include main()int a,b,c,t;printf(输入a,b,c:);scanf(%d%d%d,&a,&b,&c);if(ab)t=a;a=b;b=t;if(ac)t=a;a=c;c=t;if(bc)t=b;b=c;c=t;printf(%d %d %dn,a,b,c);#includemain() int m,n,t; scanf(%d%d,&m,&n); t=mn?m

5、:n; if(t%2!=0) t+=1; printf(%dn,t);#includemain() int x=1,y=0,a=0,b=0; switch(x) case 1:switch(y) case 0:a+;break; case 1:b+;break; case 2:a+;b+;break; printf(a=%d,b=%dn,a,b);#includemain()int i,j,k,n;printf(请输入一个3位数:n);scanf(%d,&n);i=n/100;j=(n-i*100)/10;k=n%10;if(i*i*i+j*j*j+k*k*k=n) printf(该数是水仙数

6、);else printf(该数不是水仙数);#includemain()char s120,s220;int i;printf(Input a string:n);gets(s2);for(i=0;s2i!=0;i+)s1i=s2i;s1i=0;printf(Output the new string:n);printf(%sn,s1);程序改错题 #include #include #include main() int i,j,k; for(i=1;i=4;i+) /*found*/ for(j=1;j=4;j+) for(j=1;j=i;j+) printf(%3d *%3d =%3d

7、,i,j,i*j); /*found*/ printf(n); printf(n); #include #include main() int a20=9,3,0,4,1,2,5,6,8,10,7, n=11; int i, j, p, t; printf( nnBefore sorting %d numbers:n, n ); j = 0; for ( i = 1; i = n; i+, j+ ) printf( %4d, aj ); if ( !( i%10 ) ) printf( n ); printf(n); for ( j = 0; jn-1 ; j+ ) p = j; /*foun

8、d*/ for ( i=j+1; in-1 ; i+ ) for ( i=j+1; iai ) /*found*/ t=i; p=i; if ( p!=j ) t = aj; aj = ap; ap = t; printf( nAfter sorting %d numbers:n, n ); j = 0; for ( i = 1; i = n; i+, j+ ) printf( %4d, aj ); if ( !( i%10 ) ) printf( n ); printf(n); #include #include main() char s80,t80; int i, sl; printf(

9、nPlease enter string s:); scanf(%s, s); sl = strlen(s); /*found*/ for( i=0; i=sl; i+) ti = si; for (i=0; isl; i+) tsl+i = ssl-i-1; /*found*/ t2*sl = 0; printf(The result is: %sn, t); #include #include #include main() int m,j,n=0,k; for(m=200;m=300;m+) k=sqrt(m); for(j=2;jk) if(n%8=0) printf(n); /*fo

10、und*/ printf(%6d,j); printf(%6d,m); n+; #include main() int a10=1,4,2,7,3,12,5,34,5,9,i,max,pos; max = a0; pos = 0; for ( i=1; i ai) if(max ai) max = ai; /*found*/ i=pos; pos=i; printf(The max is: %d ,pos is: %dn, max , pos); #include int Prime(int n) int i; for(i=2;in) if(i=n) return 1; return 0;ma

11、in() int n; scanf(%d,&n); /*found*/ if(Prime(int n)=1) if(Prime(n)=1) printf(%d is a prime number.,n); else printf(%d is not a prime number.,n); #include main() int a10=10,4,2,7,3,12,5,34,5,9,i; float s = 0; for ( i=0; i10; i+) /*found*/ if (i % 2 = 0) if(ai%2=0) s = s + ai; /*found*/ print(The resu

12、lt is: %dn, s); printf(The result is: %.0fn, s); #include #include #include main() int i; int a,b,c; printf(isomorphic numbers are :n); for(i=1;i=100;i+) a=i*i%10; b=i*i%100/10; /*found*/ c=i*i%100; if(i10) /*found*/ if(i=a) printf(%6d,i); if(i=a) printf(%6d,i); else if(i=a+b*10) printf(%6d,i); prin

13、tf(n); #include #include #include main() int a5,x; int i; printf(请输入5个数:n); for(i=0;i5;i+) /*found*/ scanf(%d,ai); scanf(%d,&ai); printf(请输入x:n); scanf(%d,&x); for(i=0;i5;i+) if(ai=x)break; /*found*/ if(ai=x)printf(%d is in %d,x,i); else printf(not found!); #include #include #include main() int scor

14、e,t; printf(Please enter a score:); do scanf(%d,&score); while(score100); t=score/10; /*found*/ switch(score) switch(t) case 10: case 9:printf(Excellent!n);break; case 8:printf(Good!n);break; case 7:printf(Middle!n);break; case 6:printf(Pass!n);break; /*found*/ else:printf(Fail!n); default :printf(“

15、Failn”);break; #include#includemain() char str100,ch; int i,k; printf(input a string:n); gets(str); i=0; k=0; while(stri!=0) if(stri=0)&(stri=9) /*found*/ stri=strk; strk=stri; k+; i+; /*found*/ strk+1=0; strk=0; for(i=0;ik/2;i+) ch=stri; stri=strk-1-i; strk-1-i=ch; puts(str);程序填空题#includemain() int

16、 num,s=1,a; printf(input num:n); scanf(%d,&num);if(num0) /*found*/ while(num!=0) a=num%10; s=s*a; /*found*/ num=num/10; printf(%d,s); #include #include #include int prinum( int a ) int count,i,j,k; count = 0; for ( i=0; i10; i+) k=ai-1; for ( j=2; j= k+1) count+; /*found*/ return count; main() int a

17、10=2,3,5,7,8,9,10,11,12,13,n; /*found*/ n = prinum(a); printf(prime number(s) is(are): %d, n ); #include #include #include main() int x,y,t,i; printf(Please enter two numbers:); scanf(%d,%d,&x,&y); if(x y) t = x; x = y; y = t; t = x % y; while( t ) x = y; /*found*/ y=t ; t = x % y; /*found*/ printf(

18、max is : %d,y); #include #include #include prime( int m ) int j,k,f; k=sqrt(m); for(j=2;j= k+1 ) f=1; else f=0; return (f); main() int a12=2,3,5,7,8,9,10,11,12,13,15,17,i,s; s = 0; for ( i=0; i12; i+) /*found*/ if( prime(ai)=0) s += ai; printf(Sum is: %d,s); #include main( ) int a10=1,5,2,5,6,8,7,4,

19、3,0; int i,k,n,f=0; scanf(%d,&n); for(i=0;i10;i+) /*found*/ if(ai=n) f=1; /*found*/ k=i; if(f) printf(%d is No. %dn, n,k); else printf( %d not found !n,n); #include main( ) int i,p=0,a10; /*found*/ for(i=0;i10;i+) scanf(%d,&ai); for(i=1;i10;i+) if(aiap) /*found*/ p=i; printf(%d,%dn,ap,p); #include m

20、ain( ) int i,a10,t; for(i=0;i10;i+) ai=i+1; /*found*/ for(i=0;i5;i+) t=ai; /*found*/ ai=a9-i; a9-i=t; for(i=0;i10;i+) printf(%5d,ai); printf(n); #include main() int x=24,y=36,t,i; if(x y) t = x; x = y; y = t; /*found*/ for ( i=y; i=x*y;i+ ) if(i%x=0 & i%y=0 ) break; /*found*/ printf(min is : %d,i);

21、#include /*found*/ long int fun(int x) int i; long int s=1; for (i=2;i=x;i+) s *= i; return (s); main() long int m=10,n=3,s1,s2,s3; /*found*/ s1=fun(m); s2=fun(n); s3=fun(m-n); printf(Cmn is : %ld,s1/s2/s3 ); #include #include #include int prinum( int a ) int count,i,j,k; count = 0; for ( i=0; i10;

22、i+) k=ai-1; for ( j=2; j= k+1) count+; /*found*/ return count; main() int a10=2,3,5,7,8,9,10,11,12,13,n; /*found*/ n = prinum(a); printf(prime number(s) is(are): %d, n ); #include main( ) int M,t,i,M1,n=0; printf(Please enter a number:) ; scanf(%d,&M); /*found*/ for(t=1;t=M;t+) M1=t/2; for(i=2;i1e-6

23、);pi=pi*2; /*end*/ printf(pi=%.2fn,pi); NONO(pi); void NONO( double x) FILE *f; f=fopen(out1.dat,w); fprintf(f,pi=%.2fn,x); fclose(f); #include stdio.h #include math.h #include conio.h #include stdlib.h void NONO( int y); int fun(int x) ; main() int x,n; printf(请输入一个任意整数：); scanf(%d,&x); n=fun(x); p

24、rintf(该数中偶数的个数是：%d,n); NONO(n); int fun(int x) /*begin*/ int t,n=0; while(x!=0) t=x%10; x=x/10; if(t%2=0)n+; return n; /*end*/ void NONO( int y) FILE *f; f=fopen(out1.dat,w); fprintf(f,s=%dn,y); fclose(f); #include stdio.h #include math.h #include conio.h #include stdlib.h void NONO(double s); main(

25、) double sum=0; double x=1.0; /*begin*/ int i,t; sum=x; t=1; for(i=1;i18;) x=x*x*x; t=t*(i+1)*(i+2)*-1;sum=sum+x/t;i=i+2; /*end*/ printf(sum=%.2fn,sum); NONO(sum); void NONO(double s) FILE *f; f=fopen(out1.dat,w); fprintf(f,sum=%.2fn,s); fclose(f); #include stdio.h #include math.h #include conio.h #

26、include stdlib.h void NONO( int max,int min) FILE *f; f=fopen(out1.dat,w); fprintf(f,max=%d,min=%dn,max,min); fclose(f); main() int max,min,x; int i=1; /*begin*/int a10=1,3,9,2,-5,7,12,23,12,6;max=min=a0;for(i=1;imax) max=ai;if(aimin) min=ai; /*end*/ printf(max=%d,min=%dn,max,min); NONO(max,min); #i

27、nclude #include void nono(int max); int fun(int a33) int i,j,max; /*begin*/ max=a00;for(i=1;i3;i+)for(j=1;j3;j+)if(maxaij) max=aij;return max; /*end*/ main() int a33=1,2,3,4,9,5,7,8,6; int i,j,max; printf(array is:n); for(i=0;i3;i+) for(j=0;j3;j+) printf(%5d,aij); printf(n); max=fun(a); printf(Result is: %dn,max); nono(max); void nono(int max) FILE *f; f=fopen(out1.dat,w); fp