水题难道有人不懂?
LV耗子
现在,当我不解时就想到你!以后,当你不解时请你想起我!
展开
-
hdu--5347--2015 Multi-University Training Contest 5--MZL's chemistry
MZL's chemistryTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 290 Accepted Submission(s): 240Problem Description MZL define原创 2015-08-05 09:38:51 · 664 阅读 · 0 评论 -
杭电2016
#include int main (void){ int n,i,a[100],min,j; while(scanf("%d",&n)!=EOF) { if(!n) break; scanf("%d",&a[0]); min=0,j=a[0]; for(i=1;in;i++)原创 2013-04-21 10:03:42 · 914 阅读 · 0 评论 -
杭电2015
#include int main (void){ int n,m,i,x,j,k; while(scanf("%d%d",&n,&m)!=EOF) { x=0,j=0,k=0; for(i=1;in;i++) { j++; x+=2*i; //用x来打造2、4、6、8.原创 2013-04-21 10:01:41 · 922 阅读 · 0 评论 -
杭电2013
#include //超级水题啊,初中生才做的数学题,逆推int main (void){ int n,i,s; while(scanf("%d",&n)!=EOF) { s=1;//记录最后所剩的1个桃桃 for(i=n;i>1;i--)//从滴n天开始时光倒流,不过别倒流到第一天,因为s是记录的滴i天吃桃前的桃桃数量原创 2013-04-08 09:13:13 · 812 阅读 · 0 评论 -
杭电2012
#include int su(int a)//简单快速判断是不是素数,不是返回1,是就返回0{ int i; for(i=2;i*ia;i++) if(0==a%i) return 1; return 0;}int main (void){ int x,y,i,m; while(scanf("%d%原创 2013-04-08 09:08:10 · 1013 阅读 · 0 评论 -
杭电2010
#include #include int main (void){ int n,m,i,k; while(scanf("%d%d",&n,&m)!=EOF) { k=0; for(i=n;im+1;i++) { if(i==pow(i/100,3)+pow(i/10%10原创 2013-04-08 09:01:56 · 886 阅读 · 0 评论 -
杭电2009
#include #include int main (void){ int i; float n,m,k,s; while(scanf("%f%f",&n,&m)!=EOF) { s=n,k=n;//这样第一项的运算就免了 for(i=1;im;i++) { k=sqrt(k);//用k原创 2013-04-08 08:58:45 · 781 阅读 · 0 评论 -
杭电2011
#include int main (void){ int m,i,j,x,k; float a[1000],s; scanf("%d",&m); for(i=0;im;i++)//根据题目要求,所有实例input完之后再output { s=0; k=1; scanf("%d",&x);原创 2013-04-08 09:05:10 · 860 阅读 · 0 评论 -
杭电2005
#include int main (void){ int y,m,d,s,i,a[]={31,28,31,30,31,30,31,31,30,31,30,31}; while(scanf("%d/%d/%d",&y,&m,&d)!=EOF) { s=0; for(i=1;im;i++) s+=a[i-1]原创 2013-03-15 11:29:47 · 1040 阅读 · 0 评论 -
杭电2008
#include int main (void){ int n,i,a,b,c; float t; while(scanf("%d",&n)!=EOF) { if(0==n) break; a=0,b=0,c=0; for(i=0;in;i++) {原创 2013-03-15 11:30:56 · 1089 阅读 · 0 评论 -
杭电2007
#include int main (void){ int m,n,i,a,b,t; while(scanf("%d%d",&m,&n)!=EOF) { if(m>n) t=m,m=n,n=t; a=0,b=0; for(i=m;in+1;i++) { if(原创 2013-03-15 11:30:30 · 1061 阅读 · 0 评论 -
杭电2006
#include int main (void){ int n,i,a,s; while(scanf("%d",&n)!=EOF) { s=1; for(i=0;in;i++) { scanf("%d",&a); if(0!=a%2) s*=a原创 2013-03-15 11:30:10 · 1349 阅读 · 0 评论 -
杭电2004
#include int main (void){ int a; while(scanf("%d",&a)!=EOF) { if(a>-1 && a60) printf("E\n"); else if(a>59 && a70) printf("D\n");原创 2013-03-15 11:29:22 · 901 阅读 · 0 评论 -
杭电1097
#include int main (void){ __int64 a,b,c; while(scanf("%I64d%I64d",&a,&b)!=EOF) { b%=4;a%=10;c=a; if(b==0) b=4; while(--b) c=c*a%10; printf原创 2013-03-11 22:04:32 · 885 阅读 · 0 评论 -
杭电2000
#include int main (void){ char a,b,c,d,t; while(scanf("%c%c%c%c",&a,&b,&c,&d)!=EOF) { if(a>b) { t=a,a=b,b=t; } if(a>c) { t原创 2013-03-12 08:10:58 · 875 阅读 · 0 评论 -
杭电1163
#include int main (void){ int n,i,s,d; while(scanf("%d",&n)!=EOF,n) { s=1; for(i=0;in;i++) { s*=n; while(s>9) {原创 2013-03-11 22:06:18 · 888 阅读 · 0 评论 -
杭电2014
#include int main (void){ int n,i,j; float a[100],x; while(scanf("%d",&n)!=EOF) { for(i=0;in;i++) scanf("%f",&a[i]); for(i=0;in;i++) //排序从小到大原创 2013-04-21 09:47:57 · 1373 阅读 · 0 评论 -
杭电2017
#include #include int main (void){ int n,i,j,k,s; char a[10000]; scanf("%d",&n); for(i=0;in;i++) { s=0; scanf("%s",a); j=strlen(a); for(k=0;kj;k+原创 2013-04-21 10:10:45 · 1265 阅读 · 0 评论 -
hunnu-11546--Sum of f(x)
Sum of f(x)Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KBTotal submit users: 194, Accepted users: 115Problem 11546 : No special judgementProblem descriptio原创 2015-06-08 21:32:45 · 510 阅读 · 0 评论 -
hunnu--11543--小明的烦恼——分糖果
小明的烦恼——分糖果Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KBTotal submit users: 278, Accepted users: 236Problem 11543 : No special judgementProblem description原创 2015-06-08 21:11:07 · 850 阅读 · 0 评论 -
HDU--4891--The Great Pan--暴力搜索
The Great PanTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 827 Accepted Submission(s): 292Problem DescriptionAs a programmi原创 2014-07-30 17:57:51 · 936 阅读 · 0 评论 -
HDU--杭电--2304--Electrical Outlets--水题
Electrical OutletsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1391 Accepted Submission(s): 1241Problem DescriptionRoy h原创 2013-12-05 00:25:46 · 779 阅读 · 0 评论 -
HDU--杭电--2103--Family planning--水题
Family planningTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6645 Accepted Submission(s): 1709Problem DescriptionAs far as原创 2013-12-05 00:13:16 · 1070 阅读 · 0 评论 -
HDU--杭电--2076--夹角有多大(题目已修改,注意读题)--水题
夹角有多大(题目已修改,注意读题)Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7706 Accepted Submission(s): 3069Problem Description时间过的好快,一原创 2013-12-05 00:28:36 · 1543 阅读 · 0 评论 -
HDU--杭电--2107--Founding of HDU--水题
Founding of HDUTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5788 Accepted Submission(s): 3917Problem Description经过慎重的考虑,XH原创 2013-12-05 00:14:51 · 843 阅读 · 0 评论 -
HDU--杭电--2105--The Center of Gravity--数学题,求三角形重心
The Center of GravityTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3775 Accepted Submission(s): 2142Problem DescriptionEver原创 2013-12-04 23:31:10 · 1162 阅读 · 0 评论 -
HDU--杭电--2078--复习时间--水题
复习时间Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3688 Accepted Submission(s): 2760Problem Description为了能过个好年,xhd开始复习了,于是每天晚上背着书往教室跑。xh原创 2013-11-13 00:38:44 · 990 阅读 · 0 评论 -
HDU--杭电--1711--Number Sequence--KMP--水题,看毛片算法基础死方法运用
Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8126 Accepted Submission(s): 3688Problem DescriptionGiven two s原创 2013-07-29 10:51:25 · 2432 阅读 · 0 评论 -
HDU--杭电--3336--Count the string--KMP--说是KMP,实际我是用的滑动取值,别人教的
Count the stringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3108 Accepted Submission(s): 1449Problem DescriptionIt is well原创 2013-07-29 10:48:40 · 1289 阅读 · 3 评论 -
HDU--杭电--3746--Cyclic Nacklace--KMP--next值的应用
Cyclic NacklaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1840 Accepted Submission(s): 811Problem DescriptionCC always bec原创 2013-07-29 10:32:13 · 932 阅读 · 0 评论 -
HDU--杭电--1686--Oulipo--KMP--水题
OulipoTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3459 Accepted Submission(s): 1351Problem DescriptionThe French author Geo原创 2013-07-29 10:44:04 · 972 阅读 · 0 评论 -
HDU--杭电--1358--Period--KMP--next值的应用
PeriodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1959 Accepted Submission(s): 961Problem DescriptionFor each prefix of a g原创 2013-07-29 10:28:55 · 1221 阅读 · 0 评论 -
HDU--杭电--3415--Max Sum of Max-K-sub-sequence--暴力或单调队列
Max Sum of Max-K-sub-sequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4913 Accepted Submission(s): 1791Problem Description原创 2013-07-29 09:55:21 · 991 阅读 · 0 评论 -
杭电2001
#include #include int main (void){ double a,b,c,d; while(scanf("%lf%lf%lf%lf",&a,&b,&c,&d)!=EOF) { printf("%.2lf\n",sqrt(pow(a-c,2)+pow(b-d,2))); } return 0;}原创 2013-03-12 08:11:23 · 818 阅读 · 0 评论 -
杭电1157
#include int main (void){ int n,a[10005],i,j,k; while(scanf("%d",&n)!=EOF) { for(i=0;in;i++) { scanf("%d",&a[i]); for(j=0;ji;j++) if(a原创 2013-03-11 22:05:35 · 770 阅读 · 0 评论 -
杭电2003
#include #include int main (void){ double r; while(scanf("%lf",&r)!=EOF) { printf("%.2lf\n",fabs(r)); } return 0;}原创 2013-03-12 08:12:33 · 1079 阅读 · 0 评论 -
杭电1040
#include int main (void){ int n,m,a[1005],i,j,t; scanf("%d",&n); while(n--&&scanf("%d",&m)!=EOF) { for(i=0;i scanf("%d",&a[i]); for(i=0;i fo原创 2013-03-06 23:54:09 · 920 阅读 · 0 评论 -
杭电1037
#include int main (void){ int a[3],i,k; while(scanf("%d%d%d",&a[0],&a[1],&a[2])!=EOF) { k=1; for(i=0;i if(a[i] { printf("CRASH %d\n"原创 2013-03-05 13:21:54 · 744 阅读 · 0 评论 -
杭电1019
#include int main (void){ int n,m,a,s,i; scanf("%d",&n); while(n--) { s=0; scanf("%d",&m); while(m--) { scanf("%d",&a);原创 2013-03-05 13:19:36 · 783 阅读 · 0 评论 -
杭电1029
#include int a[1000000];int main (void){ int n,i,j,k; while(scanf("%d",&n)!=EOF) { for(i=0;i scanf("%d",&a[i]); if(1==n) { printf(原创 2013-03-05 13:21:22 · 799 阅读 · 0 评论