HDU 水题 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016
来源:互联网 发布:百度软件中心 知乎 编辑:程序博客网 时间:2024/04/28 02:45
/*HDU 2002 计算球体积*/#include<iostream>#include<stdio.h>using namespace std;#define PI 3.1415927int main(){double r;while(scanf("%lf",&r)!=EOF){printf("%.3lf\n",4.0/3*PI*r*r*r);}return 0;}
2003
/*HDU 2003 求绝对值 水题 */#include<iostream>#include<stdio.h>using namespace std;int main(){double r;while(scanf("%lf",&r)!=EOF){printf("%.2lf\n",r>0?r:-r);}return 0;}
2004
/*HDU 2004 水题 */#include<iostream>#include<stdio.h>using namespace std;int main(){int score;while(scanf("%d",&score)!=EOF){if(score<0||score>100)printf("Score is error!\n");else if(score>=90&&score<=100)printf("A\n");else if(score>=80&&score<=89)printf("B\n");else if(score>=70&&score<=79)printf("C\n");else if(score>=60&&score<=69)printf("D\n");elseprintf("E\n");}return 0;}
2005
/*HDU 2005 水题 */#include<iostream>#include<stdio.h>using namespace std;int main(){int day[]={0,31,28,31,30,31,30,31,31,30,31,30,31};int y,m,d,sum,i;while(scanf("%d/%d/%d",&y,&m,&d)!=EOF){sum=0;for(i=1;i<m;i++)sum+=day[i];if(m>2)if((y%4==0&&y%100!=0)||(y%400==0))sum+=1;sum+=d;printf("%d\n",sum);}return 0;}
2006
/*HDU 2006 水题 */#include<iostream>#include<stdio.h>using namespace std;int main(){int i,n,x;__int64 ans;while(scanf("%d",&n)!=EOF){ans=1;for(i=0;i<n;i++){scanf("%d",&x);if(x&1){ans*=x;}}printf("%I64d\n",ans);}return 0;}
2007
/*HDU 2007 水题 */#include<iostream>#include<stdio.h>using namespace std;int main(){int i,a,b,t;__int64 ans,ans2;while(scanf("%d",&a)!=EOF){scanf("%d",&b);if(a>b){t=a;a=b;b=t;}ans=0;ans2=0;for(i=a;i<=b;i++){if(i&1){ans2+=i*i*i;}else{ans+=i*i;}}printf("%I64d %I64d\n",ans,ans2);}return 0;}
2008
/*HDU 2008 水题 */#include<iostream>#include<stdio.h>using namespace std;int main(){int n,i,pos,zero,neg;double x;while(scanf("%d",&n),n){pos=0;zero=0;neg=0;for(i=0;i<n;i++){scanf("%lf",&x);if(x>0)pos++;else if(x<0)neg++;elsezero++;}printf("%d %d %d\n",neg,zero,pos);}return 0;}
2009
/*HDU 2009 水题 */#include<iostream>#include<math.h>#include<stdio.h>using namespace std;int main(){int n,i,m;double ans,x;while(scanf("%d%d",&n,&m)!=EOF){ans=n;x=n;for(i=0;i<m-1;i++){x=(double)sqrt((double)x);ans+=x;}printf("%.2lf\n",ans);}return 0;}
2010
/*HDU 2010 水题 */#include<iostream>#include<math.h>#include<stdio.h>using namespace std;int main(){int n,m,i,a,b,c,k;while(scanf("%d%d",&m,&n)!=EOF){k=0;for(i=m;i<=n;i++){a=i/100;b=i/10%10;c=i%10;if(i==(a*a*a)+(b*b*b)+(c*c*c)){k++;if(k==1)printf("%d",i);elseprintf(" %d",i);}}if(k==0)printf("no\n");elseprintf("\n");}return 0;}
2011
/*HDU 2011 水题 */#include<iostream>#include<math.h>#include<stdio.h>using namespace std;int main(){int n,m,i;double ans;scanf("%d",&m);while(m--){scanf("%d",&n);ans=0;for(i=1;i<=n;i++){if(i&1){ans+=1.0/i;}else{ans-=1.0/i;}}printf("%.2lf\n",ans);}return 0;}
2012
/*HDU 2012 水题 */#include<iostream>#include<math.h>#include<stdio.h>using namespace std;int isPrime(int k){int i;for(i=2;i<=k/2;i++)if(k%i==0)return 0;return 1;}int main(){int n,m,i,k,f;while(scanf("%d%d",&m,&n),m+n){f=1;for(i=m;i<=n;i++){k=i*i+i+41;if(!isPrime(k)){f=0;break;}}if(f==1)printf("OK\n");elseprintf("Sorry\n");}return 0;}
2013
/*HDU 2013 水题 */#include<iostream>#include<math.h>#include<stdio.h>using namespace std;int main(){int n,i,ans;while(scanf("%d",&n)!=EOF){ans=1;for(i=n-1;i>=1;i--){ans=(ans+1)*2;}printf("%d\n",ans);}return 0;}
2014
/*HDU 2014 水题 */#include<iostream>#include<math.h>#include<stdio.h>using namespace std;int main(){int n,i,ans,max,min,x;while(scanf("%d",&n)!=EOF){max=-1;min=105;ans=0;for(i=0;i<n;i++){scanf("%d",&x);if(x>max)max=x;if(x<min)min=x;ans+=x;;}printf("%.2lf\n",(ans-max-min)*1.0/(n-2));}return 0;}
2015
/*HDU 2015 水题 */#include<iostream>#include<math.h>#include<stdio.h>using namespace std;int main(){int n,m,i,num,k,ans,f;while(scanf("%d%d",&n,&m)!=EOF){num=2;i=1;f=1;while(1){k=1;ans=0;while(k<=m&&i<=n){ans+=num;num+=2;i++;k++;}if(k>m){if(f){printf("%d",ans/m);f=0;}elseprintf(" %d",ans/m);}if(i>n)break;}if(k<=m){if(f){printf("%d",ans/(k-1));f=0;}elseprintf(" %d",ans/(k-1));}printf("\n");}return 0;}
2016
/*HDU 2016 水题 */#include<iostream>#include<math.h>#include<stdio.h>using namespace std;int main(){int n,min,min_w,i;int a[101];while(scanf("%d",&n),n){min=9999999;for(i=0;i<n;i++){scanf("%d",&a[i]);if(a[i]<min){min=a[i];min_w=i;}}printf("%d",a[min_w]);for(i=1;i<n;i++){if(i!=min_w)printf(" %d",a[i]);elseprintf(" %d",a[0]);}printf("\n");}return 0;}
0 0
- HDU 水题 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016
- HDU 2013 2014 2015 2016
- hdu 2008-2023(缺少2011,2013,2015,2016,2017,2022)
- HDU 2003 2004
- HDU 2006-2009
- hdu 2002
- HDU 2002
- HDU 2002
- HDU-2002
- HDU-2002
- HDU 2002
- HDU 2002
- HDU 2002
- hdu 2004
- HDU 2004
- HDU 2004
- HDU-2004
- HDU-2004
- 面向对象设计UML常用工具比较和品评
- 布局
- 【c语言】实现Strcat函数
- 低功耗蓝牙4.0BLE编程-nrf51822开发(6)-Battery Service
- 第十三篇 一个安装、管理windows服务的桌面程序
- HDU 水题 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016
- 粒子系统 和 摄像机
- OC类的继承-super关键字
- linux 下sed使用
- (ZT)iOS 调用地图导航
- nyoj 399 整除个数
- 静态变量使用技巧
- UVA - 11292 - Dragon of Loowater
- 游戏项目之打怪