杭电OJ水题答案2

杭电OJ水题答案2 Hdu 2000

#include

void main()

{

char a,b,c,t;

while(scanf("%c%c%c",&a,&b,&c)>0)

{

if(a>b) t=a,a=b,b=t;

if(a>c) t=c,c=a,a=t;

if(c>a && c

scanf("%*c",&a);

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

}

}

Hdu 2001

#include

#include

int main()

{

double x1;

double x2;

double y1;

double y2;

while(scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2)!=EOF) {

double num=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)); printf("%.2lf\n",num);

}

return 0;

}

Hdu 2002

#include

int main()

{

- 1 -

double pi=3.1415927;

double r;

while (scanf("%lf",&r)==1)

printf("%.3lf\n",((pi*r*r*r)*4)/3);

}

Hdu 2003

#include

#include

int main()

{

double x;

while (scanf("%lf",&x)==1)

printf("%.2lf\n",fabs(x));

return 0;

}

Hdu 2004

#include

void main()

{

double x;

while(scanf("%lf",&x)==1)

if(x>100||x<0)

printf("Score is error!\n");

else if(0

printf("C\n");

else if(80<=x&&x<90)

printf("B\n");

else

printf("A\n");

}

Hdu 2005

#include

void main()

- 2 -

{

int y,m,d,sum=0;

while(scanf("%d/%d/%d",&y,&m,&d)!=EOF)

{

if((y%100==0&&y%400==0)||(y%100!=0&&y%4==0)) {

switch(m=13-m)

{

case 1: sum=sum+30;

case 2: sum=sum+31;

case 3: sum=sum+30;

case 4: sum=sum+31;

case 5: sum=sum+31;

case 6: sum=sum+30;

case 7: sum=sum+31;

case 8: sum=sum+30;

case 9: sum=sum+31;

case 10: sum=sum+29;

case 11: sum=sum+31;

}

}

else

{

switch(m=13-m)

{

case 1: sum=sum+30; case 2: sum=sum+31; case 3: sum=sum+30; case 4: sum=sum+31; case 5: sum=sum+31; case 6: sum=sum+30; case 7: sum=sum+31; case 8: sum=sum+30; case 9: sum=sum+31; case 10: sum=sum+28; case 11: sum=sum+31; }

}

printf("%d\n",sum+d); sum=0;

}

}

- 3 -

Hdu 2006

#include void main()

{

int n,i,a,sum=1;

while(scanf("%d",&n)!=EOF)

{

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

{

scanf("%d",&a);

if(a%2==1)

sum*=a;

}

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

sum=1;

}

}

Hdu 2007

#include

void main()

{

int a,b,x=0,y=0,t;

while(scanf("%d%d",&a,&b)!=EOF) {

if(b

{

m:{ while(a<=b)

{

if(a%2==0) { x=a*a+x;a++;} else { y=a*a*a+y; a++;}

}}

printf("%d %d\n",x,y);

x=0; y=0;

}

}

}

- 4 -

Hdu 2008

#include

void main()

{

double a; int i,x=0,y=0,z=0,n; while(scanf("%d",&n)==1)

{

if(n==0)

break;

else

{

while(n--)

{

scanf("%lf",&a);

if(a<0) {x++;}

else if(a==0) {y++;}

else {z++;}

}

}

printf("%d %d %d\n",x,y,z);

x=0;y=0;z=0;

}

}

Hdu 2009

#include

#include

void main()

{

double n,m;

double sum=0;

while (scanf("%lf%lf",&n,&m)==2) {

for(int i=0;i

{

sum=sum+n;

n=sqrt(n);

}

printf("%.2lf\n",sum);

sum=0;

- 5 -

}

}

Hdu 2010

#include

void main()

{

int a,b,i,t,x,y,z,count=0;

while(scanf("%d%d",&a,&b)!=EOF)

{

if(a>b) {t=a;a=b,b=t;}

if(a<100||b>999) goto m;

for(i=a;i<=b;i++)

{

x=(i%100)%10;y=(int(i/10))%10;z=int(i/100); if(x*x*x+y*y*y+z*z*z==i)

{

count+=1;

if(count==1)

printf("%d",i);

else printf(" %d",i);

}

}

m: {

if(count>=1) printf("\n");

else { printf("no\n");x=0;y=0;z=0; } }

count=0;

}

}

Hdu 2011

#include

#include

int main()

{

int n;

double a,i=1.0;

double sum=0,b=0;

- 6 -

while(scanf("%d",&n)!=EOF)

{

while(n--)

{

scanf("%lf",&a);

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

{

sum=sum+(1/i)*pow(-1.0,i+1);

}

printf("%.2lf\n",sum);sum=0;

}

}

}

Hdu 2012

#include

#include

int fun1(int x)

{return x*x+x+41;} int fun2(int x) {

for(int i=2;i

{

if(x%i==0) { return 1;}

}return 0;

}

void main()

{

int a,b,m,n,t,sum=0;

while(scanf("%d %d",&a,&b)!=EOF) {

if(a==0&&b==0)

continue;

else if(a>b)

{

t=a;a=b;b=t;

}

{

/*if(a>b) { c=a;a=b;b=c;}*/ for(int i=a;i<=b;i++)

{

m=fun1(i);

- 7 -

n=fun2(m);

sum+=n;

}

if(sum!=0)

{

printf("Sorry\n");

}

else

{

printf("OK\n");

}

sum=0;

}

}

}

Hdu 2013

#include #include int main() {

int x,n;

while(scanf("%d",&n)!=EOF)

{

if(n==0) break;

n=pow(2,n-1);

printf("%d\n",3*n-2);

}

}

Hdu 2014

#include int main()

{

int n,i;

float a[100],sum,max,min;

while(scanf("%d",&n)!=EOF)

{

sum=0;

- 8 -

for(i=0;i

scanf("%f",&a[i]);

max=min=a[0];

for(i=0;i

{

if(a[i]>max)

max=a[i];

if(a[i]

min=a[i];

sum+=a[i];

}

printf("%.2f\n",(sum-min-max)/(n-2));

}

}

Hdu 2016

#include

void main()

{

int a[99],n,i,min,t=0;

while(scanf("%d",&n)!=EOF)

{

if(n==0) break;

else

{

for(i=0;i

{

if(a[i]<=min) {min=a[i]; t=i;}

}

a[t]=a[0]; a[0]=min;

}

printf("%d",a[0]);

for(i=1;i

printf(" %d",a[i]);

t=0;

printf("\n");

}

}

- 9 -

Hdu 2017

#include

void main()

{

int count=0,i,n;

char a[1000];

scanf("%d",&n);

while(n--)

{ scanf("%s",a);getchar();

for(i=0;a[i];i++) //为什么,,,,,, {

if(a[i]>='0'&&a[i]<='9')

count++;

}

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

count=0;

}

}

Hdu 2018

#include

int main()

{

int a[55]={1,2,3};

int n,i;

while(scanf("%d",&n)==1&&n!=0) {

for(i=3;i<55;i++)

a[i]=a[i-1]+a[i-3];

printf("%d\n",a[n-1]);

}

}

Hdu 2019

#include

int main()

{

- 10 -

int a[100];

int n,i,k=0,m;

while(scanf("%d%d",&n,&m)==2&&(n!=0&&m!=0)) {

for(i=0;i

{

scanf("%d",&a[i]);

}

if(m>=a[n-1])

{

for(i=0;i

{

printf("%d ",a[i]);

}

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

}

else if(m<=a[0])

{

printf("%d",m);

for(i=0;i

{

printf(" %d",a[i]);

}

printf("\n");

}

else

{

for(i=0;i

if(a[i]>=m)

{k=i;break;}

}

for(i=0;i

printf("%d ",a[i]); }

printf("%d",m);

for(i=k;i

printf(" %d",a[i]); }

printf("\n");

}

}

- 11 -

}

Hdu 2020

#include #include

int main ()

{

int i,j,t,n,a[100];

while(scanf("%d",&n)!=EOF&&n!=0) {

for(i=0;i

scanf("%d",&a[i]);

for(i=0;i

{

for(j=0;j

{

if(abs(a[j])

{

t=a[j];a[j]=a[j+1];a[j+1]=t;

}

}

}

printf("%d",a[0]);

for(i=1;i

printf(" %d",a[i]);

printf("\n");

}

}

Hdu 2021

#include

int fun(int x)

{

int a=0,b=0,c=0,d=0,e=0,f=0;

a=(int)(x/100);

b=(int)((x-100*a)/50);

c=(int) ((x-100*a-50*b)/10);

d=(int)((x-100*a-50*b-10*c)/5);

e=(int) ((x-100*a-50*b-10*c-5*d)/2); f=x-100*a-50*b-10*c-5*d-2*e;

- 12 -

return a+b+c+d+e+f; }

void main()

{

int n,a[100],sum;

while(scanf("%d",&n)!=EOF)

{

if(n==0) break;

sum=0;

for(int i=0;i

{

scanf("%d",&a[i]);

sum+=fun(a[i]);

}