西工大NOJ答案完全版
- 1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。
输出A+B的结黑
#i nclude
int main()
{
int a,b,sum;
sca nf("%d%d",&a,&b);
sum=a+b;
prin tf("%d\n",sum); return 0; }
#i nclude
#define PI 3.1415926
int main()
{
double r,h,l,s,sq,vq,vz;
sca nf("%lf%lf",&r,&h);
l=2*PI*r;
s=p|*r*r;
sq=4*p|*r*r;
vq=PI*r*r*r*4/3;
vz=PI*r*r*h;
prin tf("%.2lf\n%.2lf\n%.2lf\n%.2lf\n%.2lf\n",l,s,sq,vq,vz); return 0;
}
#i nclude
int main()
{
double ma,e ng,c,sum,ave;
sca nf("%lf%lf%lf",&ma,&en g,&c); sum=ma+e ng+c; ave=sum/3;
prin tf("%lf\n %lf\n",sum,ave); return 0;
}
#i nclude
int main()
{
int a,b,c,m;
sca nf("%d%d%d",&a,&b,&c); if (a>b) m=a;
else m=b;
if (m prin tf("%d",m); return 0; } #i nclude int main() { int n; sca nf("%d",&n); if ((1000V n<10000)&&(n/1000==n%10)&&(n/100%10==n/10%10)) prin tf("y es\n"); else if((100 else if((10< n <=100)&&(n/10==n%10)) pri ntf("yes\n"); else if(0< n<=10) pri ntf("yes\n"); else prin tf(" no\n"); return 0; } #i nclude int main() { double l,b on; sca nf("%lf",&l); if(|v=10) bon=1*0.1; else if(l<20) bo n=1+(l-10)*0.075; else if(l<40) bon=1.75+(1-20)*0.05; else if(l<60) bon=2.75+(1-40)*0.03; else if(l<100) bon=3.35+(1-60)*0.015; else bo n=3.95+(l-100)*0.01; prin tf("%lf\n",bo n); return 0; } 输出为实型，帰留六惶小裁（单位为元） #i nclude int main() { double d,m; sca nf("%lf",&d); if(d<=2) m=7; else if(d<=15){ if(d-2==(i nt)(d-2)) m=7+(d-2)*1.5; else m=7+((i nt)(d-2)+1)*1.5; } else if(d-15==(int)(d-15)) m=26.5+(d-15)*2.1; else m=26.5+((i nt)(d-15)+1)*2.1; prin tf("%lf\n",m); return 0; } #i nclude int main() { int y,m,d,Days,sum; sca nf("%d-%d-%d", &y,&m,&d); if((y%4==0&&y%100!=0)||(y%400==0)) Days=29; else Days=28; switch(m){ case 1:sum=d;break; case 2:sum=31+d;break; case 3:sum=31+Days+d;break; case 4:sum=62+Days+d;break; case 5:sum=92+Days+d;break; case 6:sum=123+Days+d;break; case 7:sum=153+Days+d;break; case 8:sum=184+Days+d;break; case 9:sum=215+Days+d;break; case 10:sum=245+Days+d;break; case 11:sum=276+Days+d;break; case 12:sum=307+Days+d;break; } prin tf("%d\n",sum); return 0; }