c答案(2)

2019-03-29 09:43

printf(\ break;

case 2:printf(\ printf(\ break;

case 1:printf(\ printf(\ } } 4.8 main()

{long i;

float bonus,bon1,bon2,bon4,bon6,bon10; bon1=100000*0.1;

bon2=bon1+100000*0.075; bon4=bon2+200000*0.05; bon6=bon4+200000*0.03; bon10=bon6+400000*0.015; scanf(\ if(i<=1e5)bonus=i*0.1;

else if(i<=2e5)bonus=bon1+(i-100000)*0.075; else if(i<=4e5)bonus=bon2+(i-200000)*0.05; else if(i<=6e5)bonus=bon4+(i-400000)*0.03; else if(i<=1e6)bonus=bon6+(i-600000)*0.015;

else bonus=bon10+(i-1000000)*0.01; printf(\}

main() {long i;

float bonus,bon1,bon2,bon4,bon6,bon10; int branch;

bon1=100000*0.1;

bon2=bon1+100000*0.075; bon4=bon2+200000*0.05; bon6=bon4+200000*0.03; bon10=bon6+400000*0.015; scanf(\ branch=i/100000; if(branch>10)branch=10; switch(branch)

{case 0:bonus=i*0.1;break;

case 1:bonus=bon1+(i-100000)*0.075;break; case 2:

6

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=bon10+(i-1000000)*0.01; }

printf(\} 4.9 main()

{int t,a,b,c,d;

scanf(\ 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;}

printf(\ %d %d %d\\n\} 4.10 main()

{int h=10;

float x,y,x0=2,y0=2,d1,d2,d3,d4; scanf(\

d1=(x-x0)*(x-x0)+(y-y0)*(y-y0); d2=(x-x0)*(x-x0)+(y+y0)*(y+y0); d3=(x+x0)*(x+x0)+(y-y0)*(y-y0); d4=(x+x0)*(x+x0)+(y+y0)*(y+y0); if(d1>1&&d2>1&&d3>1&&d4>1)h=0; printf(\}

第五章 循环控制 5.1 main()

{int a,b,num1,num2,temp;

scanf(\

if(num1

7

while(b!=0) {temp=a%b; a=b;

b=temp;} printf(\

printf(\}

5.2

#i nclude\main() {char c;

int letters=0,space=0,digit=0,other=0; 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++; else other++; }

printf(\}

5.3 main()

{int a,n,count=1,sn=0,tn=0; scanf(\ while(count<=n) {tn+=a; sn+=tn; a*=10; ++count; }

printf(\} 5.4 main()

{float n,s=0,t=1;

for(n=1;n<=20;n++) {t*=n; s+=t;

}

printf(\}

8

5.5 main()

{int N1=100,N2=50,N3=10; float k;

float s1=0,s2=0,s3=0; for(k=1;k<=N1;k++)s1+=k; for(k=1;k<=N2;k++)s2+=k*k; for(k=1;k<=N3;k++)s3+=1/k; printf(\} 5.6 main()

{int i,j,k,n;

for(n=100;n<1000;n++) {i=n/100; j=n/10-i*10; k=n;

if(i*100+j*10+k==i*i*i+j*j*j+k*k*k) printf(\ } } 5.7

#define M 1000 main()

{int k0,k1,k2,k3,k4,k5,k6,k7,k8,k9; int i,j,n,s;

for(j=2;j<=M;j++) {n=0; s=j;

for(i=1;i

{case 1:k0=i;break; case 2:k1=i;break; case 3:k2=i;break; case 4:k3=i;break; case 5:k4=i;break; case 6:k5=i;break; case 7:k6=i;break;

9

case 8:k7=i;break; case 9:k8=i;break; case 10:k9=i;break; } } } if(s==0)

{printf(\

if(n>1)printf(\ if(n>2)printf(\ if(n>3)printf(\ if(n>4)printf(\ if(n>5)printf(\ if(n>6)printf(\ if(n>7)printf(\ if(n>8)printf(\ if(n>9)printf(\ } } }

main()

{static int k[10]; int i,j,n,s;

for(j=2;j<=1000;j++) {n=-1; s=j;

for(i=1;i

if(s==0)

{printf(\ for(i=0;i

10


c答案(2).doc 将本文的Word文档下载到电脑 下载失败或者文档不完整,请联系客服人员解决!

下一篇:本科毕业论文 - 基于j2ee技术的高校公文管理系统的设计

相关阅读
本类排行
× 注册会员免费下载(下载后可以自由复制和排版)

马上注册会员

注:下载文档有可能“只有目录或者内容不全”等情况,请下载之前注意辨别,如果您已付费且无法下载或内容有问题,请联系我们协助你处理。
微信: QQ: