




版權(quán)說明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)
文檔簡介
..二2.1#include<iostream.h>voidmain<>{//本題原考慮在16位機(jī)器上實(shí)驗(yàn)?zāi)壳岸酁?2位機(jī)器故已過時(shí)。inta=42486;cout<<oct<<a<<endl<<hex<<a<<endl;unsignedb=42486;cout<<dec<<<signed>b<<endl;}2.2#include<iostream.h>#include<iomanip.h>constdoublepi=3.1415926;voidmain<>{doubleradius1,radius2;cout<<"pleaseinputtwonumbers:\n";cin>>radius1>>radius2;cout<<setw<10><<pi<<setw<10><<radius1<<setw<10><<<pi*radius1*radius1><<endl<<setw<10><<pi<<setw<10><<radius2<<setw<10><<<pi*radius2*radius2><<endl;}2.3#include<iostream.h>#include<iomanip.h>constdoublee=2.718281828;voidmain<>{cout<<setprecision<10><<e<<endl<<setiosflags<ios::fixed><<setprecision<8><<e<<endl<<setiosflags<ios::scientific><<e<<endl;}2.4#include<iostream.h>voidmain<>{cout<<"\"Howmanystudentshere?\"\n"<<"\"500\"\n";}2.5#include<iostream.h>voidmain<>{cout<<"sizeofchar"<<sizeof<char><<"byte\n"<<"sizeofunsignedchar"<<sizeof<unsignedchar><<"byte\n"<<"sizeofsignedchar"<<sizeof<signedchar><<"byte\n"<<"sizeofint"<<sizeof<int><<"byte\n"<<"sizeofunsigned"<<sizeof<unsigned><<"byte\n"<<"sizeofsigned"<<sizeof<signed><<"byte\n"<<"sizeofshort"<<sizeof<short><<"byte\n"<<"sizeofunsignedshort"<<sizeof<unsignedshort><<"byte\n"<<"sizeoflong"<<sizeof<long><<"byte\n"<<"sizeofsignedlong"<<sizeof<signedlong><<"byte\n"<<"sizeofunsignedlong"<<sizeof<unsignedlong><<"byte\n"<<"sizeoffloat"<<sizeof<float><<"byte\n"<<"sizeofdouble"<<sizeof<double><<"byte\n"<<"sizeoflongdouble"<<sizeof<longdouble><<"byte\n";}2.61>pleaseinput3sidesofonetriangle:6,6,8a=6.00,b=6.00,c=8.00areaoftriangleis17.888542>該程序計(jì)算三角形的面積前后分為三部分輸入處理輸出。3>//#include<stdio.h>#include<iostream.h>#include<iomanip.h>#include<math.h>voidmain<>{floata,b,c,s,area;//printf<"pleaseinput3sidesofonetriangle:\n">;cout<<"pleaseinput3sidesofonetriangle:\n";//scanf<"%f,%f,%f",&a,&b,&c>;//輸入時(shí)以逗號(hào)作為數(shù)據(jù)間隔cin>>a>>b>>c;//輸入時(shí)以空格作為數(shù)據(jù)間隔s=<a+b+c>/2;area=sqrt<s*<s-a>*<s-b>*<s-c>>;//printf<"a=%7.2f,b=%7.2f,c=%7.2f\n",a,b,c>;cout<<setiosflags<ios::fixed><<setprecision<2><<"a="<<setw<7><<a<<",b="<<setw<7><<b<<",c="<<setw<7><<c<<endl;//printf<"areaoftriangleis%10.5f",area>;cout<<"areaoftriangleis"<<setw<10><<setprecision<5><<area<<endl;}4>#include<iostream.h>#include<iomanip.h>#include<math.h>floatarea<floata,floatb,floatc>;//函數(shù)聲明voidmain<>{floata,b,c;cout<<"pleaseinput3sidesofonetriangle:\n";cin>>a>>b>>c;//輸入時(shí)以空格作為數(shù)據(jù)間隔floatresult=area<a,b,c>;//函數(shù)調(diào)用cout<<setiosflags<ios::fixed><<setprecision<2><<"a="<<setw<7><<a<<",b="<<setw<7><<b<<",c="<<setw<7><<c<<endl;cout<<"areaoftriangleis"<<setw<10><<setprecision<5><<result<<endl;}floatarea<floata,floatb,floatc>//函數(shù)定義{floats=<a+b+c>/2;returnsqrt<s*<s-a>*<s-b>*<s-c>>;}2.7Inmain<>:Entertwonumbers:38Callingadd<>:Inadd<>,received3and8andreturn11Backinmain<>:cwassetto11Exiting...2.8#include<iostream.h>#include<math.h>doubleCylinder<doubler,doubleh>;voidmain<>{doubleradius,height;cout<<"請(qǐng)輸入圓柱體的半徑和高:\n";cin>>radius>>height;doublevolume=Cylinder<radius,height>;cout<<"該圓柱體的體積為"<<volume<<endl;}doubleCylinder<doubler,doubleh>{returnr*r*M_PI*h;}三3.1sqrt<pow<sin<x>,2.5>><a*x+<a+x>/<4*a>>/2pow<c,x*x>/sqrt<2*M_PI>//M_PI為BC中math.h中的圓周率常數(shù)3.213.72.593.3a1=1a2=11.12,0.0203.4#include<iostream.h>voidmain<>{intx;cout<<"pleaseinputx:\n";cin>>x;if<x<=-1>cout<<<x-1><<endl;if<x>-1&&x<=2>cout<<2*x<<endl;if<2<x&&x<=10>cout<<x*<x+2>;}3.5#include<iostream.h>voidmain<>{inta;cout<<"pleaseinputanumber:\n";cin>>a;intc1=a%3==0;intc2=a%5==0;intc3=a%7==0;switch<<c1<<2>+<c2<<1>+c3>{case0:cout<<"不能被3,5,7整除.\n";break;case1:cout<<"只能被7整除.\n";break;case2:cout<<"只能被5整除.\n";break;case3:cout<<"可以被5,7整除.\n";break;case4:cout<<"只能被3整除.\n";break;case5:cout<<"可以被3,7整除.\n";break;case6:cout<<"可以被3,5整除.\n";break;case7:cout<<"可以被3,5,7整除.\n";break;}}3.6#include<iostream.h>voidmain<>{intgrade;cout<<"pleaseinputanumber:\n";cin>>grade;if<grade>100||grade<0>cout<<"錯(cuò)誤的成績.\n";elseif<grade>=90>cout<<"A.\n";elseif<grade>=80>cout<<"B.\n";elseif<grade>=70>cout<<"C.\n";elseif<grade>=60>cout<<"D.\n";elsecout<<"E.\n";}四4.1 1 #include<iostream.h>#include<math.h>voidmain<>{doublesum=1,t=-1,x;inti=1;cout<<"pleaseinputavalue:\n";cin>>x;do{t*=<-1>*x/i;sum+=t;i++;}while<fabs<t>>1e-8>;cout<<"sum="<<sum<<endl;}2#include<iostream.h>#include<math.h>voidmain<>{doublesum=1,t=-1,x;cout<<"pleaseinputavalue:\n";cin>>x;inti=1;while<fabs<t>>1e-8>{t*=<-1>*x/i;sum+=t;i++;}cout<<"sum="<<sum<<endl;}3#include<iostream.h>#include<math.h>voidmain<>{doublesum=1,t=-1,x;cout<<"pleaseinputavalue:\n";cin>>x;for<inti=1;fabs<t>>1e-8;i++>{t*=<-1>*x/i;sum+=t;}cout<<"sum="<<sum<<endl;}4.2#include<iostream.h>voidmain<>{longsum=0,t=1;for<inti=1;i<=15;i++>{t*=i;sum+=t;}cout<<"sum="<<sum<<endl;}4.3#include<iostream.h>voidmain<>{for<inti=1;i<=9;i++>for<intj=0;j<=9;j++>for<intk=0;k<=9;k++>if<i*i*i+j*j*j+k*k*k==100*i+10*j+k>cout<<<100*i+10*j+k><<"是水仙花數(shù).\n";}4.4#include<iostream.h>voidmain<>{for<inti=1;i<1000;i++>{intsum=0;for<intj=1;j<=i/2;j++>if<i%j==0>sum+=j;if<sum==i>cout<<i<<"是完數(shù).\n";}}4.5#include<iostream.h>voidmain<>{floats=100,h=100;for<inti=1;i<10;i++>{s+=h;h/=2;}cout<<"共經(jīng)過"<<s<<"米第10次反彈"<<h<<"米高.\n";}4.6#include<iostream.h>voidmain<>{intpeachs=1;for<inti=1;i<10;i++>peachs=<peachs+1>*2;cout<<"第一天共摘下"<<peachs<<"個(gè)桃子.\n";}4.7#include<iostream.h>#include<math.h>voidmain<>{doublex,a;cout<<"pleaseinputavalue:\n";cin>>a;x=a/2;while<fabs<<x-a/x>/2>>1e-7>x=<x+a/x>/2;cout<<a<<"的平方根是"<<x<<endl;}4.81#include<iostream.h>voidmain<>{for<inti=1;i<=10;i++>{for<intj=1;j<=10-i;j++>cout<<"";for<intj=1;j<=2*i-1;j++>cout<<"#";cout<<endl;}}2#include<iostream.h>voidmain<>{for<inti=1;i<=8;i++>{for<intj=1;j<=i;j++>cout<<"";for<intj=1;j<=18-i;j++>cout<<"#";cout<<endl;}}4.91#include<iostream.h>#include<iomanip.h>voidmain<>{cout<<"*";for<inti=1;i<=9;i++>cout<<setw<4><<i;cout<<"\n-----------------------------------------\n";for<inti=1;i<=9;i++>{cout<<setw<3><<i;for<intj=1;j<=9;j++>cout<<setw<4><<i*j;cout<<endl;}}2#include<iostream.h>#include<iomanip.h>voidmain<>{cout<<"*";for<inti=1;i<=9;i++>cout<<setw<4><<i;cout<<"\n-----------------------------------------\n";for<inti=1;i<=9;i++>{cout<<setw<3><<i;for<intj=1;j<=i;j++>cout<<setw<4><<i*j;cout<<endl;}}3#include<iostream.h>#include<iomanip.h>voidmain<>{cout<<"*";for<inti=1;i<=9;i++>cout<<setw<4><<i;cout<<"\n-----------------------------------------\n";for<inti=1;i<=9;i++>{cout<<setw<3><<i;if<i!=1>cout<<setw<4*i-4><<"";for<intj=i;j<=9;j++>cout<<setw<4><<i*j;cout<<endl;}}4.10#include<iostream.h>voidmain<>{intn;longa=1,b=1,c=1,temp;cout<<"pleaseinputavalue:\n";cin>>n;for<inti=4;i<=n;i++>{temp=a+c;a=b;b=c;c=temp;}cout<<c<<endl;}五5.1#include<iostream.h>#include<iomanip.h>#include<math.h>boolisprime<longn>;voidmain<>{//inputlonga,b,l=0;cout<<"pleaseinputtwonumbers:\n";cin>>a>>b;cout<<"primesfrom"<<a<<"to"<<b<<"is\n";//processif<a%2==0>a++;for<longm=a;m<=b;m+=2>if<isprime<m>>{//outputif<l++%10==0>cout<<endl;cout<<setw<5><<m;}}boolisprime<longn>{intsqrtm=sqrt<n>;for<inti=2;i<=sqrtm;i++>//判明素?cái)?shù)if<n%i==0>returnfalse;returntrue;}5.2#include<iostream.h>#include<iomanip.h>#include<math.h>doublef<doublex>;doubleintegral<doublea,doubleb>;constdoubleeps=1e-8;voidmain<>{doublea=0,b=1;cout<<"theintegraloff<x>from"<<a<<"to"<<b<<"is\n"<<setiosflags<ios::fixed><<setprecision<8><<setw<8><<integral<a,b><<endl;}doublef<doublex>{returnexp<x>/<1+x*x>;}doubleintegral<doublea,doubleb>{intn=1;doubleh,tn,t2n,i2n,in=0;h=b-a;t2n=i2n=h*<f<a>+f<b>>/2;while<fabs<i2n-in>>=eps>{tn=t2n;in=i2n;doublesigma=0.0;for<intk=0;k<n;k++>{doublex=a+<k+0.5>*h;sigma+=f<x>;}t2n=<tn+h*sigma>/2.0;//變步長梯形i2n=<4*t2n-tn>/3.0;//辛普生公式n*=2;h/=2;}returni2n;}5.3#include<iostream.h>#include<iomanip.h>voidmultab1<>;voidmultab2<>;voidmultab3<>;voidmain<>{multab1<>;multab2<>;multab3<>;}voidmultab1<>{cout<<"*";for<inti=1;i<=9;i++>cout<<setw<4><<i;cout<<"\n-----------------------------------------\n";for<inti=1;i<=9;i++>{cout<<setw<3><<i;for<intj=1;j<=9;j++>cout<<setw<4><<i*j;cout<<endl;}cout<<endl<<endl;}voidmultab2<>{cout<<"*";for<inti=1;i<=9;i++>cout<<setw<4><<i;cout<<"\n-----------------------------------------\n";for<inti=1;i<=9;i++>{cout<<setw<3><<i;for<intj=1;j<=i;j++>cout<<setw<4><<i*j;cout<<endl;}cout<<endl<<endl;}voidmultab3<>{cout<<"*";for<inti=1;i<=9;i++>cout<<setw<4><<i;cout<<"\n-----------------------------------------\n";for<inti=1;i<=9;i++>{cout<<setw<3><<i;if<i!=1>cout<<setw<4*i-4><<"";for<intj=i;j<=9;j++>cout<<setw<4><<i*j;cout<<endl;}cout<<endl<<endl;}5.4Main--x=5,y=1,n=1Func--x=6,y=21,n=11Main--x=5,y=1,n=11Func--x=8,y=31,n=215.5#include<iostream.h>voidmain<>{intn;longa=1,b=1,temp;cout<<"pleaseinputanumber:\n";cin>>n;for<inti=3;i<=n;i++>{temp=a+b;a=b;b=temp;}cout<<b<<endl;}5.6doublepoly<intn,double>{if<n==0>return1;if<n==0>returnx;return<<2*n-1>*x*poly<n-1,x>-<n-1>*poly<n-2,x>>/n;}5.7#include<iostream.h>#include<math.h>voidmain<>{doublex,y;x=3.14159/4;do{y=x;//x-=<cos<x>-x>/<sin<x>-1>;x=cos<x>;}while<fabs<x-y>>1e-6>;cout<<x<<endl;}//答案為:0.7390855.8#include<iostream.h>voiddisplay<doubled>{cout<<"Adouble:"<<d<<endl;}voiddisplay<inti>{cout<<"Aint:"<<i<<endl;}voiddisplay<charc>{cout<<"Achar:"<<c<<endl;}voidmain<>{doublea=100.0;floatf=1.0;intn=120;charch='c';shorts=50;display<a>;display<f>;display<n>;display<ch>;display<s>;}5.9#include<iostream.h>longcattle<intn>;voidmain<>{intn;cout<<"pleaseinputanumber:\n";cin>>n;cout<<cattle<n><<endl;}longcattle<intn>{if<n<=0>return0;if<n<=3>return1;returncattle<n-1>+cattle<n-3>;}六6.1<1>//file1.cppintx=1;intfunc<>{//...}//file2.cppexternintx;intfunc<>;voidg<>{x=func<>;}//file3.cppexternintx=2;//error:externint變量若有賦值則成定義intg<>;//error:函數(shù)聲明與前面不一致voidmain<>{x=g<>;//...}<2>//file1.cppintx=5;inty=8;externintz;//file2.cppintx;//error:intx;重復(fù)定義externdoubley;//error:y同一名字不同類型定義externintz;//error:z只有聲明卻無定義6.2256.3#include"multab.h"voidmain<>{multab1<>;multab2<>;multab3<>;}//6_3_1#include"multab.h"voidmultab1<>{cout<<"*";for<inti=1;i<=9;i++>cout<<setw<4><<i;cout<<"\n-----------------------------------------\n";for<inti=1;i<=9;i++>{cout<<setw<3><<i;for<intj=1;j<=9;j++>cout<<setw<4><<i*j;cout<<endl;}cout<<endl<<endl;}//6_3_2#include"multab.h"voidmultab2<>{cout<<"*";for<inti=1;i<=9;i++>cout<<setw<4><<i;cout<<"\n-----------------------------------------\n";for<inti=1;i<=9;i++>{cout<<setw<3><<i;for<intj=1;j<=i;j++>cout<<setw<4><<i*j;cout<<endl;}cout<<endl<<endl;}//6_3_3#include"multab.h"voidmultab3<>{cout<<"*";for<inti=1;i<=9;i++> cout<<setw<4><<i;cout<<"\n-----------------------------------------\n"; for<inti=1;i<=9;i++>{cout<<setw<3><<i;if<i!=1>cout<<setw<4*i-4><<"";for<intj=i;j<=9;j++>cout<<setw<4><<i*j;cout<<endl;}cout<<endl<<endl;}//6_3.h#include<iostream.h>#include<iomanip.h>voidmultab1<>;voidmultab2<>;voidmultab3<>;七7.1#include<iostream.h>intfindMinIndex<inta[],intn>;voidmain<>{intarray[]={34,91,83,56,29,93,56,12,88,72};intsize=sizeof<array>/sizeof<*array>;intminIndex=findMinIndex<array,size>;cout<<"最小數(shù):"<<array[minIndex]<<endl<<"相應(yīng)的下標(biāo):"<<minIndex<<endl;}intfindMinIndex<inta[],intn>{intindex=0;for<inti=1;i<n;i++>if<a[index]>a[i]>index=i;returnindex;}7.2#include<iostream.h>intinsert<inta[],intn,intvalue>;voidmain<>{intarray[]={12,29,34,56,72,83,88,91};intsize=sizeof<array>/sizeof<*array>;cout<<"插入前的數(shù)組:\n";for<inti=0;i<size;i++>cout<<array[i]<<"";intaValue;cout<<"\npleaseinputanumber:\n";cin>>aValue;intmax=insert<array,size,aValue>;cout<<"\n最大數(shù):"<<max<<endl;cout<<"插入后的數(shù)組:\n";for<inti=0;i<size;i++>cout<<array[i]<<"";}intinsert<inta[],intn,intvalue>{if<a[n-1]<=value>returnvalue;intretValue=a[n-1];inti;for<i=n-2;i>=0&&a[i]>value;i-->a[i+1]=a[i];a[i+1]=value;returnretValue;}7.3#include<iostream.h>constintnum=17;voidmain<>{intinterval=3;inta[num];for<inti=0;i<num;i++>cout<<<a[i]=i+1><<",";cout<<endl;inti=<interval-1>%num;for<intk=1;k<num;k++>{ cout<<a[i]<<",";a[i]=0;for<intj=1;!<a[i]&&<j++==interval>>;i=<i+1>%num>;//數(shù)數(shù)}cout<<"\nNo."<<a[i]<<"boyhaswon.\n";//輸出勝利者}7.4voidSwap<int&a,int&b>{inttemp=a;a=b;b=temp;}voidBsort<inta[],intn>{booldontLoopAgain=false;while<dontLoopAgain=!dontLoopAgain>for<inti=0,pass=--n;i<n;i++>if<a[i]>a[i+1]>{dontLoopAgain=false;Swap<a[i],a[i+1]>;}}7.5#include<iostream.h>constintn=5;intsum<inta[][5],intsize>;voidmain<>{intarray[n][n]={{3,2,4,1,5},{8,7,2,5,6},{6,9,1,4,3},{5,5,3,6,2},{2,8,1,8,6}};cout<<sum<array,n>;}intsum<inta[][5],intsize>{ints=0;for<inti=0;i<size;i++>s+=a[i][i]+a[i][size-i-1];if<size%2==1>s-=a[size/2][size/2];returns;}7.6#include<iostream.h>voidfindMax<inta[][4],introw,intcol>;voidfindBad<inta[][4],introw,intcol>;voidaverage<inta[][4],introw,intcol>;voidmain<>{intarray[5][4]={{88,67,48,91},{61,65,37,77},{92,81,73,60},{51,55,60,60},{77,63,70,80}};findMax<array,5,4>;findBad<array,5,4>;average<array,5,4>;}voidfindMax<inta[][4],introw,intcol>{intr=0,c=0;for<inti=0;i<row;i++>for<intj=0;j<col;j++>if<a[i][j]>a[r][c]>r=i,c=j;cout<<"成績最高的學(xué)生序號(hào):"<<<r+1><<"";for<inti=0;i<col;i++>cout<<a[r][i]<<"";cout<<endl;}voidfindBad<inta[][4],introw,intcol>{for<inti=0;i<row;i++>for<intj=0;j<col;j++>if<a[i][j]<60>{cout<<"有不及格課程的學(xué)生序號(hào):"<<<i+1><<"";for<intk=0;k<col;k++>cout<<a[i][k]<<"";cout<<endl;break;}}voidaverage<inta[][4],introw,intcol>{doublesum=0;for<inti=0;i<row;i++>for<intj=0;j<col;j++>sum+=a[i][j];cout<<"所有課程平均分?jǐn)?shù)為:"<<sum/row/col<<endl;}7.7#include<iostream.h>inta[3][3]={{5,7,8},{2,-2,4},{1,1,1}};intb[3][3]={{4,-2,3},{3,9,4},{8,-1,2}};intc[3][3];voidmain<>{for<inti=0;i<3;i++>{for<intj=0;j<3;j++>{c[i][j]=a[i][j]+b[i][j];cout<<c[i][j]<<"";}cout<<endl;}}八8.1#include<iostream.h>int*findmax<int*array,intsize,int*index>;voidmain<>{inta[10]={33,91,54,67,82,37,85,63,19,68};int*maxaddr;intidx;maxaddr=findmax<a,sizeof<a>/sizeof<*a>,&idx>;cout<<"theindexofmaximumelementis"<<idx<<endl<<"theaddressofitis"<<maxaddr<<endl<<"thevalueofitis"<<a[idx]<<endl;}int*findmax<int*array,intsize,int*index>{*index=0;for<inti=0;i<size;i++>if<array[i]>array[*index]>*index=i;return&array[*index];}8.2#include<iostream.h>boolassign<>;intnum,interval;voidmain<>{if<!assign<>>return;int*a=newint[num];for<inti=0;i<num;i++>cout<<<a[i]=i+1><<",";cout<<endl;inti=<interval-1>%num;for<intk=1;k<num;k++>{cout<<a[i]<<",";a[i]=0;for<intj=1;!<a[i]&&<j++==interval>>;i=<i+1>%num>;//數(shù)數(shù)}cout<<"\nNo."<<a[i]<<"boyhaswon.\n";//輸出勝利者delete[]a;}boolassign<>{while<1>{cout<<"pleaseinputthenumberofboys,theinterval:\n";cin>>num>>interval;if<num>1&&interval>1&&interval<num>returntrue;boolsign=true;while<sign>{cout<<"erroronyourinputdata.\n";cout<<"pleaseselectfollowingoperation:\n";cout<<"\t\tstopatonce!-----1\n";cout<<"\t\tinputagain.-------2\n";cout<<"\t\tasdefaultvalues--3\n\n";intsele=0;cin>>sele;switch<sele>{case1:returnfalse;case2:sign=false;break;case3:num=10;interval=3;returntrue;}//endofswitch}//endofinnerwhile}//endofoutwhile}8.3#include<iostream.h>#include<stdlib.h>intCompIntBitSum<constvoid*a,constvoid*b>;intCompFloat<constvoid*a,constvoid*b>;intCompStrLen<constvoid*a,constvoid*b>;voidmain<>{inta[]={12,32,42,51,8,16,21,19,9};intanum=sizeof<a>/sizeof<*a>;cout<<"\n排序前:\n";for<inti=0;i<anum;i++>cout<<a[i]<<"";cout<<endl;qsort<a,anum,sizeof<*a>,CompIntBitSum>;cout<<"排序后:\n";for<inti=0;i<anum;i++>cout<<a[i]<<"";cout<<endl;floatf[]={32.1,456.87,332.67,442.0,98.12,451.79,340.12,54.55,99.87,72.5};intfnum=sizeof<f>/sizeof<*f>;cout<<"\n排序前:\n";for<inti=0;i<fnum;i++>cout<<f[i]<<"";cout<<endl;qsort<f,fnum,sizeof<*f>,CompFloat>;cout<<"排序后:\n";for<inti=0;i<fnum;i++>cout<<f[i]<<""; cout<<endl;char*str[]={"enter","number","size","begin","of","cat","case","program","certain","a"};intstrnum=sizeof<str>/sizeof<*str>;cout<<"\n排序前:\n";for<inti=0;i<strnum;i++>cout<<str[i]<<"";cout<<endl;qsort<str,strnum,sizeof<*str>,CompStrLen>;cout<<"排序后:\n";for<inti=0;i<strnum;i++>cout<<str[i]<<"";cout<<endl;}intCompIntBitSum<constvoid*a,constvoid*b>{intia=*<int*>a,ib=*<int*>b;intsuma=0,sumb=0;while<ia>{suma+=ia%10;ia/=10;}while<ib>{sumb+=ib%10;ib/=10;}returnsuma-sumb;}intCompFloat<constvoid*a,constvoid*b>{return*<float*>a-*<float*>b;}intCompStrLen<constvoid*a,constvoid*b>{ if<strlen<*<char**>a>==strlen<*<char**>b>> returnstrcmp<*<char**>a,*<char**>b>; returnstrlen<*<char**>a>-strlen<*<char**>b>;}8.4//theresultof3and2isnot8//<t>116+4,<h>104+9,<e>101+6,<>32+2,<r>114+8,<e>101+7,<s>115+3,//<u>117+4,<l>108+9,<t>116+6,<>32+2,<o>111+8,<f>102+7,<>32+3,//<3>51+4,<>32+9,<a>97+6,<n>110+2,<d>100+8,<>32+7,<2>50+3,//<>32+4,<i>105+9,<s>115+6,<>32+2,<n>110+8,<o>111+7,<t>116+3,//<>32+4,<8>56+9//得到密文為://xqk″zlvyuzqn′6$jtf<9#m!&pw##include<iostream.h>char*jiami<constchar*str>;char*jiemi<constchar*str>;constcharkey[]={4,9,6,2,8,7,3};constkeylen=sizeof<key>;voidmain<>{char*s="theresultof3and2isnot8";cout<<"\n原文為:\n"<<s<<endl;char*result1=jiami<s>;cout<<"\n密文為:\n"<<result1<<endl;char*result2=jiemi<result1>;cout<<"\n解密之后為:\n"<<result2<<endl;delete[]result1;delete[]result2;}char*jiami<constchar*str>{intlen=strlen<str>;char*result=newchar[len+1];for<inti=0,j=0;i<len;i++,j=<j+1>%keylen>{result[i]=str[i]+key[j];if<result[i]>122>result[i]-=90;}returnresult;}char*jiemi<constchar*str>{intlen=strlen<str>;char*result=newchar[len+1];for<inti=0,j=0;i<len;i++,j=<j+1>%keylen>{result[i]=str[i]-key[j];if<result[i]<32> result[i]+=90;}returnresult;}8.5intstrcmp<constchar*str1,constchar*str2>{char*p1=<char*>str1;char*p2=<char*>str2;while<*p1&&*p1==*p2>{p1++;p2++;}return*p1-*p2;}8.6char*strcpy<char*dest,constchar*src>{char*pdest=dest;char*psrc=<char*>src;while<*pdest++=*psrc++>;returndest;}8.7#include<iostream.h>intstrcmp<constchar*str1,constchar*str2>;voidmain<intargc,char*argv[]>{if<argc!=3>{cout<<"usage:c:>8_7string1string2\n";return;} intresult=strcmp<argv[1],argv[2]>;charc='=';if<result>0>c='>';if<result<0>c='<';cout<<argv[1]<<c<<argv[2]<<endl;}intstrcmp<constchar*str1,constchar*str2>{char*p1=<char*>str1;char*p2=<char*>str2;while<*p1&&*p1==*p2>{p1++;p2++;}return*p1-*p2;}8.8#include<iostream.h>#include<iomanip.h>#include<stdlib.h>voidtranspose<int*a,intsize>;//降維處理voidmain<>{intA[5][5];randomize<>;for<inti=0;i<5;i++>{for<intj=0;j<5;j++>cout<<setw<7><<<A[i][j]=rand<>>;cout<<endl;}transpose<<int*>A,5>;cout<<"\n轉(zhuǎn)置之后:\n";for<inti=0;i<5;i++>{for<intj=0;j<5;j++>cout<<setw<7><<A[i][j];cout<<endl;}}voidtranspose<int*a,intsize>{for<inti=1;i<size;i++>for<intj=0;j<i;j++>{inttemp=a[i*size+j];a[i*size+j]=a[j*size+i];a[j*size+i]=temp;}}8.9#include<iostream.h>#include<alloc.h>voidmain<>{void*p=malloc<1000000>;inti=1;while<p>{p=malloc<1000000>;i++;}cout<<"堆容量為<M>:"<<i<<endl;}99_1<1>#include<iostream.h>constsize=10;voidfindmax<int*a,intn,inti,int&pk>;voidmain<>{inta[size];intn=0;cout<<"pleaseinput"<<size<<"datas:\n";for<inti=0;i<size;i++>cin>>a[i];findmax<a,size,0,n>;cout<<"themaximumis"<<a[n]<<endl<<"It'sindexis"<<n<<endl;} voidfindmax<int*a,intn,inti,int&pk>{if<i<n>{if<a[i]>a[pk]>pk=i;findmax<a,n,i+1,&pk>;}}<2>//求數(shù)組中最大元素的下標(biāo),放入主函數(shù)的變量n中.<3>#include<iostream.h>constsize=10;voidfindmax<int*a,intn,int&pk>;voidmain<>{inta[size];intn=0;cout<<"pleaseinput"<<size<<"datas:\n";for<inti=0;i<size;i++>cin>>a[i];findmax<a,size,n>;cout<<"themaximumis"<<a[n]<<endl<<"It'sindexis"<<n<<endl;} voidfindmax<int*a,intn,int&pk>{for<inti=1;i<n;i++>if<a[i]>a[pk]>pk=i;}9_2#include<iostream.h>#include<stdlib.h> int&put<intn>;//putvalueintothearrayintget<intn>;//obtainavaluefromthearray intvals[10];interror=-1;voidmain<>{put<0>=10;//putvaluesintothearray put<1>=20;//...put<9>=30;cout<<get<0><<endl;cout<<get<1><<endl;//... cout<<get<9><<endl;put<12>=1;//outofrange//...}int&put<intn>{if<n>=10>{cerr<<"rangeerrorinputvalue!\n";exit<1>;}returnvals[n];}intget<intn>{if<n>=10>{cerr<<"rangeerroringetvalue!\n";exit<1>;}returnvals[n];}9.3#include<iostream.h>voidSwap<char*&str1,char*&str2>;voidmain<>{char*ap="hello";char*bp="howareyou?";cout<<ap<<endl<<bp<<endl;Swap<ap,bp>;cout<<"交換以后:\n";cout<<ap<<endl<<bp<<endl;}voidSwap<char*&str1,char*&str2>{char*temp=str1;str1=str2;str2=temp;}一○10.1#include<iostream.h>structStudent{intmathmidterm;intmathfinal;};voidmain<>{Students;cout<<"pleaseinputmidtermandfinalmath\n"<<"gradeofastudent:\n";cin>>s.mathmidterm>>s.mathfinal;cout<<"theaveragegradeofmidtermandfinalmathis"<<<s.mathmidterm+s.mathfinal>/2.0<<endl;}10_2#include<iostream.h>#include<string.h>structNode{charstr[20];Node*next;};voidInsert<Node*&head>;voidmain<>{Node*p;Node*x=newNode;strncpy<x->str,"hello",20>;x->next=NULL;p=x;x=newNode;strncpy<x->str,"jone",20>;x->next=p;p=x;x=newNode;strncpy<x->str,"good",20>;x->next=p;p=x; x=newNode;strncpy<x->str,"better",20>;x->next=p;p=x;cout<<"\n插入之前:\n";for<Node*pT=p;pT;pT=pT->next>cout<<pT->str<<"->";cout<<"0\n";Insert<p>;cout<<"\n插入之后:\n";for<Node*pT=p;pT;pT=pT->next>cout<<pT->str<<"->";cout<<"0\n";}voidInsert<Node*&head>{Node*p=newNode;strncpy<p->str,"marit",20>;head->str[19]='\0';if<!head>{head=p;p->next=NULL;return;}if<!strcmp<head->str,"jone">>{p->next=head;head=p;return;}Node*sp;for<sp=head;sp->next&&strcmp<sp->next->str,"jone">;sp=sp->next>;p->next=sp->next;sp->next=p;}10_3#include<iostream.h>structNode{charc;Node*next;};Node*reverse<Node*head>;voidmain<>{Nodex[4];for<inti=0;i<4;i++>{x[i].c='A'+i;cout<<x[i].c<<"->";x[i].next=&x[i+1];}cout<<"NULL"<<endl;x[3].next=NULL;Node*head=reverse<x>;for<Node*pH=head;pH;pH=pH->next>cout<<pH->c<<"->";cout<<"NULL"<<endl;}Node*reverse<Node*head>{Node*newHead=NULL;for<Node*pT=head;pT;pT=head>{head=head->next;pT->next=newHead;newHead=pT;}returnnewHead;}10_4<1>#include<iostream.h>structLnode{doubledata;Lnode*next;};voidShowList<Lnode*head>{for<Lnode*p=head;p;p=p->next>cout<<p->data<<endl;}voidAddToE
溫馨提示
- 1. 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
- 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
- 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
- 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
- 5. 人人文庫網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
- 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
- 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。
最新文檔
- 建筑垃圾及其它廢棄物回收利用項(xiàng)目可行性研究報(bào)告建議書
- 如何設(shè)計(jì)青石雕項(xiàng)目可行性研究報(bào)告投資方案2025標(biāo)準(zhǔn)案例范文
- 2025-2030年中國電暖鍋行業(yè)深度研究分析報(bào)告
- 2025-2030年中國微電腦球拍拉線機(jī)行業(yè)深度研究分析報(bào)告
- 金屬邊角料項(xiàng)目可行性研究報(bào)告(參考模板范文)
- 2025年中國生物組織石蠟切片機(jī)行業(yè)市場(chǎng)規(guī)模及未來投資方向研究報(bào)告
- 外包勞務(wù)合同模板8篇
- 蒸壓粉煤灰磚購銷合同10篇
- 酒店員工雇傭合同書8篇
- 轉(zhuǎn)讓二手房合同范本6篇
- 采油工程 試題及答案
- 西醫(yī)臨床基因組學(xué)應(yīng)用試題及答案
- 橋梁工程施工檢驗(yàn)測(cè)試計(jì)劃
- 內(nèi)河船客運(yùn)培訓(xùn)課件
- 淘寶商家押金協(xié)議書
- 2023-2029年中國雞尾酒行業(yè)市場(chǎng)運(yùn)行態(tài)勢(shì)及投資戰(zhàn)略規(guī)劃報(bào)告
- 血液檢驗(yàn) 3.2017-正常骨髓細(xì)胞形態(tài)學(xué)-陳學(xué)東-20170515173650 學(xué)習(xí)資料
- 2024年記者證考試挑戰(zhàn)試題及答案
- 2025年生豬屠宰獸醫(yī)衛(wèi)生檢疫人員考試題(附答案)
- 貴州省赫章縣野馬川鎮(zhèn)初級(jí)中學(xué)-紅色精神張桂梅【課件】
- 2025年刑法模擬檢測(cè)試卷(罪名認(rèn)定與刑罰適用)
評(píng)論
0/150
提交評(píng)論