C語言簡單的23個例子

1、例1.1:輸入兩個數(shù)，輸岀其中的最大者方法一：祥include stdio.hint mam()iiit a.bjnax:scanf(%d %d、&a.&b);if (ab) niax=a:else niax=b;printf(%d,ii,max):return 0;方法二：#includestdio.hint mam()int m.n;scanf(%d %d、&m.&n);printf(%dnXmii)?m: n);return 0;例1 厶 輸入三個數(shù)，輸出其最大者輕include stdio.hint mam()iiit a.b,c;scanf(%d %d %d.&比 &b.&c);pr

2、intf(%dQ,ab?(ac?a:c):(bc?b:c);return 0;例2：求一個數(shù)的絕對值方法一：#include stdio.hint mam()iiit a.absa:prmtf(enter one number:n); scanf(%d,&a);if(a0)absa=-a;elseabsa=a;printf(|%d|=%dn,a,absa);return 0;方法二：#includestdio.h# iiicludemath.hmt mam()iiit a;scanf(%d,&a);prmtf(%dn,abs(a);return 0;例3：兩個數(shù)的四則運算存include st

3、dio.hmt mam()double x,y;char op;釉通晴龍輸入運算式:5);scanf(%lf%c%lf. &x,&op,&y);switch (op)case 屮:pimtK%.2f%c%.2U%.2fnxopy,x+y)：break:case ,-,:printf(%.2f%c%.2f=%.2fn,x.op,y,x-y);breakcase ,*,:prmtf(%.2f%c%.2f=%.2fn5x,op,y5x*y);break:case T:if(5=0)printf(error!n):elseprintf(%.2f%c%.2 仁.2fm,x.op.y,x/y)；break

4、:default:printf(expression is error!n);return 0;不納入計算-1結(jié)束輸入，且-丄個數(shù)的平均數(shù)，以N：求4例祥include stdio.hint mam()mt n=0:double a,sum=0:while(l)scanf(%lf,&q);if(a=-l) break;sum-=a:n卄；printf(%.2fii,sum/n);return 0;例5：打印出九九乘法口訣#include stdio.hint mam()mt i,j;for (i=l;i10;i+) fbr(j=i;j=,a,&ch=,z,)pnntf(%cruch32);re

5、turn 0;例7：打印菱形圖案輕include stdio.hint mam()mtfor (i=0;i10;i+)for (j=0:j=9i;j卄)printf();for (k=0;k=2*i;k+)prmtf(%c.3);printf();for (i=0;i=9;i-H-)for (j=O:j=i+l：j卄)printf();for (k=0;k=16-2*i;W)printf(%c3);printf();return 0;例8：求100以內(nèi)所有的素數(shù)輕include stdio.hinclude math.hmain()mt m.i,k.t=0.j=l.n=0;printf(=:,

6、j);for (m=2: m=300;m=m+1)k=(int)sqrt(m);for (i=2:i=k+l) pnntf(,m);t+；if(t%4=0) printf(return 0;例9：輸出Fibonacci數(shù)列的前20項及其和(Fibonacci 數(shù)歹1,1,2,3Z 5, 8A 13,21 )include stdio.hmt niamOmt i,sum=0,f20=l,l; for (i=2;i20;i=i+l)fi=f!i-l+i-2;for (i=0;i20;i=i+l)pnntf(m,fi); sum=sum+fi; if(i+l)%4=0) pnntf(printf(s

7、iim=%dn. sum); return 0;例10：輸岀各位數(shù)均不相同的三位數(shù)，及其個數(shù)include stdio.hint mam()mt nij,k：n=0;for (i=l：iv=9;i卄)for (k=l;k=9;k+)if(k!=i)for (j=0；j=9;j+)if(j!=i&j!=k)n+；printed JOOi+lOj+k);if (n_x0010_=0) printf();printf();抽涵晴龍共d個數(shù)n,n)：return 0;例11:輸入i個數(shù)，求其階乘#include stdio.hmt mam()iiit i,sja;printf(=);scanf(%d,

8、&n);i=l；s=2;while (i=n)S=S*1；i=i十 1;prmtf(%d?=%dii.n5s);return 0;例1厶 將一個數(shù)分解質(zhì)因數(shù)ncludestdtohint mam()iiit i衛(wèi)；pnntf(please input numbers：n);for(；3scanf(%d,&n);printf(%d=,n);fbr(i=2;i=n;i+)wliile(n!=l)if(n%i=O) printed* J);n=n/i;else break:if(n=l) prmtf( n);else pnntf(%drLii);return 0;例13：漢諾塔游戲# include

9、void move(char axhar b)static int i=0:prmtf(%c-%c %dn,a,b,+i);void hanoi(int m,char a,char b,cliar c)if(m=l) move(a,c)；elsehanoi(m-l,a,c,b);move(ax)；hanoi(m-l,b.a,c)；mt niamOmt m;抽逋晴龍請輸入方塊數(shù)：）;scanf（%d,&m）;hanoi（mATB：C）;代 turn 0;1 4例：求一*句話中單詞的個數(shù)#includemt mam()char s100,c;iiit i,temp=04ium=0;gets(s);

10、fbr(i=0;(c=si)!=0,;i+)if(c=f ) temp=0:else if (temp=0)nuni=num+l:temp=l;printf(%dn,nuni);return 0;例15：水仙花數(shù)（三位數(shù),各位數(shù)字的三次方之和等于該數(shù)）方法一：祥include stdio.h int mam()mtfor (n=100:n1000:n+)i=n/100;j=n/1010*i;z=n_x0010_;if(n=i*i*itj *j *j-z*z*z)printf(.n););return 0;方法二：#includestdio liint mam()mtfbr(i=l;i=9;i+

11、)for(j=0;j=9:j+)for(k=0;k=9;k+)if(i*i*i+j *j*j+k*k*k= 100*1+10 *j+k)prmtf(M,100*i10*j-t-k);printf();return 0;例16：字符串b在字符串a(chǎn)中出現(xiàn)的次數(shù),b中可以用“？ ”代替未知字母#include存define N 1000mt maiiiOint i.j.m,n,kx=O;char aN,bN;gets(a);gets(b);fbr(i=O;ai!=,O,;i+);forG=O;bj!=,O,;j+);m=i；n=j-;for(i=0;i=m-n+l ;i-H-)k=0;fbr(j=O

12、;jn:j+)if(bj=?) k=lcontinue;else if(ai+j=bj) k=l;eLse k=O;if (k) x卄；printf(%dQ,x);return 0;例:冒泡排丿了 1 7 #include stdio.h樣define N 10int mam()iiit i j,t,max,aN= 1,1,2345,28,133,21,34,777;iiit x;釉通晴龍初始數(shù)組元素為:)；for (尸0：iN:i卄)prmtf(%dprintf();for (i=0;iN-l;i+)for (j=0;jaj+l)t=aUJ；aUj+l；aU+l=t；釉通晴龍從小到人排序后的

13、數(shù)組為:)；for (i=0;iN:i-H-);printf(=,ai);return 0;:選擇排序18例梓include stdio.li#define N 10int mam()mt i,t j,max,aN= 14,2,34 5,28,133,21,34,777;iiit x;抽連晴龍初始數(shù)組元素為:)；for (i=0;iN;i-H-)printf(%d ,ai);printf();for (i=0;iN-l;i+)t=i；for (j=i+l;iN;j+) if(ajat)t=j;if (t!=i) x=at；at=ai;ai=x;抽潼晴龍從小到人排序的數(shù)組為:)；for (i=0

14、;iN;i+)printf (%d,ai); printf();return 0;:數(shù)組兀素的插入1 9例include stdio.h祥define N 10mt mam()mt i,j,aN戶1,1,2,3,15,28,133,21,34;iiit x;釉通晴龍初始數(shù)組元素為:)；for (r=0：ii;j-)aUHU-l；31=X；釉涵晴龍插入元素之后的數(shù)組為：)；for (i=0;iN;i+)printf(M.ai); printf();代 turn 0;例20：數(shù)組元素的刪除存include stdio.h祥define N 10int mam()mt i,jXN二1,1,2,3,1

15、5,28,133,21,34,88;iiit x;釉通晴龍初始數(shù)組元素為:)；for (i=0;iN:i-r+)printf(%d ,ai);printf();抽潼晴龍請輸入要刪除的下標(biāo)位置(0d) ,N1);scanf(%d.&i);for (j=i+l;jN;j+)抽潼晴龍刪除后的數(shù)組為J;for (i=O;iN:i-H-)printf(M,ai);printf();return 0;:數(shù)組中的最大值例2 1 include stdio.h器 define? N 10int mam()int i,max.aN=l,l,2345,28,133,21,34,777;int x;釉通晴龍初始數(shù)組

16、元素為:)；for (i=0;iN:i-H-)printf(%d ,ai);printf();max=a0;for (i=l;i=max) max=ai;抽潼晴龍數(shù)組的最大值是%dn.max);return 0;例22：數(shù)組中最大值的下標(biāo)祥include stdio.h#define N 10mt mam()mt i,ma%aN=l,123,15,2& 133,21,34,777;iiit x;抽通晴龍初始數(shù)組元素為:)；for (i=0;iN:i-H-)printf(%d ,ai);printf();max=0;for (i=l;i=amax) max=i;抽潼晴龍數(shù)組的最人值的下標(biāo)是%doLniax);代 turn 0;:杳找數(shù)組中特定的兀素