




下載本文檔
版權(quán)說(shuō)明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)
文檔簡(jiǎn)介
1、3.2 題#include <iostream>#include <iomanip>using namespace std;int main ( )float h,r,l,s,sq,vq,vz;const float pi=3.1415926;cout<<"please enter r,h:"cin>>r>>h;l=2*pi*r;s=r*r*pi;sq=4*pi*r*r;vq=3.0/4.0*pi*r*r*r;vz=pi*r*r*h;cout<<setiosflags(ios:fixed)<<
2、;setiosflags(ios:right)<<setprecision(2);cout<<"l= "<<setw(10)<<l<<endl;cout<<"s= "<<setw(10)<<s<<endl;cout<<"sq="<<setw(10)<<sq<<endl;cout<<"vq="<<setw(10)<<vq<
3、<endl;cout<<"vz="<<setw(10)<<vz<<endl;return 0;3.3 題#include <iostream>using namespace std;int main ()float c,f;cout<<" 請(qǐng)輸入一個(gè)華氏溫度:"cin>>f;c=(5.0/9.0)*(f-32);/注意 5 和 9 要用實(shí)型表示,否則 5/9 值為 0cout<<" 攝氏溫度為 :"<<c<<e
4、ndl;return 0;3.4 題#include <iostream>using namespace std;int main ( )char c1,c2;cout<<" 請(qǐng)輸入兩個(gè)字符c1,c2:"c1=getchar();/ 將輸入的第一個(gè)字符賦給c1c2=getchar();/ 將輸入的第二個(gè)字符賦給c2cout<<" 用 putchar 函數(shù)輸出結(jié)果為:"putchar(cl);putchar(c2);cout<<endl;cout<<"用cout語(yǔ)句輸出結(jié)果為:"
5、;;cout<<c1<<c2<<endl;return 0;3.4 題另一解#include <iostream>using namespace std;int main ()char c1,c2;cout<<"請(qǐng)輸入兩個(gè)字符 c1,c2:"c1=getchar();將輸入的第一個(gè)字符賦給c1c2=getchar();將輸入的第二個(gè)字符賦給c2cout<<"用putchar函數(shù)輸出結(jié)果為:";putchar(c1);putchar(44);putchar(c2);cout<&l
6、t;endl;cout<<"用cout語(yǔ)句輸出結(jié)果為:";cout<<c1<<","<<c2<<endl;return 0;3.5 題#include <iostream>using namespace std;int main ()char c1,c2;int i1,i2;/定義為整型cout<<"請(qǐng)輸入兩個(gè)整數(shù)i1,i2:"cin>>i1>>i2;c1=i1;c2=i2;cout<<"按字符輸出結(jié)果為:
7、"<<c1<<" , "<<c2<<endl;return 0;3.8 題#include <iostream>using namespace std;int main () int a=3,b=4,c=5,x,y;cout<<(a+b>c && b=c)<<endl;cout<<(a|b+c && b-c)<<endl;cout<<(!(a>b) && !c|1)<<end
8、l;cout<<(!(x=a) && (y=b) && 0)<<endl;cout<<(!(a+b)+c-1 && b+c/2)<<endl;return 0;3.9 題include <iostream>using namespace std;int main ( )int a,b,c;cout<<"please enter three integer numbers:"cin>>a>>b>>c;if(a<b)i
9、f(b<c)cout<<"max="<<c;elsecout<<"max="<<b;else if (a<c)cout<<"max="<<c;elsecout<<"max="<<a;cout<<endl;return 0;3.10 另一解#include <iostream>using namespace std;int main ( )int a,b,c,temp,max ;cout
10、<<"please enter three integer numbers:"cin>>a>>b>>c;temp=(a>b)?a:b;/* 將a和b中的大者存入 temp中*/max=(temp>c)?temp:c;/* 將a和b中的大者與 c比較,最大者存入 max*/cout<<"max="<<max<<endl;return 0;3.11 題#include <iostream>using namespace std;int main ( )
11、int x,y;cout<<"enter x:"cin>>x;if (x<1)y=x;cout<<"x="<<x<<", y=x="<<y;)else if (x<10)/ 1 <x< 10y=2*x-1;cout<<"x="<<x<<", y=2*x-1="<<y;)else/ x > 10y=3*x-11;cout<<"x
12、="<<x<<", y=3*x-11="<<y;)cout<<endl;return 0;)3.12 題#include <iostream>using namespace std;int main ()float score;char grade;cout<<"please enter score of student:"cin>>score;while (score>100|score<0)cout<<"data error
13、,enter data again."cin>>score;)switch(int(score/10)case 10:case 9: grade='A'break;case 8: grade='B'break;case 7: grade='C'break;case 6: grade='D'break;default:grade='E')cout<<"score is "<<score<<", grade is "<
14、;<grade<<endl;return 0;)3.12 題#include <iostream>using namespace std;int main ()long int num;int indiv,ten,hundred,thousand,ten_thousand,place;/*分別代表個(gè)位,十位,百位,千位方位和位數(shù)7cout«"enter an integer(099999):"cin»num;if (num>9999)place=5;else if (num>999)place=4;else if
15、 (num>99)place=3;else if (num>9)place=2;else place=1;cout«"place="«place«endl;計(jì)算各位數(shù)字ten_thousand=num/10000;thousand=(int)(num-ten_thousand*10000)/1000;hundred=(int)(num-ten_thousand*10000-thousand*1000)/100;ten=(int)(num-ten_thousand*10000-thousand*1000-hundred*100)/10
16、;indiv=(int)(num-ten_thousand*10000-thousand*1000-hundred*100-ten*10);cout«"original order:"switch(place)case5:cout«ten_thousand«","<<thousand«","«hundred«","«ten«","<<indiv«endl;cout«&quo
17、t;reverse order:"cout«indiv«ten«hundred«thousand«ten_thousand«endl;break;case 4:cout«thousand«","«hundrecl«","«ten«","«incliv«encll;cout«"reverse order:"cout«indiv«ten
18、71;hundred«thousand«endl;break;case 3:cout«hundred«","«ten«","«indiv«endl;cout«"reverse order:"cout«indiv«ten«hundred«endl;break;case 2:cout«ten«","«indiv«encll;cout«&quo
19、t;reverse order:"cout«indiv<<ten«endl;break;case 1:cout«indiv«endl;cout«"reverse order:"cout<<indiv<<endl;break;return 0;3.13 題#include <iostream> using namespace std;int main () long i;/i 為利潤(rùn)float bonus,bon1,bon2,bon4,bon6,bon10;/利潤(rùn)為10
20、 萬(wàn)元時(shí)的獎(jiǎng)金/ 利潤(rùn)為20 萬(wàn)元時(shí)的獎(jiǎng)金/ 利潤(rùn)為40 萬(wàn)元時(shí)的獎(jiǎng)金/ 利潤(rùn)為60 萬(wàn)元時(shí)的獎(jiǎng)金/ 利潤(rùn)為 100 萬(wàn)元時(shí)的獎(jiǎng)金bon1=100000*0.1;bon2=bon1+100000*0.075;bon4=bon2+100000*0.05;bon6=bon4+100000*0.03;bon10=bon6+400000*0.015;cout<<"enter i:"cin>>i;if (i<=100000)bonus=i*0.1;else if (i<=200000)bonus=bon1+(i-100000)*0.075;else
21、 if (i<=400000)bonus=bon2+(i-200000)*0.05;else if (i<=600000)bonus=bon4+(i-400000)*0.03;else if (i<=1000000)bonus=bon6+(i-600000)*0.015;elsebonus=bon10+(i-1000000)*0.01;cout<<"bonus="<<bonus<<endl;return 0;3.13 題另一解/利潤(rùn)在 10 萬(wàn)元以內(nèi)按10%提成獎(jiǎng)金/利潤(rùn)在10萬(wàn)元至20萬(wàn)時(shí)的獎(jiǎng)金/利潤(rùn)在20萬(wàn)元至40萬(wàn)
22、時(shí)的獎(jiǎng)金/利潤(rùn)在40萬(wàn)元至60萬(wàn)時(shí)的獎(jiǎng)金/利潤(rùn)在60萬(wàn)元至100萬(wàn)時(shí)的獎(jiǎng)金/ 利潤(rùn)在 100 萬(wàn)元以上時(shí)的獎(jiǎng)金#include <iostream>using namespace std;int main ()long i;float bonus,bon1,bon2,bon4,bon6,bon10;int c;bon1=100000*0.1;bon2=bon1+100000*0.075;bon4=bon2+200000*0.05;bon6=bon4+200000*0.03;bon10=bon6+400000*0.015;cout«"enter i:"c
23、in»i;c=i/100000;if (c>10) c=10;switch (c)case 0: bonus=i*0.1; break;case 1: bonus=bon1+(i-100000)*0.075; break;case 2:case 3: bonus=bon2+(i-200000)*0.05;break;case 4:case 5: bonus=bon4+(i-400000)*0.03;break;case 6:case 7:case 8:case 9: bonus=bon6+(i-600000)*0.015; break;case 10: bonus=bon 10
24、+(i-1000000)*0.01;)cout«"bonus="«bonus«endl;return 0;)3.14 題#include <iostream>using namespace std;int main ()int t,a,b,c,d;cout«"enter four numbers:"cin»a»b»c»d;cout«"a="«a<<", b="«b«&quo
25、t;, c="«c«",d="«d«endl;if (a>b)t=a;a=b;b=t;if (a>c)t=a; a=c; c=t;if (a>d)t=a; a=d; d=t;if (b>c)t=b; b=c; c=t;if (b>d)t=b; b=d; d=t;if (c>d)t=c; c=d; d=t;cout«"the sorted sequence:"«endl;cout«a«", "«b
26、71;", "«c«", "«d«endl;return 0;)3.15 題#include <iostream>using namespace std;int main ()int p,r,n,m,temp;cout<<"please enter two positive integer numbers n,m:"cin>>n>>m;if (n<m) temp=n;n=m;m=temp;把大數(shù)放在n中,小數(shù)放在m中)p=n*m;/先將n和m
27、的乘積保存在p中,以便求最小公倍數(shù)時(shí)用while (m!=0)求n和m的最大公約數(shù)r=n%m; n=m; m=r; ) cout<<"HCF="<<n<<endl;cout<<"LCD="<<p/n<<endl;/ p是原來(lái)兩個(gè)整數(shù)的乘積return 0; )3.16 題#include <iostream>using namespace std;int main ()char c;int letters=0,space=0,digit=0,other=0;cout<
28、;<"enter one line:"<<endl;while(c=getchar()!='n')if (c>='a' && c<='z'|c>='A' && c<='Z') letters+;else if (c=' ') space+;else if (c>='0' && c<='9') digit+;elseother+;)cout<&
29、lt;"letter:"<<letters<<", space:"<<space<<", digit:"<<digit<<", other:"<<other<<endl;return 0;)3.17 題#include <iostream>using namespace std;int main ()int a,n,i=1,sn=0,tn=0;cout<<"a,n=:"cin&
30、gt;>a>>n;while (i<=n)tn=tn+a;賦值后的tn為i個(gè)a組成數(shù)的值sn=sn+tn;賦值后的sn為多項(xiàng)式前i項(xiàng)之和a=a*10;+i;)cout<<"a+aa+aaa+.="<<sn<<endl;return 0;)3.18 題#include <iostream>using namespace std;int main ()float s=0,t=1;int n;for (n=1;n<=20;n+)t=t*n;求 n!s=s+t;/將各項(xiàng)累加)cout<<&qu
31、ot;1!+2!+.+20!="<<s<<endl;return 0;)3.19 題#include <iostream>using namespace std;int main ()int i,j,k,n;cout<<"narcissus numbers are:"<<endl;for (n=100;n<1000;n+)i=n/100;j=n/10-i*10;if (n = i*i*i + j*j*j + k*k*k)cout<<n<<"cout<<e
32、ndl;return 0;3.20 題#include <iostream>using namespace std;int main()const int m=1000;/ 定義尋找范圍int k1,k2,k3,k4,k5,k6,k7,k8,k9,k10;int i,a,n,s;for (a=2;a<=m;a+)/ a 是 21000之間的整數(shù),檢查它是否為完數(shù)檢查它是否為完數(shù)n=0;s=a;for (i=1;i<a;i+)/if (a%i=0)n+;s=s-i;之和switch(n)case 1:k1=i; break;/ n 用來(lái)累計(jì)a 的因子的個(gè)數(shù)/ s 用來(lái)存放
33、尚未求出的因子之和,開(kāi)始時(shí)等于a檢查i 是否為a 的因子/ 如果 i 是 a 的因子/ n 加 1 ,表示新找到一個(gè)因子/ s 減去已找到的因子, s 的新值是尚未求出的因子/ 將找到的因子賦給k1,.,k10/ 找出的笫1 個(gè)因子賦給k1case 2:k2=i;break;/ 找出的笫2 個(gè)因子賦給k2case 3:k3=i;break;/ 找出的笫3 個(gè)因子賦給k3case 4:k4=i;break;/ 找出的笫4 個(gè)因子賦給k4case 5:k5=i;break;/ 找出的笫5 個(gè)因子賦給k5case 6:k6=i;break;/ 找出的笫6 個(gè)因子賦給k6case 7:k7=i;bre
34、ak;/ 找出的笫7 個(gè)因子賦給k7case 8:k8=i;break;/ 找出的笫8 個(gè)因子賦給k8case 9:k9=i;break;/ 找出的笫9 個(gè)因子賦給k9case 10:k10=i;break;/ 找出的笫10 個(gè)因子賦給k10if (s=0)/ s=0表示全部因子都已找到了cout«a«" is a 完數(shù)"«endl;cout«"its factors are:"if (n>1)cout«k1«","«k2;/ n>1表示a至少有2個(gè)因子
35、if (n>2)cout«","«k3; / n>2表示至少有3個(gè)因子,故應(yīng)再輸出一個(gè)因子if (n>3)cout«","«k4; / n>3表示至少有4個(gè)因子,故應(yīng)再輸出一個(gè)因子if (n>4) cout«","«k5;if (n>5) cout«","«k6;if (n>6) cout«","«k7;if (n>7) cout«&quo
36、t;,"«k8;if (n>8) cout«","«k9;if (n>9) cout«","«k10;cout«endl«endl;/以下類似)return 0;)using namespace std;int main()3.20 題另一解#include <iostream>int m,s,i;for (m=2;m<1000;m+)s=0;for (i=1;i<m;i+)if (m%i)=0) s=s+i;if(s=m)cout
37、1;m«" is a 完數(shù)"«endl; cout«"its factors are:"for (i=1 ;i<m;i+)if (m%i=0) cout«i«" cout«endl;)return 0;)3.20 題另一解#include <iostream>using namespace std;int main()int k11;int i,a,n,s;for (a=2;a<=1000;a+)n=0;s=a;for (i=1;i<a;i+) if (a
38、%i)=0)n+;s=s-i;kn=i;/將找到的因子賦給 k1-k10)if (s=0)cout«a«" is a 完數(shù)"«endl;cout«"its factors are:"for (i=1;i<n;i+)cout«ki«"cout«kn«endl;)return 0;)3.21 題#include <iostream>using namespace std;int main()int i,t,n=20;double a=2,b=1,s=0
39、;for (i=1;i<=n;i+)s=s+a/b;t=a;a=a+b;/將前一項(xiàng)分子與分母之和作為下一項(xiàng)的分子b=t;/將前一項(xiàng)的分子作為下一項(xiàng)的分母)cout«"sum="«s«endl;return 0;)3.22 題#include <iostream>using namespace std;int main()int day,x1,x2;day=9;x2=1;while(day>0)x1=(x2+1)*2;第1天的桃子數(shù)是第2天桃子數(shù)加1后的2倍x2=x1;day-;cout<<"tota
40、l="<<x1<<endl;return 0;3.23 題#include <iostream>#include <cmath>using namespace std;int main()float a,x0,x1;cout<<"enter a positive number:"cin>>a;/ 輸入 a 的值x0=a/2;x1=(x0+a/x0)/2;dox0=x1;x1=(x0+a/x0)/2;while(fabs(x0-x1)>=1e-5);cout<<"Th
41、e square root of "<<a<<" is "<<x1<<endl;return 0;3.24 題#include <iostream>using namespace std;int main()int i,k;/ 輸出上面 4 行*號(hào)/ 輸出 * 號(hào)/輸出完一行 *號(hào)后換行/ 輸出下面 3 行 *號(hào)/ 輸出 * 號(hào)/ 輸出完一行*號(hào)后換行for (i=0;i<=3;i+)for (k=0;k<=2*i;k+) cout<<"*"cout<&l
42、t;endl;for (i=0;i<=2;i+)for (k=0;k<=4-2*i;k+) cout<<"*"cout<<endl;return 0;#include <iostream>using namespace std;int main()char i,j,k;/* i是a的對(duì)手;j是b的對(duì)手;k是c的對(duì)手*/for (i="X"i<="Z'i+)for (j="X"j<="Z'j+)if (i!=j)for (k="X&
43、quot;k<="Z'k+)if (i!=k && j!=k)if (i!='X' && k!='X' && k!='Z') cout<<"A-"<<i<<"B-"<<j<<"C-"<<k<<endl;return 0;4.1 題#include <iostream>using namespace std;int main
44、()int hcf(int,int);int lcd(int,int,int);int u,v,h,l;cin>>u>>v;h=hcf(u,v);cout<<"H.C.F="<<h<<endl;l=lcd(u,v,h);cout<<"L.C.D="<<l<<endl;return 0;int hcf(int u,int v)int t,r;if (v>u)t=u;u=v;v=t;while (r=u%v)!=0)u=v;v=r; return(v);in
45、t lcd(int u,int v,int h) return(u*v/h);4.2 題#include <iostream>#include <math.h>using namespace std;float x1,x2,disc,p,q;int main()void greater_than_zero(float,float);void equal_to_zero(float,float);void smaller_than_zero(float,float);float a,b,c;cout<<"input a,b,c:"cin&g
46、t;>a>>b>>c;disc=b*b-4*a*c;cout<<"root:"<<endl;if (disc>0)greater_than_zero(a,b);cout<<"x1="<<x1<<",x2="<<x2<<endl;else if (disc=0)equal_to_zero(a,b);cout<<"x1="<<x1<<",x2="
47、<<x2<<endl;elsesmaller_than_zero(a,b);cout<<"x1="<<p<<"+"<<q<<"i"<<endl;cout<<"x2="<<p<<"-"<<q<<"i"<<endl;return 0;disc>0 時(shí)方disc=0 時(shí)方程void greater_than_z
48、ero(float a,float b) /* 定義一個(gè)函數(shù),用來(lái)求程的根 */x1=(-b+sqrt(disc)/(2*a);x2=(-b-sqrt(disc)/(2*a);void equal_to_zero(float a,float b) /* 定義一個(gè)函數(shù),用來(lái)求的根 */x1=x2=(-b)/(2*a);void smaller_than_zero(float a,float b) /* 定義一個(gè)函數(shù),用來(lái)求disc<0 時(shí)方程的根*/(p=-b/(2*a);q=sqrt(-disc)/(2*a);)4.3 題#include <iostream>using na
49、mespace std;int main()int prime(int);/* 函數(shù)原型聲明*/int n;cout<<"input an integer:"cin>>n;if (prime(n)cout<<n<<" is a prime."<<endl;elsecout<<n<<" is not a prime."<<endl;return 0;)int prime(int n)int flag=1,i;for (i=2;i<n/2
50、 && flag=1;i+)if (n%i=0)flag=0;return(flag);)4.4 題#include <iostream>using namespace std;int main()int fac(int);int a,b,c,sum=0;cout<<"enter a,b,c:"cin>>a>>b>>c;sum=sum+fac(a)+fac(b)+fac(c);cout<<a<<"!+"<<b<<"!+&q
51、uot;<<c<<"!="<<sum<<endl;return 0;)int fac(int n)int f=1;for (int i=1;i<=n;i+)f=f*i;return f;4.5 題#include <iostream>#include <cmath>using namespace std;int main()double e(double);double x,sinh;cout<<"enter x:"cin>>x;sinh=(e(x)+e
52、(-x)/2;cout<<"sinh("<<x<<")="<<sinh<<endl;return 0;double e(double x)return exp(x);4.6 題#include <iostream>#include <cmath>using namespace std;int main()double solut(double ,double ,double ,double );double a,b,c,d;cout<<"input
53、a,b,c,d:"cin>>a>>b>>c>>d;cout<<"x="<<solut(a,b,c,d)<<endl;return 0;double solut(double a,double b,double c,double d) double x=1,x0,f,f1;dox0=x;f=(a*x0+b)*x0+c)*x0+d;f1=(3*a*x0+2*b)*x0+c;x=x0-f/f1;while(fabs(x-x0)>=1e-5);return(x);4.7 題#incl
54、ude <iostream>#include <cmath>using namespace std;int main()void godbaha(int);int n;cout<<"input n:"cin>>n;godbaha(n);return 0;void godbaha(int n)int prime(int);int a,b;for(a=3;a<=n/2;a=a+2)if(prime(a)b=n-a;if (prime(b)cout<<n<<"="<<a&
55、lt;<"+"<<b<<endl;int prime(int m)int i,k=sqrt(m);for(i=2;i<=k;i+)if(m%i=0) break;if (i>k) return 1;else return 0;4.8 題#include <iostream>using namespace std;int main()int x,n;float p(int,int);cout<<"input n & x:"cin>>n>>x;cout<&
56、lt;"n="<<n<<",x="<<x<<endl;cout<<"P"<<n<<"(x)="<<p(n,x)<<endl;return 0;float p(int n,int x)if (n=0)return(1);else if (n=1)return(x);elsereturn(2*n-1)*x*p(n-1),x)-(n-1)*p(n-2),x)/n);4.9 題#include <iostrea
57、m>using namespace std;int main()void hanoi(int n,char one,char two,char three);int m;cout<<"input the number of diskes:"cin>>m;cout<<"The steps of moving "<<m<<" disks:"<<endl;hanoi(m,'A','B','C');return 0;v
58、oid hanoi(int n,char one,char two,char three)將n個(gè)盤(pán)從one座借助two座,移到three座void move(char x,char y);if(n=1) move(one,three);elsehanoi(n-1,one,three,two);move(one,three);hanoi(n-1,two,one,three);void move(char x,char y)cout<<x<<"->"<<y<<endl;4.10 題#include <iostream&
59、gt;using namespace std;void convert(int n);int number;cout<<"input an integer:"cin>>number;cout<<"output:"<<endl;if (number<0)cout<<"-"number=-number;convert(number);cout<<endl;return 0;void convert(int n)int i;char c;if (i=n/10)!=
60、0)convert(i);c=n%10+'0'cout<<" "<<c;4.11 題#include <iostream>using namespace std;int main()int f(int);int n,s;cout<<"input the number n:"cin>>n;s=f(n);cout<<"The result is "<<s<<endl;return 0;int f(int n);if (n=1)r
61、eturn 1;elsereturn (n*n+f(n-1);4.12 題#include <iostream>#include <cmath>using namespace std;#define S(a,b,c) (a+b+c)/2#define AREA(a,b,c) sqrt(S(a,b,c)*(S(a,b,c)-a)*(S(a,b,c)-b)*(S(a,b,c)-c) int main()float a,b,c;cout<<"input a,b,c:"cin>>a>>b>>c;if (a+b&
62、gt;c && a+c>b && b+c>a)cout<<"area="<<AREA(a,b,c)<<endl;elsecout<<"It is not a triangle!"<<endl;return 0;4.14 題#include <iostream>using namespace std;/#define LETTER 1int main()char c;cin>>c;#if LETTERif(c>='a
63、' && c<='z')c=c-32;#elseif(c>='A' && c<='Z')c=c+32;#endifcout<<c<<endl;return 0;4.15 題#include <iostream>using namespace std;#define CHANGE 1int main()char ch40;cout<<"input text:"<<endl;gets(ch);#if (CHANGE
64、)for (int i=0;i<40;i+)if (chi!='0')if (chi>='a'&& chi<'z'|chi>'A'&& chi<'Z') chi+=1;else if (chi='z'|chi='Z') chi卜=25;#endifcout<<"output:"<<endl<<ch<<endl;return 0;4.16 題 file#in
65、clude <iostream>using namespace std;int a;int main()extern int power(int);int b=3,c,d,m;cout<<"enter an integer a and its power m:"<<endl;cin>>a>>m;c=a*b;cout<<a<<"*"<<b<<"="<<c<<endl;d=power(m);cout<&
66、lt;a<<"*"<<m<<"="<<d<<endl;return 0;4.17 題 fileextern int a;int power(int n)int i,y=1;for(i=1;i<=n;i+)y*=a;return y;5.1 題#include <iostream>#include <iomanip>using namespace std;#include <math.h>int main()int i,j,n,a101;for (i=1;
67、i<=100;i+)ai=i;a1=0;for (i=2;i<sqrt(100);i+)for 0=i+1 ;j<=1OO;j+)if(ai!=0 && aj!=0)if (aj%ai=0)aUl=0; cout«endl;for (i=1,n=0;i<=100;i+)if(ai!=0)cout«setw(5)«ai<<"n+;)if(n=10)cout«endl;n=0;)cout«endl;return 0;)5.2 題#include <iostream> usin
68、g namespace std; /#include <math.h>int main()int i,j,min,temp,a11;cout«"enter data:"«endl;for (i=1;i<=10;i+)cout«"a"«i<<"="cin»ai;/輸入 10 個(gè)數(shù))cout«endl«"The original numbers:"«endl;for (i=1;i<=10;i+)cout«ai«"/ 輸出這 10 個(gè)數(shù) cout«endl;for (i=1 ;i<=9;i+)以下8行是對(duì)10個(gè)數(shù)排序min=i;for (j=i+1;j<=10;j+)以下3行將ai+1a10中最小者與ai對(duì)換if (amin>aj) min=j; temp=ai;ai=amin;amin=temp;)cout<<endl<<"The sorted numbers:"<<endl;for (i=l;i<=l0;i+)/輸出
溫馨提示
- 1. 本站所有資源如無(wú)特殊說(shuō)明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
- 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
- 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒(méi)有圖紙預(yù)覽就沒(méi)有圖紙。
- 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
- 5. 人人文庫(kù)網(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ì)自己和他人造成任何形式的傷害或損失。
最新文檔
- 便攜式地質(zhì)雷達(dá)項(xiàng)目投資風(fēng)險(xiǎn)評(píng)估報(bào)告
- 量子算法經(jīng)典模擬與優(yōu)化的驗(yàn)證與分析研究-洞察闡釋
- 互聯(lián)網(wǎng)+背景下高校學(xué)生管理模式研究
- 干洗店運(yùn)營(yíng)管理方案
- AI繪畫(huà)挑戰(zhàn)下高職動(dòng)漫教育發(fā)展探索
- 環(huán)保陶瓷燒結(jié)-洞察及研究
- 3-聚合物鉆井液處理劑對(duì)水泥漿污染特性研究
- 廊坊衛(wèi)生職業(yè)學(xué)院《音樂(lè)劇風(fēng)格舞蹈》2023-2024學(xué)年第二學(xué)期期末試卷
- 擬標(biāo)題的題目及答案
- 腦筋急轉(zhuǎn)題目圖解及答案
- 企業(yè)管理咨詢報(bào)告書(shū)
- 工業(yè)互聯(lián)網(wǎng)標(biāo)識(shí)應(yīng)用成效評(píng)估報(bào)告(2023年)
- 走失患者不良事件警示教育內(nèi)容
- 無(wú)人機(jī)法律法規(guī)與安全飛行 第2版 課件 9 國(guó)外無(wú)人機(jī)管理
- 【新能源汽車動(dòng)力電池常見(jiàn)故障及維修方法探討5900字(論文)】
- 最全的-鐵路工程檢驗(yàn)批表格
- 國(guó)開(kāi)學(xué)習(xí)網(wǎng)《小學(xué)語(yǔ)文教學(xué)研究》形考任務(wù)1-5答案
- 過(guò)敏調(diào)查表范本
- 2023年06月中國(guó)社會(huì)科學(xué)院金融研究所第一批專業(yè)技術(shù)人員公開(kāi)招聘筆試歷年難、易錯(cuò)考點(diǎn)試題含答案解析
- 貴州省貴陽(yáng)市普通中學(xué)2021-2022學(xué)年八年級(jí)下學(xué)期期末監(jiān)測(cè)考試物理試題
- 特種設(shè)備日管控、周排查、月調(diào)度模板
評(píng)論
0/150
提交評(píng)論