C語(yǔ)言操作題?？季幊填}庫(kù)1

第頁(yè)C語(yǔ)言編程題覆蓋到的算法：1、個(gè)人所得稅計(jì)算；2、求一組數(shù)的正、負(fù)數(shù)（或奇、偶數(shù)）的個(gè)數(shù)和平均值；3、二維數(shù)組主、次對(duì)角線之和；4、求素?cái)?shù)（用函數(shù)實(shí)現(xiàn)）；5、級(jí)數(shù)有限項(xiàng)求和問(wèn)題；6、兩個(gè)一維數(shù)組相加（用函數(shù)實(shí)現(xiàn)）；7、求最大、最小值；8、判斷閏年（用函數(shù)實(shí)現(xiàn)）；9、求水仙花數(shù)；10、百錢百雞；11、求最大公約數(shù)、最小公倍數(shù)。12、求回文數(shù)；13、排序；14、二維數(shù)組的轉(zhuǎn)置；15、遞歸函數(shù)求階乘；16、求斐波那契數(shù)列；17、求和：a+aa+aaa+aaaa+；18、求符合條件的整數(shù)（如：是某個(gè)二位數(shù)的平方，個(gè)位、十位、百位數(shù)各不相同等）；(包括素?cái)?shù)，回文，完數(shù)，等等)19、字符串加密；20、統(tǒng)計(jì)字符串中字母和數(shù)字的個(gè)數(shù)；/*1.個(gè)人所得稅計(jì)算，以實(shí)驗(yàn)指導(dǎo)P24T5為標(biāo)準(zhǔn)*/#include<stdio.h>voidmain() inti,n; doublea,b,c; n=i/400; printf("pleaseinputincome:\n"); scanf("%d",&i); a=(i-800)*0.05,b=20+(i-1200)*0.08,c=84+(i-2000)*0.2; switch(n) case0: case1:printf("不需繳稅\n");break; case2:printf("需交納%lf元\n",a);break; case3: case4:printf("需交納%lf元\n",b);break; default:printf("需交納%lf元\n",c);break;/*2.求一組數(shù)的奇數(shù)個(gè)數(shù)，偶數(shù)個(gè)數(shù)和平均值#include<stdio.h>#defineN10voidmain() inta[N]; inti,m=0,n=0,sum=0; doubleaverage; printf("pleaseinput10numbers:\n"); for(i=0;i<N;i++) scanf("%d",&a[i]); if(a[i]%2==0) m++; else n++; sum+=a[i]; average=(double)sum/N; printf("wehave%doddsand%devens\n",n,m); printf("average=%lf\n",average);/*2'.求一組數(shù)的正數(shù)個(gè)數(shù)和負(fù)數(shù)個(gè)數(shù)及平均值*/#include<stdio.h>#defineN10voidmain() inta[N]; inti,m=0,n=0,sum=0; doubleaverage; printf("pleaseinput10numbers:\n"); for(i=0;i<N;i++) scanf("%d",&a[i]); if(a[i]>0) m++; else n++; sum+=a[i]; average=(double)sum/N; printf("wehave%dpositivenumbersand%dnagetivenumbers\n",m,n); printf("theaverage=%lf",average);/*3.求二維數(shù)組的主次對(duì)角線之和*/#include<stdio.h>#defineM5#defineN5voidmain() inta[M][N]; inti,j,sum1=0,sum2=0; printf("pleaseinputthematrix:\n"); for(i=0;i<M;i++) for(j=0;j<N;j++) scanf("%d",&a[i][j]); for(i=0,j=0;i<M;i++,j++) sum1+=a[i][j]; for(i=0,j=N-1;i<M;i++,j--) sum2+=a[i][j]; printf("主對(duì)角線和為%d\n",sum1); printf("次對(duì)角線和為%d\n",sum2);/*4.調(diào)用函數(shù)判斷素?cái)?shù)*/#include<stdio.h>#include<math.h>intisPrime(intn) inti; for(i=1;i<sqrt(n);i++) if(n%i==0) return0; return1;voidmain() intn,i; printf("pleaseinputanumber\n"); scanf("%d",&n); i=isPrime(n); if(i) printf("%disaprime\n",n); else printf("%disnotaprime\n",n);//5.級(jí)數(shù)有限項(xiàng)求和(以格里高利公式求π為例)//#include<stdio.h>#include<math.h>voidmain() intn=1; doublep=0,t,pi; t=1/(pow((-1),(n+1))*2*(n-1)); while(fabs(t)>=1e-6) pi+=t; n++; pi=4*p; printf("%lf",pi);//6.兩個(gè)一維數(shù)組相加///*#include<stdio.h>#defineN5voidmain() inta[N],b[N],c[N]; inti; printf("pleaseinputthefirstarraya[N]:\n"); for(i=0;i<N;i++) scanf("%d",&a[i]); printf("pleaseinputthesecondarrayb[N]:\n"); for(i=0;i<N;i++) scanf("%d",&b[i]); for(i=0;i<N;i++) c[i]=a[i]+b[i]; printf("thesumis:\n"); for(i=0;i<N;i++) printf("%d\t",c[i]);//6.1調(diào)用函數(shù)實(shí)現(xiàn)//#include<stdio.h>#defineN5intf(inta,intb) intsum; sum=a+b; returnsum;voidmain() inta[N],b[N],c[N]; inti; printf("pleaseinputthefirstarraya[N]:\n"); for(i=0;i<N;i++) scanf("%d",&a[i]); printf("pleaseinputthesecondarrayb[N]:\n"); for(i=0;i<N;i++) scanf("%d",&b[i]); for(i=0;i<N;i++) c[i]=f(a[i],b[i]); printf("thesumis:\n"); for(i=0;i<N;i++) printf("%d\t",c[i]);/*7.求一組數(shù)的最大最小值*//*#include<stdio.h>voidmain() inti,max,min; inta[10]; printf("pleaseinputtennumbers\n"); for(i=0;i<10;i++) scanf("%d",&a[i]); max=a[0]; min=a[0]; for(i=1;i<10;i++) if(a[i]>max) max=a[i]; if(a[i]<min) min=a[i]; printf("maxis%d,minis%d\n",max,min);/*隨機(jī)數(shù)*/#include<stdio.h>#include<stdlib.h>voidmain() inti,max,min; inta[10]; for(i=0;i<10;i++) a[i]=rand()%90+10; printf("%d\t",a[i]); max=a[0]; min=a[0]; for(i=1;i<10;i++) if(a[i]>max) max=a[i]; if(a[i]<min) min=a[i]; printf("max=%d\tmin=%d\n",max,min);/*8.判斷閏年*/#include<stdio.h>intf(intn) if(n%4==0&&n%100!=0||n%400==0) return1; else return0;voidmain() intn; printf("pleaseinputyear:\n"); scanf("%d",&n); if(f(n)) printf("%d是閏年\n",n); else printf("%d不是閏年\n",n);/*可能會(huì)有要輸出某一范圍內(nèi)所有閏年，思想一樣，用循環(huán)調(diào)用函數(shù)即可*//*9.判斷水仙花數(shù)（運(yùn)用循環(huán)）#include<stdio.h>voidmain() intn,a,b,c,m; printf("pleaseinputanumber:\n"); scanf("%d",&n); a=n/100; b=n/10%10; c=n%10; m=a*a*a+b*b*b+c*c*c; if(m==n) printf("%disthenumberwewant\n",n); else printf("%disnotthenumber\n",n);/*9'.輸出所有水仙花數(shù)（調(diào)用函數(shù)(書P108為循環(huán)做法)）*/#include<stdio.h>intf(intn) inta,b,c,m; a=n/100; b=n/10%10; c=n%10; m=a*a*a+b*b*b+c*c*c; if(m==n) return1; else return0;voidmain() inti,t; for(i=100;i<1000;i++) t=f(i); if(t==1) printf("%d\t",i);//10.百錢買百雞（題目見書P115）//#include<stdio.h>voidmain() inti,j,k; for(i=0;i<=20;i++) for(j=0;j<=33;j++) for(k=3;k<=99;k+=3) if((i+j+k==100)&&(5*i+3*j+k/3==100)) printf("公雞%d只，母雞%d只，小雞%d只\n",i,j,k);/*11.求最大公約數(shù)和最小公倍數(shù)，函數(shù)實(shí)現(xiàn)*/#include<stdio.h>intf(intm,intn) inti=1,t; if(m<n) t=m; m=n; n=t; while((i=m%n)!=0) m=n; n=i; returnn;intg(intm,intn) inti,j; i=f(m,n); j=m*n/i; returnj;voidmain() intm,n,a,b; printf("pleaseinputtwonumbers:\n"); scanf("%d%d",&m,&n); a=f(m,n); b=g(m,n); printf("最大公約數(shù)為%d\n",a); printf("最小公倍數(shù)為%d\n",b);//12.1輸出10-2000之間的回文數(shù)（循環(huán)）///*#include<stdio.h>voidmain() inti,j,k=0,a; printf("10-2000之間的回文數(shù)有：\n"); for(i=10;i<=2000;i++) a=i; j=0; while(a>0) j=j*10+a%10; a/=10; if(i==j) printf("%d\t",i); k++; if(k%5==0) printf("\n"); printf("\n");//12.2輸出10-2000之間的回文數(shù)（函數(shù)調(diào)用）///*#include<stdio.h>intf(intn) inti=0; while(n>0) i=i*10+n%10; n/=10; returni;voidmain() intn,k; printf("10-2000之間的回文數(shù)有：\n"); for(n=10;n<=2000;n++) if(n==f(n)) printf("%d\t",n); k++; if(k%5==0) printf("\n"); printf("\n");//12.3判斷回文數(shù)（循環(huán)）///*#include<stdio.h>voidmain() inti,a,j=0; printf("pleaseinputanumber:\n"); scanf("%d",&i); a=i; while(a>0) j=j*10+a%10; a/=10; if(j==i) printf("%d是回文數(shù)\n",i); else printf("%d不是回文數(shù)\n",i);//12.4判斷回文數(shù)（函數(shù)調(diào)用）//#include<stdio.h>intf(intn) inti=0; while(n>0) i=i*10+n%10; n/=10; returni;voidmain() intn; printf("pleaseinpitanumber:\n"); scanf("%d",&n); if(n==f(n)) printf("%d是回文數(shù)\n",n); else printf("%d不是回文數(shù)\n",n);//13.排序////選擇法///*#include<stdio.h>#defineN10voidf(inta[],intn) inti,j,k,t; for(i=0;i<=n;i++) k=i; for(j=i+1;j<n;j++) if(a[j]<a[k]) k=j; if(k!=i) t=a[k]; a[k]=a[i]; a[i]=t;voidmain() inta[N]={8,2,34,5,12,78,4,78,76,9}; inti=0; intsize=sizeof(a)/sizeof(int); for(i=0;i<N;i++) printf("%4d",a[i]); printf("\n"); f(a,size); for(i=0;i<N;i++) printf("%4d",a[i]); printf("\n");//冒泡法//#include<stdio.h>#defineN5voidf(inta[],intn) inti,j; intt; for(i=0;i<n-1;i++) for(j=0;j<n-1-i;j++) if(a[j]>a[j+1]) t=a[j]; a[j]=a[j+1]; a[j+1]=t;//插入法//#include<stdio.h>#defineN5voidf(inta[],intn) inti,j; intt; for(i=0;i<n;i++) t=a[i]; j=i; while(j>0&&a[j-1]>t) a[j]=a[j-1]; --j; a[j]=t;voidmain() inta[N]={8,2,34,5,12}; inti=0; intsize=sizeof(a)/sizeof(int); for(i=0;i<N;i++) printf("%4d",a[i]); printf("\n"); f(a,size); for(i=0;i<N;i++) printf("%4d",a[i]); printf("\n");//二維數(shù)組的轉(zhuǎn)置//#include<stdio.h>#defineN3#defineM3voidmain() inta[M][N],b[M][N]; inti,j; printf("pleaseinputa[M][N]\n"); for(i=0;i<M;i++) for(j=0;j<N;j++) scanf("%d",&a[i][j]); for(i=0;i<M;i++) for(j=0;j<N;j++) b[i][j]=a[j][i]; printf("b[M][N]=\n"); for(i=0;i<M;i++) for(j=0;j<N;j++) printf("%4d",b[i][j]); } printf("\n"); printf("\n");//15.調(diào)用遞歸函數(shù)求階乘//#include<stdio.h>intf(intn) if(n==1||n==0) return1; else returnf(n-1)*n;voidmain() intn,m; printf("pleaseinputanumber:\n"); scanf("%d",&n); m=f(n); printf("%d!=%d\n",n,m);/*16.運(yùn)用遞歸函數(shù)求斐波拉契數(shù)列（前30項(xiàng)）*/#include<stdio.h>intf(intn) if(n==1||n==2) return1; else returnf(n-1)+f(n-2);voidmain() inti,k=0; for(i=1;i<=30;i++) printf("%d\t",f(i)); k++; if(k%5==0) printf("\n"); printf("\n");//17.求a+aa+aaa+aaaa...///*#include<stdio.h>#include<math.h>#defineN5voidmain() intn,i,j,k,a,sum1=0; printf("pleaseinputanumber:\n"); scanf("%d",&n); for(i=1;i<=N;i++) k=fabs(10,i-1); j=n+n*(i-1)*k; sum1+=j; printf("sum=%d\n",sum1);#include<stdio.h>#defineN5intk(inta,intsum) sum=sum*10+a; retur