NOJ100题 解答副本.doc

#include<> int main() { int a,b,sum; scanf("%d%d",&a,&b); sum=a+b; printf("%d\n",sum); return 0; } #include<> #define PI int main() { double r,h,l,s,sq,vq,vz; scanf("%lf%lf",&r,&h); l=2*PI*r; s=PI*r*r; sq=4*PI*r*r; vq=PI*r*r*r*4/3; vz=PI*r*r*h; printf("%.2lf\n%.2lf\n%.2lf\n%.2lf\n%.2lf\n",l,s,sq,vq,vz); return 0; } #include<> int main() { double ma,eng,c,sum,ave; scanf("%lf%lf%lf",&ma,&eng,&c); sum=ma+eng+c; ave=sum/3; printf("%lf\n%lf\n",sum,ave); return 0; } #include<> int main() { int a,b,c,m; scanf("%d%d%d",&a,&b,&c); if (a>b) m=a; else m=b; if (m<c) m=c; printf("%d",m); return 0; } #include<> int main() { int n; scanf("%d",&n); if ((1000<n<10000)&&(n/1000==n%10)&&(n/100%10==n/10%10)) printf("yes\n"); else if((100<n<=1000)&&(n/100==n%10)) printf("yes\n"); else if((10<n<=100)&&(n/10==n%10)) printf("yes\n"); else if(0<n<=10) printf("yes\n"); else printf("no\n"); return 0; } #include<> int main() { double l,bon; scanf("%lf",&l); if(l<=10) bon=l*; else if(l<20) bon=1+(l-10)*; else if(l<40) bon=+(l-20)*; else if(l<60) bon=+(l-40)*; else if(l<100) bon=+(l-60)*; else bon=+(l-100)*; printf("%lf\n",bon); return 0; } #include<> int main() { double d,m; scanf("%lf",&d); if(d<=2) m=7; else if(d<=15){ if(d-2==(int)(d-2)) m=7+(d-2)*; else m=7+((int)(d-2)+1)*; } else if(d-15==(int)(d-15)) m=+(d-15)*; else m=+((int)(d-15)+1)*; printf("%lf\n",m); return 0; } #include<> int main() { int y,m,d,Days,sum; scanf("%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; } printf("%d\n",sum); return 0;