C和C++打基礎(chǔ)程序集錦

#include'*stdafx.hM#include"stdio.h"〃求最大公約數(shù)和最小公倍數(shù)intgcd(inta,intb)(intmin;if(a>b)min=b;elsemin=a;while(min){if(a%min==0&&b%min==0)returnmin;min—;)return-1;)intlcm(inta,intb)(intmax;if(a>b)max=a;elsemax=b;while(max){if(max%a==0&&max%b==0)returnmax;max++;}return-1;)intmain(intargc,char*argv[])(inta,b,min,max;printf("請(qǐng)輸入兩個(gè)整數(shù)a和b\n")；scanf(”％d%d”,&a,&b);〃可以有逗號(hào)分隔(若有則輸入時(shí)也要有相應(yīng)的字符),且格式控制與地址表列也是ー對(duì)ー*****//min=gcd(a,b);//max=lcm(a,b);//printf("a和b的最大公約數(shù)和最小公倍數(shù)是％d,%d\n”,min,max);printf("TheGCDof%dand%dis%d\nM,a,b,gcd(a,b));printf(M%dand%d的最小公倍數(shù)是％d\n”,a,b,lcm(a,b));〃格式控制與輸出表列是ー對(duì)一的***#include"sldafx.h"http://#include"stdio.h"〃統(tǒng)計(jì)英文字母、空格、數(shù)字、其他字符個(gè)數(shù)voidcountNum()(charc;intabc=0;int_123=O;intspc=0;intother=0;while((c=getchar())!=ヽn)/〃?每個(gè)getcharQ依次一個(gè)ー個(gè)讀入字符直到回車(chē)換行符(Anり出現(xiàn)?/(if(c>=65&&c<90llc>=97&&c<=122)abc++;elseif(c>=48&&c<=57)_123++;elseif(32==c)spc++;elseother++;)printf("該行字符中:英文字母?jìng)€(gè)數(shù)abc=%4數(shù)字字符個(gè)數(shù)」23二％d,空格個(gè)數(shù)spc二％d,其他字符個(gè)數(shù)other二％d\n",abc,_123,spc,other);}intmain(intargc,char*argv[])(countNum();return0;}#include"stdafx.h"#include"math.h"〃求2+22+222+2222+22222的值(此時(shí)a=2,n=5,a是一個(gè)數(shù)字,n表示a的位數(shù),由鍵盤(pán)輸入)count_pow()(intsum二。;intS=2;int』1;intn;scanf("％d”,&n);while(iv二n)sum二S+sum;S=S+2*pow(10,i)ル分別求出每ー項(xiàng)數(shù)字i++；)printf(,'sum=%d\n,',sum);)intmain(intargc,char*argv[])(count_pow();return0;)〃求1!+2!+3!+4!+…+20!#includeustdafx.hn#include"math.h'1voidN_muItiP()(inti=l;intn;intsum=0;intS=l;scanf(M%dH,&n);while(i<=n){S=S*i;//s得到的是每ー項(xiàng)的值sum=sum+S;i++;)printf(,,sum=%d\n',,sum);)intmain(intargc,char*argv[])(N_multiP();return0;)〃求三位水仙花數(shù)#include"stdafx.h"include“math.h"voidnarcissistic()(intx=100;while(x>=100&&x<l000)intbai=x/100;intshi=(x%100)/10;intge=x%10;〃注意是對(duì)10求余if(x==pow(bai,3)+pow(shi,3)+pow(ge,3))printf("x=%d\n",x);X-H-；))intmain(intargc,char*argv[])(narcissistic();return0;1〃求1000以內(nèi)的完數(shù)#include"stdafx.h"#include"math.h"voidBeauty_Num()(intm=l;〃一定要賦初值inti;intS;while(m<=1000)〃將for循環(huán)改為while感覺(jué)很給你把,但記住一定要賦初值給變量(S=0;fbr(i=l;i<m;i++)if(m%i==0)S=S+i;if(S==m)printf(nS=%d\n",S);m++;)}intmain(intargc,char*argv[])(Beauty_Num();return0;〃求2/1,3/2,,5/3,8/5,13/8,21ハ3.??數(shù)列的前20項(xiàng)之和#include"stdafx.h"#include"math.hnvoidNum_Count()(inti=l,n;doublesum=0;doublex=l,y=2,t;scanf("%d",&n);while(i<=n)(sum=sum+y/x;〃該數(shù)列的特點(diǎn)是分子值y后ー個(gè)是前ー個(gè)的分母和分子值之和,而分母值x是前ー個(gè)的分子yt=y;y=y+x；x=t;i++:)printf(u%ftnn,sum);}intmain(intargc,char*argv[])(Num_Count();return0;〃求t鐵球從100米高空落下,第10次落地時(shí)共經(jīng)過(guò)多少米,第10次反彈多高,第幾次落地采用鍵盤(pán)輸入#include"stdafx.h"#include"math.h"voidGroud_Floor()(doubleh=100;doubleS=100;inti=l;intn;scanf(n%d';&n);//while(i<=n)//for(;iv=n;i++)〃當(dāng)執(zhí)行完這樣的countue語(yǔ)句后需要再次判斷加?時(shí)必須使用for循環(huán)h*=0.5;〃每次落地反彈到原高度的一半if(i==l)continue;〃最少當(dāng)然是2次落地S=2*h+S;〃2h,落地后反彈到h,落地后又是ー個(gè)h,這里面只是求球落地經(jīng)過(guò)多少米,所以反彈高度是不算的//i++;)printf("S=%f,h=%f\n",S,h);)intmain(intargc,char*argv[])(Groud_Floor();return0;〃求猴子吃桃問(wèn)題〃〃〃〃〃〃〃〃〃〃〃程序分析:采取逆向思維的方法,從后往前推斷〃〃ノ〃〃〃〃〃〃〃/天數(shù):第一天第二天第三天第四天桃數(shù):22104(本程序的思路是基于每天的桃數(shù)規(guī)律寫(xiě)的)吃數(shù):12631 (滿足題目的吃法)1111此題用倒推的辦法,所以注意循環(huán)結(jié)束的條件。本題中用遞減方式,因此是:i>=111111111#include"stdafx.h"#include"malh.h"voideat()(intsum=0;inti=l;intn;intnext=l,pre;//scanf(,,%d\&n);for(i=3;i>=l;i-)〃ー一這里的思路是根據(jù)猴子吃法萊推演出來(lái)一前一天有的桃子數(shù)以及吃后剩余桃子數(shù)之間的數(shù)學(xué)關(guān)系pre=(next+l)*2;/*前一天擁有桃子數(shù)是后一天擁有桃子數(shù)加1后的2倍?/printf(Hi=%dsum=%-5d\nn,i,pre);next=pre;〃從后往前推斷}}intmain(intargc,char*argv[]){eat();return0;〃求平方根的迭代公式#includenstdafx.hM#include"math.huvoidrevurse()(floatx0,xl,a;scanf(n%f'\&a);xl=a/2;//xl為什么要賦值為a/2do(x0=x1;xl=(x0+a/x0)/2;}while(fabs(x0-xl)>=0.00001);printf("％0.3f\n",xl);)intmain(intargc,char*argv[])(revurse();return0;〃求用牛頓迭代法解得下面方程1.5附近的根#include"stdafx.h"#include"math.h"floatx,y;x=1.5;do(y=2*x*x*x-4*x*x+3*x-6;x=x?y/(6*x*x?8*x+3);〃非常的不懂啊…哈哈}while(y!=0);printf(Hx=%0.3f\nM,x);)intmain(intargc,char*argv[])(niudun();return0;〃求用牛頓迭代法解得下面方程1.5附近的根#include"stdafx.h"#include"math.h"voidtwo()(floatxl,x2,yl,y2;xl=10,x2=10;do(yl=2*xl*xl*xl-4*xl*xl+3*xl-6;xl=xl-yl/(6*xl*xl-8*xl+3);}while(yl!=0);do(y2=2*x2*x2*x2-4*x2*x2+3*x2-6;x2=x2-y2/(6*x2*x2-8*x2+3);}while(y2!=0);printf("xl=%.03fandx2=%0.3f\n",xl,x2)y/還是非常的不懂啊?}intmain(intargc,char*argv[])two();return0;〃求用for循環(huán)嵌套打印五角星#include"stdafx.h"#include"math.h"voidprintstart()inti,j,k;for(i=0;i<=3;i++)for(j=O；j<=2-i;j++)primf(い);〃先打印空格for(k=0;k<=2*i;k++)printf("*");//空格之后打印*printf(ヤT);//一行完畢換行)for(i=0;i<=2;i++)(for(j=0;j<=i;j++)printf("");for(k=0;k<=4-2*i;k++)printf("*")；printf(u\nM);})intmain(intargc,char*argv[])(printstart();return0;〃求100以內(nèi)的素?cái)?shù)/?質(zhì)數(shù)又稱素?cái)?shù)。指在ー個(gè)大于1的自然數(shù)中,除了1和此整數(shù)自身外,沒(méi)法被其他自然數(shù)整除的數(shù)。換句話說(shuō),只有兩個(gè)正因數(shù)（1和自己）的自然數(shù)即為素?cái)?shù)。比1大但不是素?cái)?shù)的數(shù)稱為合數(shù)。1和0既非素?cái)?shù)也非合數(shù)。合數(shù)是由若干個(gè)質(zhì)數(shù)相乘而得到的。所以,質(zhì)數(shù)是合數(shù)的基礎(chǔ),沒(méi)有質(zhì)數(shù)就沒(méi)有合數(shù)。*/#include"stdafx.h"#include"math.h"intprimenum(intm)(intn,i;//if(1==m)return0;n=sqrt(m);for(i=2;i<=n;i++)(if(m%i==0)return0;}return1;)intmain(intargc,char*argv[])Iintm,count=0;for(m=2;m<100;m++)〃l和〇都不素?cái)?shù)(if(primenunn(m)!=0)(printf("m二%d",m);print軍う;〃空格是需要打開(kāi)的啊count++;if(count%10==0)〃每行輸入10個(gè)換行(printf(u\n");}))//forprintf(“\n")；return0;〃求用選擇法對(duì)10個(gè)整數(shù)排序#include"stdafx.h"#include"math.h"inti,j;inta[10];intt=0;for(i=0;i<10;i++)(scanf("％d”,&a[i]);〃單個(gè)字符輸入時(shí),字符間一定要敲空格的,不然顯示不出結(jié)果)for(j=ly<10;j++)for(i=0;i<9-j;i++)if(a[i]>a[i+l]){t=a[i+l];a[i+l]=a[i];a[i]=t;)for(i=0;i<10;i++)(printf(,'%5d',,a|i]);intmain(intargc,char*argv[])(select();return0;)〃求3*3整形矩陣對(duì)角線元素之和#include"stdafx.h"#include"math.h"voidrectangle()(inti,j,sl,s2;inta[3][3];for(i=0;iv3;i++)for(j=0;j<3;j++)scanf(H%dM,&a[i][j]);sl=a[0][0]+a[l][l]+a[2][2];s2=a[0][2]+a[1][1]+a[2][0];printf(*'s1=%d,s2=%d\nH,s1,s2);1intmain(intargc,char*argv[]){rectangle();return0;〃求將輸入數(shù)插入到已排好序的數(shù)組中,原序依舊#include"stdafx.h"#include"math.h"voidinsert_sort()(staticinta[5]={1,4,5,6,7);inti,b,t;scanf("％d”,&b);printf(“ヽn")；for(i=0;i<5;i++)(/?非常經(jīng)典的比較,輸入數(shù)大a[i]的時(shí)候直接輸出a[i],當(dāng)輸入數(shù)小時(shí)則依次比較替換,最后要求從鍵盤(pán)輸入的數(shù)所取得值一定是原數(shù)組中的最大值,不占用原數(shù)組空間?/if(b<=a[i])〃只找比他大的數(shù)(t=a[i];a[i]=b;b=t;printf("％d\n”,a[i]);primf("％d\n”,b);〃輸入數(shù)獲得原數(shù)組中最大值intmain(intargc,char*argv[])(insert_sort();return0;)〃求將一個(gè)數(shù)組逆序后重放#include"stdafx.h"#include"math.h"voidreverse()(inti,j,temp;inta[10];for(i=0;i<10;i++)scanf("％d”,&a[i])；printf(“ヽn")；for(i=0J=9;i<10,j>=0;i++,j-){/?利用原有空間及ー個(gè)屮間變量來(lái)逆序數(shù)組屮的值?/temp=a[i];a[i]=a|jl;a[j]=temp;)for(i=0;i<10;i++)printf("%d\n",a[i]);}intmain(intargc,char*argv[])(reverse();return0;〃求??楊輝三角**#include"stdafx.h"#include"malh.h"voidyanhui()(staticintm,n,k,b[15][15];b[0][l]=l;for(m=l;m<15;m++)(for(n=1;n<=m;n-H-)(b[m][n]=b[m-l][n-l]+b[m-l][n];printf(H%-5dw,b[m][n]);)printf(“\n")；}}intmain(intargc,char*argv[])(yanhui();return0;)〃求??魔方矩陣**#include"stdafx.h"#includenmath.hHvoidmofangO(inta[16][16];inti,j,k,p,m,n;P=l；while(l==p)printf(HEntern(n=l-15):n);scanf(”％d”,&n);if((n!=0)&&(n<=15)&&(n%2!=0))p=0;for(i=l;i<=n;i++)for(j=l;j<=n;j++)a[i][j]=0;j=n/2+1;for(k=2;k<=n*n;k++)(j=j+l;if((i<l)&&0>n))(i=i+2;j=j-h}else(if(i<l)i=n;if(j>n)j=l;}if(a[i]U]==0)a[i][j]=k;else(i=i+2;j=j-l；})for(i=l;i<=n;i++){for(j=l；j<=n;j++)printfC%4dH,a[i][j]);printf(,,\n,f);)intmain(intargc,char*argv[])(mofang();return0;〃求矩陣鞍點(diǎn)#include"stdafx.h"#include"malh.h"intgetSadd!ePoint(int*x,int*y,int(*A)[5],intm,intn)(intmax,i,j,k,flag;for(i=0;i<m;i++)〃逐行掃描尋找鞍點(diǎn)(max=O;//max記錄第i行中最大值的列數(shù)flag=l;for(j=l;j<n;j++)〃找出第i行中的最大元素的位置A[i][max](if(A[i][j]>A「][max])〃若是需要本次循環(huán)做完整個(gè)子操作則一定要加括號(hào)max=j;)for(k=0;k<n;k++)〃找同行中與最大元素相等的,有則跳出循環(huán)if(A[i][max]==A[i][k]&&max!=k){flag=O;break;)if(flag==l)for(k=0;kvm;k++)〃判斷A「][max]是否是本列中最小的,否則非鞍點(diǎn),跳出循環(huán){if(A[k][max]<A[i][max]&&k!=i){flag=O;break;))if(flag==l)〃找到鞍點(diǎn),用x,y還回,程序結(jié)束還回1(*x=i;*y=max;return1;))return0;intmain(intargc,char*argv[])(intA[5][5],i,j,x,y;printf("Pleaseinputdigitintothe5*5matrix\n");fbr(i=0;i<5;i++)for(j=0;j<5;j++)scanf(n%dM,,&A[i][j]);if(getSaddlePoint(&x,&y,A,5,5))printf(,r\nSaddlePointisat(%d,%d)\n,,,x+1,y+l);elseprintf(n\nThereisnointheMatrixVn");return0;)〃求??折半查找輸入的元素位置**#include"stdafx.h"#include"math.h"voidsemicode()(staticinti,j,m,a[15]={1,4,9,13,21,34,55,89,144,233,377,570,671,703,812};scanf("%dM,&m);for(j=0;j<15;j++)printf(H%4du,a[j]);printf(',\n°,);i=7；while(fabs(i-7)<8)(if(m<a[7])(if(a[i]-m-0)(printf(nitisat(%d)\nM,i+l);break;)i-；)elseif(m>a[7])(if(a[i]-m==0)(printf("itisat(%d)\nMj+l);break;)i++；)elseprintf("8'n");)if(fabs(i-7)-8=0)printf('Thereisnot\nM);intmain(intargc,char*argv[])(semicode();return0;〃求統(tǒng)計(jì)鍵盤(pán)輸入的三行字符#include"stdafx.h"#include<string.h>voidcountNum()(inti,ABC=0,abc=0,num=0,spa=0,other=0;charsti0[301],strl[l00],str2[l00],str3[100];gets(strl);gets(str2);gets(str3);〃strcat(dest,src)中dest不能為空否則src連接不上strcpy(strO,strl);〃strcat(strO,strl)不行原因是strO為空串,strcat(str0,str2);strcat(strO,str3);for(i=0;str0[i]!=W;i++)(if(strO[i]>=65&&strt)|i]<=90) ABC++;elseif(strt)[i]>=97&&str0[i]<=122)abc++;elseif(strt)[i]>=48&&str0[i]<=57)num++;elseif(strO[i]==32)spa++;elseother++;}printf("DaxieXiaoxieShuziKongeQita\nH);printf("％5d%7d%5d%6d%4d\n”,ABC,abc,num,spa50ther);1intmain(intargc,char*argv[])(countNum();return0;〃求打印平行四邊形圖案#include"stdafx.h"#include<string.h>voidprintPic()(inti;intj;intk;intt;intaa=0;inta[5][5];fbr(i=0;i<5;i++)for(j=O;j<5;j++)a[i]|j]='*'；for(k=0;k<5;k++){for(t=O;t<5;t++)printf("％5ゼprintf(',\n,');aa++;〃采用狀態(tài)標(biāo)記法來(lái)輸出空格個(gè)數(shù)if(aa==l)(printf(ハ)；}elseif(aa=2)(printグH);}elseif(aa=3)(printf(H");}elseprintfCu);1)intmain(intargc,char*argv[]){printPic();return0;〃求譯密碼#include"stdafx.hM#include<string.h>voiddecode()inti;charstrl[100],str2[100];gets(str1);〃輸入原文for(i=O;strl[i]!='\O,;i++)if(strl[i]>=65&&strl[i]<=90)str2[i]=155-strl[i];elseif(strl[i]>=97&&strl[i]<=122)str2[i]=219-strl[i];elsestr2[i]=strl[i];printf(u%s\nヽstr2);〃輸出密文printf(H%s\nM,str1);〃輸出原文1intmain(intargc,char*argv[])(decode();return0;〃求strcat#include"stdafx.h"#include<string.h>voidsstrcat()(inti,j;charstiO[2Ol],strl[100],str2[100];gets(strl);gets(str2);〃倆中方法都是可以得for(i=0;strl[i]!='\0,;i++)strO[i]=strl[i];for(j=0;str2|j]!='〇';j++)strO[i++]=str2[j];〃i++就是正確滴//sprintf(strO,"％s%s\n”,strl,sti*2);〃把strl,str2連起來(lái),(sprintf作用是)把格式化的數(shù)據(jù)寫(xiě)入某個(gè)字符串printf("%s\n%s\n%s\n",strl,str2,strO);intmain(intargc,char*argv[])sstrcat();return0;〃求字符串ASCII碼的差值#includeMstdafx.hM#include<string.h>voidcomprintO{inti,resu;charsl[100],s2[l(X)];printf("\ninputstringl:n);gets(sl);printf("\ninputstring2:'*);gets(s2);i=0;while(sl[i]==s2[i]&&sl[i]!=,\0,)i-H-;if(sl[i]=='\0'&&s2[i]=='\0')resu=0;//若是二者一直相等則直到最后為VT(null),固結(jié)果為〇值elseresu=sl[i]-s2[i];printf('n\nresult:%d\n",resu);}intmain(intargc,char*argv[])(comprintO;return0;〃氷strcpy#include"stdafx.h"#include<string.h>voidsstrcpyO(inti;charstrl|100],str2|100];//gets(strl);printf(Inputsi:")；scanf(n%s",strl);fbr(i=O;i<strlen(str1);i++)str2[i]=strl[i];printf(Hs2:%s\nH,str2);)intmain(intargc,char*argv[])(sstrcpyO;return0;〃求??一元二次方程的根?*#include"stdafx.h"#include<string.h>#include"math.h"yishigen(floatm,floatn,floatk)(floatxl,x2;xl=(-n+sqrt(k))/(2*m);x2=(-n-sqrt(k))/(2*m);printf(,'twoyishigenisxl=%0.3fandx2=%0.3f\n",xl,x2);)dengen(floatm,floatn){floatx;x=-n/(2*m);printf(”dengenisx=%0.3f\nM,x);)xugen(floatm,floatn,floatk)(floatx,y;x=-n/(2*m);y=sqrt(-k)/(2*m);printf(*'twoxugenisxl=%0.3f+%0.3fiandx2=%0.3f-%0.3f\n*',x,y,x,y);)intmain(intargc,char*argv[])(floata,b,c,q;printf(ninputabcisn);scanf("％f,%f,%f”,&a,&b,&c);printf(u\nM);q=b*b-4*a*c;if(q>0)yishigen(a,b,q);elseif(q==0)dengen(ムb);elsexugen(a,b,q);return0;〃求判斷ー個(gè)數(shù)是不是素?cái)?shù)#include"stdafx.h"#include<string.h>#include"math.h"voidprime()(intm,i,q；scanf("％d”,&m);q=sqrt(m);for(i=2;i<=q;i++)(if(m%i==0)printf("m=%d不是素?cái)?shù)、n”,m);elseprintf(Mm=%d是素?cái)?shù))}intmain(intargc,char*argv[])(prime();return0;〃求??矩陣轉(zhuǎn)置**#include"stdafx.h"#include<string.h>#include“math.h"voidzhuanzhi(intb[3][3])(inta[3][3];inti,j,t；〃利用臨時(shí)變量直接使用數(shù)組傳遞回去// for(i=0;i<3;i++)// for(j=i;j<3j++)// {// t=b[i][j];b[i][j]=bU][i];bU][i]=t;II〃又定義ー個(gè)數(shù)組作為內(nèi)存空間進(jìn)行轉(zhuǎn)置,〃不可使用b用[j]=b[j巾](這樣值會(huì)亂掉的);這個(gè)思路更利于理解for(i=0;i<3;i++)for(j=Ou<3;j++)a[i]U]=bU][i];for(i=0;i<3;i++)(for(j=0;j<3;j++)printfC%4dn,a[i][j]);printfC””)；}〃這兩種方法都要使用第三者變量的)intmain(intargc,char*argv[])(inta[3][3];inti,j;for(i=0;i<3;i++)for(j=O；j<3;j++)scanf(n%d\&a[i][j]);for(i=0;iv3;i++){for(j=0;j<3;j++)printf(”%d”,a[i皿)；printf(',\nH);}zhuanzhi(a);〃轉(zhuǎn)換后輸出矩陣for(i=0;i<3;i++){for(j=0;j<3;j++)printf("％d”間i皿)；printf(,,\n,t);}return0;〃求字符串反轉(zhuǎn)#include"stdafx.h"#include<string.h>#include"math,h"voidfanxu(char*strl)(inti,j;intss;charstr2|100];strcpy(str2,strl);ss=strlen(strl);〃注意for循環(huán)后一定不能帶;//for(i=0,j=ss-1;j>-1;i++,j—)for(i=0j=ss-1;j>-1;i++,j=j-1)strl[i]=str2[j];)intmain(intargc,char*argv[]){charstr0[100];gets(strO);fanxu(strO);puts(strO);return0;〃求字符串連接#includeustdafx.h"#include<string.h>#include"math.hHvoidlianjie(chara[l00],charb[100])(strcat(a,b);)intmain(intargc,char*argv[])(charstr0[100];charstrl|100];gets(strO);printf("\nH);gets(strl);lianjie(stiO,strl);puts(strO);return0;〃求字符串中元音字母復(fù)制問(wèn)題#include"stdafx.hM#include<string.h>#include"math.h"voidfuzhi(chara[l00],charb[100])(inti,j=0;for(i=0;a[i]!=、0';i++)(if(a[i]=97lla[i]==101lla[i]=105lla[i]==l1llla[i]==l1711a[i]==65lla[i]==69lla[i]==73lla[i]==85)(b|j]=a[i]；j++;intmain(intargc,char*argv[])(charstr0[100];charstrl[100]=｛〇｝;〃初始化為〇可解決燙字空碼問(wèn)題gets(strO);fuzhi(strO,strl);//puts(strl);printf(“元音字母是:%s\n",strl);return0;〃求數(shù)字空格問(wèn)題#include"stdafx.h"#include<string.h>#include"math.h"voidspcenull()(inti;charstrO[100];printf("請(qǐng)輸入四位數(shù)字:\n")；gets(strO);printf("加空格前是:%s\n",strO);printf("加空格后是:")；for(i=0;strO[i]!=W;i++)｛printf("%c”,strO[i]);printf(ハ)；printf(H\nM);)intmain(intargc,char*argv[])(spcenull();return0;〃求統(tǒng)計(jì)數(shù)字問(wèn)題#include"stdafx.h"#include<string.h>#include"math.h'1voidtongji(charstf0[100],intb|4])(inti;for(i=0;str0[i]!=\0';i++)(if(str0[i]>=65&&str0[i]<=90llstrt)[i]>=97&&str0[i]<=122)b[0]++;elseif(strf)[i]>=48&&strO[i]<=57)b[l]++;elseif(stiO[i]==32)b[2]++;elseb[3]++;})intmain(intargc,char*argv[])(charstrl[100];staticinti,a[4];〃靜態(tài)數(shù)組及變量的使用來(lái)傳遞和統(tǒng)計(jì)(值得學(xué)習(xí))gets(strl);tongji(strl,a);printf("zimushuzikonggeqita\nn);for(i=0;i<4;i++)printf("%-8d';a[i]);printf("\nn);return0;〃求統(tǒng)計(jì)最長(zhǎng)單詞問(wèn)題#include"stdafx.hM#include<string.h>#include"math.h"voidzuichang(charstr1[100|,charwordO|100])(inti,t=Oj=O;staticcharword1[15];for(i=0;strl[i]!=\0';i++)(if(!(strl[i]>=97&&str1[i]<=122llstrl[i]>=65&&strl[i]<=90))(〃不存在就跳過(guò)且保持j=0;t=j;j=0;continue;}word1|j]=strl[i];j++;if(j>=t)strcpy(wordO,wordl);〃只要wordl里不空就復(fù)制到wordO里面去intmain(intargc,char*argv[])(charstrl[100];charlongword[15];gets(strl);zuichang(strl,longword);puts(longword);return0;〃求冒泡排序問(wèn)題#include"stdafx.h"#include<string.h>#include"math.h"voidbubblesort(intx[10]){inti,j,t;for(j=l;j<10;j++)for(i=0;i<10-j;i++)if(x[i]>x[i+l])(t=x[i+l];x[i+l]=x[i];x[i]=t;intmain(intargc,char*argv[])(inty[10];inti;printff請(qǐng)隨即輸入10個(gè)數(shù)字:\nH);for(i=0;i<10;i++)〃scanf時(shí)輸入多個(gè)數(shù)據(jù)之間一定要有由空格的,不然程序不能順利執(zhí)行scanf(n%d';&y[i]);bubblesort(y);fbr(i=0;i<10;i++)printf("％5d”,y「]);printf("\n");return0;〃求牛頓迭代法求根#include"stdafx.h"#include<string.h>#include"math.h"doubleqigen(ints,intt,intu,intv){doublex,y;x=l;do(y=S*X*X*X+t*X*X+U*X+V；x=x-y/(3*s*x*x+2*t*x+u);}while(y!=0);returnx;)intmain(intargc,char*argv[])(inta,b,c,d;doublex;printf(“請(qǐng)輸入方程的系統(tǒng)a,b,c,d:\n")；scanf("%d,%d,%d,%d”,&a,&b,&c,&d);〃輸出表列一定要與格式控制一致(,)x=qigen(a,b,c,d)；printf(Hx=%0.3f\n",x);return0;〃求n階勒讓德多項(xiàng)式的值#include"stdafx.h"#include<string.h>#include"math.h"floatp(floatxO,intn)(floaty;if(n==0lln=l)(if(n==l)y=xO;elsey=l;}elsey=((2*n-1)*xO*p(xO,n-1)-(n-1)*p(x0,n-2))/n;returny;}intmain(intargc,char*argv[])(floatx,yO;inta,i;scanf("％f,%d”,&x,&a);〃注意別忘了逗號(hào)yO=p(x,a);printf(Hy0=%0.3f,\nM,y0);return0;〃求十六進(jìn)制轉(zhuǎn)十進(jìn)制數(shù)#include"stdafx.h"#include<string.h>#include"math.h,,intOxDec(charshu[100])(inti,j;intsum=0;j=strlen(shu)-l;for(i=0;shu[i]!='\0';i++)if(48<=shu[i]&&shu[i]<=57){sum=sum+(shu[i]-48)*pow(16,j);j=j-l;}elseif(shu[i]>=65&&shu[i]<=70){sum=sum+(shu[i]-50)*pow(16,j);j=j-l;}elseif(shu[i]>=97&&shu[i]<=102){sum=sum+(shu[i]-87)*pow(16,j);j=j-l;}returnsum;intmain(intargc,char*argv[])(charshuf[100];ints;gets(shuf);s=OxDec(shuf);if(s)(printf("s=%d\n",s);}else〃如何判斷出不是十六進(jìn)制數(shù)printf('Thenumberisnot0X\n");return0;〃求??整數(shù)n轉(zhuǎn)換成字符串**#include"stdafx.h"#include<string.h>#include"math.h"voidexchange(intn)〃轉(zhuǎn)換函數(shù)定義部分(inti;if((i=n/10)!=0)exchange(i);〃i=n/10,保存了,因?yàn)閕和10都是整數(shù),所以結(jié)果不會(huì)是浮點(diǎn)型;如果等于〇,說(shuō)明n就是一位數(shù);不為〇說(shuō)明n是個(gè)多位數(shù),遞歸調(diào)用，處理i,即n除去個(gè)位的部分putchar(n%10+,〇,);〃n%10取余數(shù)運(yùn)算,結(jié)果就是n的最低位?！槭裁唇Y(jié)果沒(méi)有""(引號(hào))？?)intmain(intargc,char*argv[])(intn;printf("輸入ー個(gè)整數(shù)、n\n");scanf("%d",&n);printf("輸出是;\n\n");if(n<0)〃如果輸入的是負(fù)數(shù),則輸出負(fù)號(hào)然后轉(zhuǎn)化為正數(shù)處理(// putchar('-');// n=-n;〃上面做法好像不行滴，下面采用絕對(duì)值函數(shù)來(lái)轉(zhuǎn)化n=abs(n);exchange(n);〃調(diào)用轉(zhuǎn)換函數(shù)，其中包括了轉(zhuǎn)換和輸出printf(”\n\n");return0;〃求一年中的第幾天#includeMstdafx.hM#include<string.h>#include"math.hnintDay(intyear,intmonth,intdate){intdays=0,i;intmonths[13]={0,31,0,31,30,31,3031,31,30,31,30,31)；if((year%4==0&&year%100!=0)ll(year%400==0))〃判斷是否是閏年months[2]=29;〃數(shù)組名與變量名是不能相同的elsemonths[2]=28;fbr(i=l;ivmonth;i++)days二days+months[i];〃計(jì)算該月以前幾個(gè)的天數(shù)總和days=days+date;returndays;}intmain(intargc,char*argv[])(intyear,month,date,day;scanf(',%d%d%dM,&year,&month,&date);day=Day(year,month,date);//C語(yǔ)言區(qū)分大小寫(xiě),變量名與函數(shù)名不能相同printf('Thedayisthe%dthday\n',,day);return0;)〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃[第九章〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃〃ノ〃〃〃〃〃〃〃〃〃〃〃求帶參數(shù)的宏定義兩個(gè)數(shù)交換#include“stdafx.h"#include<string.h>#include"math.h"#defineCHANGE(ムb,t)t=a;a=b;b=t;intmain(intargc,char*argv[])(intc,d,s;printf("輸入兩個(gè)數(shù)以,分開(kāi):")；scanfC'%d,%dM,&c,&d);CHANGE(c,d,s);printf(,'c=%d,d=%d\n,,,c,d);return0;〃求帶參數(shù)宏求兩數(shù)取余#include"stdafx.h"#include<string.h>#include"math.h"〃力.法一:#defineCHANGE(a,b,t)t=a%b;intmain(intargc,char*argv[])(intc,d,s;printf("輸入兩個(gè)數(shù)以,分開(kāi)：”);scanf("%d,%du,&c,&d);CHANGE",d,s);printf(,'s=%d\n,',s);return0;)〃方法二:#defineQ(a,b)a%bmain(){intc,d,t;scanf(u%d%dM,&c,&d);t=Q(c,d);printf(,,t=%d\n",t);)〃求條件編譯輸出電報(bào)翻譯#include"stdafx.h"#include<string.h>#include"math.hH#defineCHANGE1intmain(intargc,char*argv[])(charstr[80],c;inti=0;gets(str);while(str[i]!=A0')#ifCHANGEif(str[i]=90llstr[i]==122)str[i]=str[i]-25;elseif(str[i]>=65&&str[i]<=90llstr[i]>=97&&str[i]<=l22)str[i]=str[i]+1;#endifi++；}puts(str);〃若#defineCHANGE0則條件編譯部分就不會(huì)執(zhí)行,即你輸入什么則輸出什么return0;)〃求指針實(shí)現(xiàn)3個(gè)整數(shù)的從小到大輸出#includeMstdafx.hM#include<string.h>#include"math.h"intmain(intargc,char*argv[])(inta,b,c;int*pl,*p2,*p3,*t;〃如果將t定義為整形變量則報(bào)錯(cuò):'=':cannotconvertfrom'int'to'int*'scanf(M%d%d%d';&a,&b,&c);p1=&a,p2=&b,p3=&c;if(*pl>*p2)(t=p1;p1=p2;p2=t;〃指針之間的交換值中間變量也必須是指針)if(*p2>*p3)(t=p2;p2=p3;p3=t;)if(*pl>*p3)(t=p3;p3=pl;pl=t;)printf("%d,%d,%d\n",*pl,*p2,*p3);return0;〃求?***指針實(shí)現(xiàn)3個(gè)字符串的從小到大輸出***#include"stdafx.h"#include<string.h>#include"math.h"defineN3defineM20intmain(intargc,char*argv[])(charstrf)[10],strl[l0],str2[10];char*p,q[10];//strcpy中可以使用指針的int// q=str0[0];//q=&str0[0][0];gets(strO);gets(strl);gets(str2);t=strcmp(strO,strl);if(t>0)(strcpy(q,strO);strcpy(strO,strl);strcpy(strl,q);)m=strcmp(strO,str2);if(m>0)(strcpy(q,strO);strcpy(sti€,strl);strcpy(strl,q);}n=strcmp(str1,str2);if(n>0)(strcpy(q,strl);strcpy(strI,str2);strcpy(str2,q);)puts(strO);puts(strl);puts(str2);return0;〃求?***指針實(shí)現(xiàn)n個(gè)整數(shù)后移m個(gè)位置***#include"stdafx.h"#include<string.h>#include“math.h"defineN10voidshift(float*p,intx)inti;floata[N],*q,*r;0；q=p;for(i=0;i<x;i++)*(r+i)=*(q+N-x+i);for(p=p+N-l;p>=q;p-)*p=*(p-x);for(i=0;i<x;i++)*(q+i)=*(r+i);)intmain(intargc,char*argv[])(floatshuzhu[N],*u,*v;inth,i;u=v=shuzhu;scanf(u%f;&h);for(;uvv+N;u++)scanf(n%f;u);shift(v,h);for(u=v;u<v+N;u-h-)printf("％0.2f”,*u);printf(',\nH);return0;〃求從第m個(gè)字符后開(kāi)始的全部字符復(fù)制成為另ー個(gè)字符串#include"stdafx.h"#include<string.h>#include"math.h"#defineN5intmain(intargc,char*argv[])(chara[N+l],b[N+l],*p,*q;intm;gets(a);scanf("%d",&m);p=a+m;q=b;strcpy(q,p);puts(q);return0;數(shù)據(jù)結(jié)構(gòu):常用的查找與排序算法〃求順序查找莫個(gè)關(guān)鍵字#include"stdafx.h"#include<string.h>#include"malh.h"typedefstructstudent{intid;charname[10];floatscore;1Student;intsearch(Studentstu[]jntn,intkey)(inti;for(i=0;i<n;i++)if(stu|i].id==key)returni;〃查找成功return-1;}intmain(intargc,char*argv)(Studentstu[4]={{1004,nT0MM,100),{1002,“LILY”,95},{1001,“ANN”,93},{1003,“LUCY”,98}}；intaddr;addr=search(stu,4,1003);printf("StudentID:%d\nH,stu[addr].id);printf("Studentname:%s\n",stu[addr].name);〃一定要注意格式控制中的格式說(shuō)明(％和格式字符()d,s,c...),〃如％s,這個(gè)格式說(shuō)明一旦與變量定義時(shí)的類(lèi)型不匹配,則輸出表列就一定有問(wèn)題,甚至輸出為空或亂碼printf("Studentscore:%f\n",stu[addr].score);return0;1〃折半查找算法應(yīng)用:任意輸入一個(gè)數(shù)字n,用折半查找算法找到n位于數(shù)組中的位置#include"StdAfx.h"#include"stdio.h"intbin_search(inta[],intn,intkey){〃折半查找只能應(yīng)用于關(guān)鍵字有序(遞增或遞減)的順序表的查找,且一般不適用于對(duì)鏈表中記錄的查找intlow,high,mid;low=0;high=n-l;while(low<=high)(mid=(low+high)/2;if(a[mid]==key)returnmid;if(a[mid]<key)〃該算法僅適用于關(guān)鍵字順序遞增的有序表查找,若是遞減則將low和high的修改對(duì)調(diào)即可low=mid+l;elsehigh=mid-l;)return-1;)intmain(intargc,char*argv)(inti,p,key;inta[10]={2,3,5,7,8,10,12,15,19,21);printf("顯示數(shù)組a口〇]中的數(shù)據(jù):\n");for(i=0;i<10;i++)(printf(い)；printf(',%d,,,a[i]);)printf(“ヽn")；printf("請(qǐng)輸入關(guān)鍵字key:");scanf(H%d",&key);p=bin_search(a,10,key);if(p=-l)printf("關(guān)鍵字key=%d不在數(shù)組a中、n”,key);elseprintf("關(guān)鍵字key二％d在數(shù)組中的位置是:％d\n”,key,p);return0;〃直接插入排序算法應(yīng)用實(shí)現(xiàn)數(shù)據(jù)序列從大到小排序#include"stdafx.h"#include"stdio.h”voidinsertsort(intk[],intn)inttempt,ij;for(i=2;iv=n;i++)(k[0]=k[i];j=i-l;while(j>O&&k[O]<k(j])〃不能使用if判斷語(yǔ)句而是應(yīng)使用while循環(huán)語(yǔ)句kU+l]=k[j-];k[j+l]=k[O];})intmain(intargc,char*argv)(inti,j;intk[11]={-111,2,5,6,37,8,0,9,12,1};intn=10;for(i=l;i<=n;i++)(printf("%d",k[i]);printf("");}insertsort(k,10);printf(M\nM);printf("直接插入排序后:\n");for(j=l;j<=n;j++)(printf("%d",k|j]);printf("");)printf("\n");return0;選擇排序及應(yīng)用:〃選擇排序基本思想:第i趟排序從序列后n?i+l(i=l,2,...n-l)個(gè)元素中選擇ー個(gè)最小的元素,與該n-i+1個(gè)元素的最前面那個(gè)元素進(jìn)行位置交換(第i位置上的元素),直到i二n-L#include“StdAfx.h"#include"stdio.hMvoidselectsort(intk[],intn)inti,j,min;for(i=l;iv=n-l;i++)〃直到i=n-l(min=i;//max=ifor(j=i+l;jv=n;j++)〃第i趟排序是在n-i+1個(gè)元素中找到最小的元素位置if(k|j]vk[min])〃若是從大到小排序則改為k[j]>k[max],max=imin=j;〃用min記錄下最小元素的位置if(j!=i)〃第一趟時(shí)若第一個(gè)元素已經(jīng)是最小的拉,那么就不用交換,否則〃若是最小元素不位于*+1個(gè)元素檔里第一個(gè),則進(jìn)行元素交換(k[0]=k[min];k[min]=k[i];k[i]=k[OJ;intmain(intargc,char*argv)(inti;inta[l 11,256,3,7,8,0,9,12,1};〃初始化[0]可以為任意數(shù)printf('Theoriginaldataarrayis\n");for(i=l;i<=10;i++)(printf(H%dM,a[i]);printf(い)；}selectsort(a,10);printf(u\nTheresultofselectionsortingforthearrayis\nn);for(i=l;i<=10;i++)(printf("％d”,a[i])；printf(い)；)printf(“ヽn")；return0;#include"StdAfk.h”#include“stdio.h"〃冒泡排序算法應(yīng)用voidbubblesort(intk[],intn)for(i=l;(i<=n-l)&&(flag==l);i++)〃執(zhí)行n-1趟排序(flag=O;for(j=l;j<=n-i;j++)(if(k[j]>kU+l])//執(zhí)行數(shù)據(jù)交換(k[O]=k[j]；k[j]=kD+l];k[j+l]=k[O]；flag=l;〃表示本趟排序仍然有元素交換還需要比較intmain(intargc,char*argv){inti;inta[l1]={-11125,6,3,7,8,0,9/2,1};printf("排序前元素、n");for(i=l;i<=10;i++)(printf(n%dH,a[i]);printf(ハ);〃元素間空格}bubblesort(a,10);printf(n\nn);printf("排序后元素ハn");for(i=l;i<=10;i++)(printf("％d”,a[i])；printf(uM);)printf("\nn);return0;)//shel!排序includenStdAfx.hM#includenstdio.h"voidshellsort(intk[],intn)inti,j,gap,flag;gap二n;flag=O;while(gap>l)〃直到gap=l(gap=gap/2;〃增量縮小每次減半do〃子序列應(yīng)用冒泡排序(flag=0;for(i=l;i<=n-gap;i++)〃每次gap減半后執(zhí)行的次數(shù)(j=i+gap;if(k[i]>k|jj)(k[0]=k[i];k[i]=kU];k[j]=k[O];flag=l;))}while(flag!=0);))intmain(intargc,char*argv)(inti;inta[l1]={-11125,637,8,0,9,125}；printf("排序前元素:'n");for(i=l;i<=10;i++){printf(u%dM,a[i]);printf("")；)shellsort(aJO);printf(',\n,t);printf("排序后元素:'n")；for(i=l;i<=10;i++)(printf(M%dM,a[i]);printf(つ;)printf(、パ)；return0;)〃快速排序voidswap(int*p,int*q)〃數(shù)組序列中交換兩個(gè)元素位置(intt;t=*p;〃內(nèi)存空間還是那塊內(nèi)存空間,只是空間里的東西改變啦*p=*q;*q=t;)voidquicksort(intk[],ints,intt)(inti,j;inttempt;if(s<t){i=s;j=t+l；while(l)(doi++;while(!(k[s]<=k[i]lli=t));doj-Swhile(!(k[s]>=k[j]llj=s));>f(i<j)H (// tempt=k[i];〃這種交換也能做,只不過(guò)有點(diǎn)不合群呵呵// k[i]=kUJ；// k[j]=tempt;// }swap(&k[i],&k[j]);〃交換k[i]和k[j]的位置elsebreak;)swap(&k回,&k[j])”交換基準(zhǔn)元素與如]的位置,完成一次劃分// if(i>=j)〃 {// tempt=k[s];// k[s]=k[j];// k[j]=tempt;// )quicksort(k,sj-1);quicksort(k,j+l,t);intmain(intargc,char*argv)(intk[l0]={2,5,6,3,7,80,9,12,1};inti;printf('Theoriginaldataarrayis\nM);for(i=0;i<10;i++){printf(,,%d,,,k[i]);printf(nn);)quicksort(k,0,9);printf(n\nTheresultofquicksortingforthearrayis\nM);for(i=0;i<10;i++){printf("％d”,k[i])；printf("");}printf(”\n")；return0;1數(shù)據(jù)結(jié)構(gòu)基礎(chǔ)(線性表,隊(duì)列,棧)〃順序表的創(chuàng)建(初始化)和插入刪除操作#defineMaxSize10//typedefintElemType//typedefstruct{//int*elem;//intlength;//intlistsize;//JSqlist;//voidcreateSqlist(Sqlist*List)//{// List->elem=(int*)malloc(MaxSize*sizeof(ElemType));// if(!List->elem)exit(O);//List->length=O;// L->listsize=MaxSize;//}voidInsertElem(intSqlist[],int*len,inti,intx)(intt;if(i<1lli>*len+1ll*len==MaxSize)(printf('Thisinsertisillegal\n,^);return;砧「(1=?宜?1；3=レ1;レ)〃找到表中的第i個(gè)位置(下標(biāo)為i-1)上插入元素Sqlist[t+l]=Sqlist[t];Sqlist[i-l]=x;*len=*len+l;}voidDelElem(intSqlist[],int*len,inti)(intj;if(i<lIIi>*len)〃若是!en則出現(xiàn)錯(cuò)誤:noconversionfrom*int*'torint,(printf(*ThisdeletiserroH);return;}for(j=i;j<=*len-l;j++)〃將第i個(gè)元素之后的元素前移,表長(zhǎng)減ーSqlist|j-1]=Sqlist[j];*len=*len-l;〃表長(zhǎng)減!intmain(intargc,char*argv)(intSqlist[MaxSize]，定義ー個(gè)靜態(tài)順序表intlen;//len通過(guò)指針變量來(lái)動(dòng)態(tài)改變其值inti;printf("從鍵盤(pán)輸入六個(gè)數(shù)字:'n”)；for(i=0;i<6;i++)scanf("%d”,&Sqlist[i]);〃從鍵盤(pán)輸入6個(gè)數(shù)字len=6;for(i=0;i<len;i++)printf(”%d”,Sqlist[i])；InsertElem(Sqlist,&len,3,0);printf(”插入元素0后:")；for(i=0;i<len;i++)printf("%d",Sqlist[i]);DelElem(Sqlist,&len,3)；printf("刪除第3個(gè)位置元素后:'n”)；for(i=O;i<len;i++)printf("％d”,Sqlist[i])；printf(,,'nH);return0;〃創(chuàng)建一個(gè)鏈表并輸出其數(shù)據(jù)域的內(nèi)容#include"sldafx.h"#include"stdio.h"#include"stdlib.h"typedefintElemType;typedefstructnode(ElemTypedata;structnode*next;}LNode,*LinkList;〃?LinkList是后面指針類(lèi)型的變量的需要LinkListCreatMyList(intn){LinkListp,q,mylist=NULL;ElemTypee;inti;for(i=l;i<=n;i++)(scanf(n%d'\&e);p=(LinkList)malloc(sizeof(LNode))y/malloc還回的是ー個(gè)指針類(lèi)型p->data=e;p->next=NULL;if(!mylist)mylist=p;〃表頭(第一結(jié)點(diǎn))先建立elseq?>next=pン/開(kāi)始建表q=p；)returnmylist;}intmain(intargc,char*argv)(inte,i;LinkLists,t;intn;printf("請(qǐng)輸入鏈表結(jié)點(diǎn)的個(gè)數(shù)n:\nH);scanf("%d",&n);printf("請(qǐng)輸入鏈表％d個(gè)結(jié)點(diǎn)數(shù)據(jù)域值e:\n\n);s=CreatMyList(n);printf('ThecontentoftheLinkList\nH);for(i=l;iv=n;i++)〃輸出數(shù)據(jù)順序號(hào)(printf(,'[%d]\i);printf(M\nM);while(s)〃輸出鏈表數(shù)據(jù)域的值printf(,,%d->,',s->data);s=s->next;)printf(',\nM);return0;)〃創(chuàng)建一個(gè)鏈表及鏈表的刪除和銷(xiāo)毀#includeustdafx.hn#include"stdio.h"#include"stdlib.h"typedefintElemType;typedefstructnode(ElemTypedata;structnode*next;}LNode,*LinkList;〃?LinkList是后面指針類(lèi)型的變量的需要LinkListCreatMyList(intn){LinkListp,q,mylist=NULL;ElemTypee;inti;for(i=l;i<=n;i++)(scanf("％d”,&e);p=(LinkList)malloc(sizeof(LNode))y/malloc還回的是ー個(gè)指針類(lèi)型p->data=e;p->next=NULL;if(!mylist)mylist二p;〃表頭(第一結(jié)點(diǎn))先建立elseq->next=p;〃開(kāi)始建表q=p；}returnmylist;)voiddelLinkList(LinkList*mylist,LinkListq)〃刪除鏈表的莫個(gè)結(jié)點(diǎn)(LinkListr;if(q==*mylist)〃如果刪除的是第一個(gè)結(jié)點(diǎn)*mylist=q->next;free(q);}else{〃刪除其他結(jié)點(diǎn)for(r=*mylist;r->next!=q;r=r-