C語言簡單的23 個例子

例1.1:輸入兩個數(shù)，輸出其中的最大者方法一：#includestdio.hintmain()(inta,b,max;scanf(%d%d,&a,&b);if(a>b)max=a;elsemax=b;printf(%d\n,max);return0;}方法二：#includestdio.hintmain()(intm,n;scanf(%d%d,&m,&n);printf(%d\n,(m>n)?m:n);return0;}例1.2：輸入三個數(shù)，輸出其最大者#includestdio.hintmain()(inta,b,c;scanf(%d%d%d,&a,&b,&c);printf(%d\n,a>b?(a>c?a:c):(b>c?b:c));return0;}例2：求一個數(shù)的絕對值方法一：#includestdio.hintmain()(inta,absa;printf(enteronenumber:\n);scanf(%d,&a);if(a<0)absa=-a;elseabsa=a;printf(|%d|=%d\n,a,absa);return0;}方法二：#includestdio.h#includemath.hintmain()(inta;scanf(%d,&a);printf(%d\n,abs(a));return0;}例3：兩個數(shù)的四則運算#includestdio.hintmain()(doublex,y;charop;粕潼晴龍輸入運算式:\n);scanf(%lf%c%lf,&x,&op,&y);switch(op)(case'+':printf(%.2f%c%.2f=%.2f\n,x,op,y,x+y);break;case'-':printf(%.2f%c%.2f=%.2f\n,x,op,y,x-y);break;case'*':printf(%.2f%c%.2f=%.2f\n,x,op,y,x*y);break;case'/':if(y==0)printf(error!\n);elseprintf(%.2f%c%.2f=%.2f\n,x,op,y,x/y);break;default:printf(expressioniserror!\n);}return0;}不納入計算-1結束輸入，且-1個數(shù)的平均數(shù)，以N：求4例#includestdio.hintmain()(intn=0;doublea,sum=0;while(1)(scanf(%lf,&a);if(a==-1)break;sum+=a;n++;}printf(%.2f\n,sum/n);return0;}例5：打印出九九乘法口訣#includestdio.hintmain()(inti,j;for(i=1;i<10;i++){for(j=i;j<10;j++)(printf(%dx%d=%-4d,i,j,i*j);}printf(\);}return0;}例6：大小寫轉(zhuǎn)換，以數(shù)字0結束輸入#includestdio.hintmain(){charch;while(1){scanf(%c,&ch);if(ch=='0')break;if(ch>='A'&&ch<='Z')printf(%c\n,ch+32);if(ch>='a'&&ch<='z')printf(%c\n,ch-32);}return0;}例7：打印菱形圖案#includestdio.hintmain()(inti,j,k;for(i=0;i<10;i++)(for(j=0;j<=9-i;j++)printf();for(k=0;k<=2*i;k++)printf(%c,3);printf(\);}for(i=0;i<=9;i++)(for(j=0;j<=i+1;j++)printf();for(k=0;k<=16-2*i;k++)printf(%c,3);printf(\);}return0;}例8：求100以內(nèi)所有的素數(shù)#includestdio.h#includemath.hmain()(intm,i,k,t=0,j=1,n=0;printf(=:,j);for(m=2;m<=300;m=m+1)(k=(int)sqrt(m);for(i=2;i<=k;i++)if(m%i==0)break;if(i>=k+1)(printf(],m);t++;if(t%4==0)printf(\=：,++j);}}printf(\);return0;}例9：輸出Fibonacci數(shù)列的前20項及其和(Fibonacci數(shù)歹列：1,1,2,3,5,8,13,21???)#includestdio.h

