Mooc测验与作业答案改进版1.docx

上传人:b****5 文档编号:3237653 上传时间:2022-11-20 格式:DOCX 页数:24 大小:18.72KB
下载 相关 举报
Mooc测验与作业答案改进版1.docx_第1页
第1页 / 共24页
Mooc测验与作业答案改进版1.docx_第2页
第2页 / 共24页
Mooc测验与作业答案改进版1.docx_第3页
第3页 / 共24页
Mooc测验与作业答案改进版1.docx_第4页
第4页 / 共24页
Mooc测验与作业答案改进版1.docx_第5页
第5页 / 共24页
点击查看更多>>
下载资源
资源描述

Mooc测验与作业答案改进版1.docx

《Mooc测验与作业答案改进版1.docx》由会员分享,可在线阅读,更多相关《Mooc测验与作业答案改进版1.docx(24页珍藏版)》请在冰豆网上搜索。

Mooc测验与作业答案改进版1.docx

Mooc测验与作业答案改进版1

Mooc测验与作业答案

第二周作业

ccbcabacbd

第三周编程

1、#include

intmain()

{

printf("Helloworld.\n");

return0;

}

2、#include

#definePAI3.1415926

intmain()

{

intr,h;

doubles,v;

scanf("%d%d",&r,&h);

s=2*PAI*r*h;

v=PAI*r*r*h;

printf("s=%.2f,v=%.2f\n",s,v);

return0;

}

3、#include

intmain()

{

charch;

scanf("%c",&ch);

printf("TheASCIIofcharacter'%c'is%d.",ch,ch);

return0;

}

4、#include

intmain()

{

inta,b;

charch=37;

scanf("%d%d",&a,&b);

printf("%d+%d=%d\n",a,b,a+b);

printf("%d-%d=%d\n",a,b,a-b);

printf("%d*%d=%d\n",a,b,a*b);

printf("%d/%d=%d\n",a,b,a/b);

printf("%d%c%d=%d\n",a,ch,b,a%b);

return0;

}

5、#include

intmain()

{

inta,b,c;

scanf("%d%d%d",&a,&b,&c);

if(a+b>c&&a+c>b&&b+c>a)

{

if(a==b&&a==c&&b==c)

{

printf("equilateraltriangle.\n");

return0;

}

if(a==b||a==c||b==c)

{

printf("isocelestriangle.\n");

return0;

}

printf("triangle.\n");

}

else

{

printf("non-triangle.\n");

}

return0;

}

第四周作业

a=2,b=10.5000000

第四周编程

1、#include

intmain()

{

inthour,minute,temp;

floatangle,h_angle,m_angle;

scanf("%d%d",&hour,&minute);

temp=hour;

if(hour==12)temp=0;

h_angle=temp*30.0+minute*0.5;

m_angle=minute*6.0;

angle=h_angle>m_angle?

h_angle-m_angle:

m_angle-h_angle;

if(angle>180.0)angle=360.0-angle;

printf("At%d:

%02dtheangleis%.1fdegrees.\n",hour,minute,angle);

return0;

}

2、#include

intmain()

{

intyear,n,week,total,day;

scanf("%d",&year);

if((year%4==0&&year%100!

=0)||year%400==0)

{week=(year+year/4+year/400-year/100-1)%7;

for(n=0;n<5;n++){if(n==0)total=0;if(n==1||n==3)total+=31;

if(n==2)total+=29;if(n==4)total+=30;

}

}

else

{week=(year+year/4+year/400-year/100)%7;

for(n=0;n<5;n++){if(n==0)total=0;

if(n==1||n==3)total+=31;

if(n==2)total+=28;

if(n==4)total+=30;

}

}week=(week+total)%7;

if(week==0)week=7;

day=7-week+8;

printf("%d\n",day);

return0;

}

3、#include

intmain()

{

intyear,month,day,n,week,total;

scanf("%d%d%d",&year,&month,&day);

if(year<=1900){

printf("yeariserror.\n");

return0;

}

if(month>=13||month<1){

printf("monthiserror.\n");

return0;

}

if(day<0){

printf("dayiserror.\n");

return0;

}

switch(month){

case1:

case3:

case5:

case7:

case8:

case10:

case12:

if(day>31)

{printf("dayiserror.\n");return0;}

break;

case4:

case6:

case9:

case11:

if(day>30)

{printf("dayiserror.\n");return0;}

break;

case2:

if((year%4==0&&year%100!

=0)||year%400==0)

{if(day>29){printf("dayiserror.\n");return0;}

}

else

{

if(day>28){printf("dayiserror.\n");return0;}

}

break;

}

if((year%4==0&&year%100!

=0)||year%400==0)

{

week=(year+year/4+year/400-year/100-1)%7;

for(n=0;n

{

if(n==0)total=0;

if(n==1||n==3||n==5||n==7||n==8||n==10)total+=31;

if(n==2)total+=29

;if(n==4||n==6||n==9||n==11)total+=30;

}

}

else

{

week=(year+year/4+year/400-year/100)%7;

for(n=0;n

{

if(n==0)total=0;

if(n==1||n==3||n==5||n==7||n==8||n==10)total+=31;

if(n==2)total+=28;

if(n==4||n==6||n==9||n==11)total+=30;

}

}

week=(week+total+day-1)%7;

printf("%d\n",week);

return0;

}

4、#include

intmain()

{

inta,n,i,total=1;

scanf("%d%d",&a,&n);

if(n==0)total=1;

for(i=1;i<=n;i++)

{

total*=a;

}

total=total%1000;

printf("Thelast3numbersis%d.\n",total);

return0;

}

第五期编程

1、#include

intmain()

{

inta=1,b=1,c=1,maxnum,count=0;

scanf("%d",&maxnum);

for(c=1;c<=maxnum;c++)

{

for(a=1;a

{for(b=1;b

{if((c*c==a*a+b*b)&&(a<=b))count++;

}

}

}

printf("%d\n",count);

return0;

}

2、#include

intmain()

{

intmaxnum,minnum,n,g,s,b,q,count=0;

while

(1)

{

scanf("%d%d",&minnum,&maxnum);

if(minnum==0&&maxnum==0)return0;

if((minnum>999&&minnum<10000)&&(maxnum>999&&maxnum<10000)&&(maxnum>=minnum))

{

for(n=minnum;n<=maxnum;n++)

{

if(n%2==0){

q=n/1000;

b=n%1000/100;

s=n%100/10;

g=n%10;

if(q!

=b&&q!

=s&&q!

=g&&b!

=s&&b!

=g&&s!

=g)

{

count++;

printf("%d",n);

}

}

}

printf("\n");

printf("counter=%d\n",count);

count=0;

}

else

printf("Error\n");

}

展开阅读全文
相关资源
猜你喜欢
相关搜索

当前位置:首页 > 法律文书 > 辩护词

copyright@ 2008-2022 冰豆网网站版权所有

经营许可证编号:鄂ICP备2022015515号-1