hdu2000~hdu2015

来源：互联网发布：嵌入式开发软件linux下编辑：程序博客网时间：2024/04/30 09:56

这里没有2003、2004，因为没有保存

hdu2000

#include <iostream>

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int main()
{
char s[3];
while(~scanf("%s",s))
{
sort(s,s+3);
for(int i=0;i<2;i++)
printf("%c ",s[i]);
printf("%c",s[2]);
printf("\n");
}
return 0;

}

hdu2001

#include <iostream>
#include<cstdio>
#include<cmath>
using namespace std;

int main()
{
float x1,x2,y1,y2;
while(~scanf("%f%f%f%f",&x1,&y1,&x2,&y2))
{
float n=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
float k=sqrt(n);
printf("%0.2f\n",k);
}
return 0;
}

hdu2002

#include <iostream>
#include<cstdio>
using namespace std;
#define pi 3.1415927
int main()
{
double r;
while(~scanf("%lf",&r))
{
double v=(4*pi*r*r*r)/3;
printf("%0.3lf\n",v);
}
return 0;
}

hdu2005

#include <iostream>
#include<cstdio>
using namespace std;

int main()
{
int year,month,day;
while(~scanf("%d/%d/%d",&year,&month,&day))
{
if((year%100!=0&&year%4==0)||(year%400==0))
{
for(int i=1;i<month;i++)
{
if(i==1||i==3||i==5||i==7||i==8||i==10||i==12)
day+=31;
else if(i==2)
day+=29;
else
day+=30;
}
}
else
{
for(int i=1;i<month;i++)
{
if(i==1||i==3||i==5||i==7||i==8||i==10||i==12)
day+=31;
else if(i==2)
day+=28;
else
day+=30;
}
}
printf("%d\n",day);
}
return 0;
}

hdu2006

#include <iostream>
#include<vector>
#include<cstdio>

using namespace std;

int a[10000];
int main()
{
int n;
while(~scanf("%d",&n))
{
int x=1;
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(a[i]%2!=0)
x*=a[i];
}
printf("%d\n",x);

}
return 0;
}

hdu2007

#include <iostream>
#include<cmath>
#include<cstdio>
using namespace std;

int main()
{
int m,n;
while(~scanf("%d%d",&m,&n))
{
int o=0,j=0;
if(m>n)
{
int t=m;
m=n;
n=t;
}
for(int i=m;i<=n;i++)
{
if(i%2==0)
o+=i*i;
else
j+=i*i*i;
}
printf("%d %d\n",o,j);
}
return 0;
}

hdu2008

#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;

int main()
{
int n;
int count[3];
double a[100];
while(~scanf("%d",&n)&&n)
{
memset(count,0,sizeof(count));

for(int i=0;i<n;i++)
{
scanf("%lf",&a[i]);
if(a[i]<0)
count[0]++;
else if(a[i]==0)
count[1]++;
else
count[2]++;
}
printf("%d %d %d\n",count[0],count[1],count[2]);

}
return 0;
}

hdu2009

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
int m,n;
while(~scanf("%d%d",&n,&m))
{
double s = 0, b = n;
for (int i = 0; i < m; i++)
{
s += b;
b = sqrt(b);
}
printf("%0.2lf\n",s);
}
return 0;
}

hdu2010

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;

int main()
{
int m,n,a,b,c;
int x[1000];
while(~scanf("%d%d",&m,&n))
{
int count=0;
if(m>n)
{
int t=m;
m=n;
n=t;
}
for(int i=m;i<=n;i++)
{
a=i%10;b=(i/10)%10;c=(i/100)%10;
int y=a*a*a+b*b*b+c*c*c;
if(y==i)
x[count++]=i;

}
if(count==0)
printf("no\n");
else
{
for(int i=0;i<count-1;i++)
printf("%d ",x[i]);
printf("%d\n",x[count-1]);
}

}
return 0;
}

hdu2011

#include <iostream>
#include<cstdio>
using namespace std;

int main()
{
int m,n;
scanf("%d",&m);
while(m--)
{
scanf("%d",&n);
double sum=0;
for(int i=1;i<=n;i++)
{
if(i%2!=0)
sum+=(1.0/i);
else
sum-=(1.0/i);
}
printf("%0.2lf\n",sum);
}
return 0;
}

hdu2012

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;

int main()
{
int x,y,j;
while(~scanf("%d%d",&x,&y)&&(x||y))
{
int count=0;
for(int i=x;i<=y;i++)
{
int y=i*i+i+41;
for(j=2;j<y;j++)
{
if(y%j==0)
break;
}
if(j==y)
count++;
}
if(count==(y-x+1))
printf("OK\n");
else
printf("Sorry\n");
}
return 0;
}

hdu2013

#include <iostream>
#include<cstdio>
using namespace std;

int main()
{
int m;
while(~scanf("%d",&m))
{
int n=1;
for(int i=1;i<m;i++)
n=(n+1)*2;
printf("%d\n",n);
}
return 0;
}

hdu2014

#include <iostream>
#include<cstdio>
#include<cmath>
using namespace std;
double max(double x,double y)
{
if(x>=y)
return x;
else
return y;
}
double min(double x,double y)
{
if(x<=y)
return x;
else
return y;
}
int main()
{
int n;
double a[105];
while(~scanf("%d",&n)&&n>2&&n<101)
{
double t=-1,r=101;
for(int i=0;i<n;i++)
{
scanf("%lf",&a[i]);
t=max(t,a[i]);
r=min(r,a[i]);
}
double sum=0;
for(int i=0;i<n;i++)
sum+=a[i];
sum=sum-t-r;
double avg=sum/(n-2);
printf("%0.2lf\n",avg);
}
return 0;
}

hdu2015

#include <iostream>
#include<cstdio>
using namespace std;

int main()
{
int n,m;
while(~scanf("%d%d",&n,&m))
{
int i=0,sum=0,a1=2;
while(n--)
{
i++;
sum+=a1;
a1+=2;
if(i==m&&n!=0)
{
printf("%d ",sum/m);
i=0;sum=0;
}
}
printf("%d\n",sum/i);
}

return 0;
}

0 0