intmain()(inti,sum=0,f[20]=(1,1);for(i=2;i<20;i=i+1)f[i]=f[i-1]+f[i-2];for(i=0;i<20;i=i+1)(printf(m,f[i]);sum=sum+f[i];if((i+1)%4==0)printf(\);}printf(sum=%d\n,sum);return0;}例10：輸出各位數(shù)均不相同的三位數(shù)，及其個數(shù)#includestdio.hintmain()(intn,i,j,k;n=0;for(i=1;i<=9;i++)for(k=1;k<=9;k++)if(k!=i)for(j=0;j<=9;j++)if(j!=i&&j!=k)(n++;printf(%d,100*i+10*j+k);if(n_x0010_==0)printf(\);}printf(\);粕潼晴龍共％d個數(shù)\n,n);return0;}例11：輸入一個數(shù)，求其階乘#includestdio.hintmain()(inti,s,n;printf(=);scanf(%d,&n);i=1;s=2;while(i<=n)(s=s*i;i=i+1;}printf(%d!=%d\n,n,s);return0;例12例12：將一個數(shù)分解質(zhì)因數(shù)#includestdio.hinti,n;printf(pleaseinputnumbers:\n);for(;;)(scanf(%d,&n);printf(%d=,n);for(i=2;i<=n;i++)(while(n!=1)(if(n%i==0)(printf(%d*,i);n=n/i;}elsebreak;}}if(n==1)printf(\\n);elseprintf(%d\n,n);}return0;}例13：漢諾塔游戲#include<stdio.h>voidmove(chara,charb)(staticinti=0;printf(%c-->%c %d\n,a,b,++i);}voidhanoi(intm,chara,charb,charc)(if(m==1)move(a,c);else(hanoi(m-1,a,c,b);move(a,c);hanoi(m-1,b,a,c);}}intmain()intm;粕潼晴龍請輸入方塊數(shù)：)；scanf(%d,&m);hanoi(m,'A','B','C');return0;14例：求一句話中單詞的個數(shù)14例：求一句話中單詞的個數(shù)#include<stdio.h>intmain()(chars[100],c;inti,temp=0,num=0;gets(s);for(i=0;(c=s[i])!='\0';i++)(if(c=='')temp=0;elseif(temp==0)(num=num+1;temp=1;}}printf(%d\n,num);return0;}例15：水仙花數(shù)（三位數(shù)，各位數(shù)字的三次方之和等于該數(shù)）#includestdio.h方法一：#includestdio.hintmain()(inti,j,z,n;for(n=100;n<1000;n++)(i=n/100;j=n/10-10*i;z=n_x0010_;if(n==i*i*i+j*j*j+z*z*z)printf(],n);}printf(\);return0;}方法二：#includestdio.hintmain()(inti,j,k;for(i=1;i<=9;i++)for(j=0；j<=9；j++)for(k=0;k<=9;k++)if(i*i*i+j*j*j+k*k*k==100*i+10*j+k)printf(M,100*i+10*j+k);printf(\);return0;}例16：字符串b在字符串a(chǎn)中出現(xiàn)的次數(shù)，b中可以用“？”代替未知字母#include<stdio.h>#defineN1000

intmain()(inti,j,m,n,k,x=0;chara[N],b[N];gets(a);gets(b);for(i=0;a[i]!='\0';i++);for(j=0;b[j]!='\0';j++);m=i--;n=j--;for(i=0;i<=m-n+1;i++)(k=0;for(j=0;j<n;j++)if(b[j]=='?'){k=1;continue;}elseif(a[i+j]==b[j])k=1;elsek=0;if(k)x++;}printf(%d\n,x);return0;例：冒泡排序17#includestdio.h#defineN10intmain()(inti,j,t,max,a[N]={1,1,2,3,15,28,133,21,34,777};intx;粕潼晴龍初始數(shù)組元素為:)；for(i=0;i<N;i++)printf(%d,a[i]);printf(\);for(i=0;i<N-1;i++)for(j=0;j<N-i-1;j++)if(a[j]>a[j+1]){t=a[j];a[j]=a[j+1];a[j+1]=t;)粕潼晴龍從小到大排序后的數(shù)組為:)；for(i=0;i<N;i++);printf(=,a[i]);return0;}:選擇排序18例#includestdio.h#defineN10intmain(){inti,t,j,max,a[N]={1,1,2,3,15,28,133,21,34,777};intx;粕潼晴龍初始數(shù)組元素為:)；for(i=0;i<N;i++)printf(%d,a[i]);printf(\);for(i=0;i<N-1;i++){t=i;for(j=i+1;i<N;j++)if(a[j]<a[t])t=j;if(t!=i){x=a[t];a[t]=a[i];a[i]=x;}}粕潼晴龍從小到大排序的數(shù)組為:)；for(i=0;i<N;i++)

printf(%d,a[i]);printf(\)；return0;數(shù)組元素的插入19數(shù)組元素的插入19例#includestdio.h#defineN10intmain()(inti,j,a[N]={1,1,2,3,15,28,133,21,34};intx;粕潼晴龍初始數(shù)組元素為:)；for(i=0;i<N;i++)printf(%d,a[i]);printf(\);粕潼晴龍請輸入要插入的下標位置(0-%d):,N-1);scanf(%d,&i);粕潼晴龍請輸入要插入的數(shù):)；scanf(%d\n,x);for(j=N-1;j>i;j--)a[j]=a[j-1];a[i]=x;粕潼晴龍插入元素之后的數(shù)組為:)；for(i=0;i<N;i++)printf(M,a[i]);printf(\);return0;}例20：數(shù)組元素的刪除#includestdio.h#defineN10intmain(){inti,j,a[N]={1,1,2,3,15,28,133,21,34,88};intx;粕潼晴龍初始數(shù)組元素為:)；for(i=0;i<N;i++)printf(%d,a[i]);printf(\

);粕潼晴龍請輸入要刪除的下標位置(0-%d),N-1);scanf(%d,&i);for(j=i+1；j<N;j++)a[j-1]=a[j];粕潼晴龍刪除后的數(shù)組為:)；for(i=0;i<N;i++)printf(M,a[i]);printf(\);return0;:數(shù)組中的最大值例21:數(shù)組中的最大值例21#includestdio.h#defineN10intmain()(inti,max,a[N]={1,1,2,3,15,28,133,21,34,777};intx;粕潼晴龍初始數(shù)組元素為:)；for(i=0;i<N;i++)printf(%d,a[i]);printf(\);max=a[0];for(i=1;