随笔分类 -  数学题+水题

摘要：E. Mishap in Clubtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarpus just has been out of luck lately! As soon as he found a job in the "Binary Cat" cafe, the club got burgled. All ice-cream was stolen.On the burglary night Polyc 阅读全文

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=1200水题。View Code 1 #include <stdio.h> 2 #include <stdlib.h> 3 #include<string.h> 4 5 int main() 6 { 7 int n,i,len; 8 char str[210]; 9 while(~scanf("%d",&n),n)10 {11 //getchar();12 scanf("%s",str);13 len=strlen(... 阅读全文

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=1128水题，哎，水题也贴一个吧。。。注意和可能会超过1000000.View Code 1 #include <stdio.h> 2 #include <stdlib.h> 3 int hash[1000070]={0}; 4 int main() 5 { 6 int i,temp,sum; 7 8 for(i=1;i<=1000000;i++) 9 {10 sum=i;11 temp=i;12 while(temp)13... 阅读全文

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=1031水题不解释，之前看错题意。View Code 1 #include <stdio.h> 2 #include <stdlib.h> 3 #include<string.h> 4 struct Node 5 { 6 int number; 7 double satisfy; 8 }node[1010]; 9 int cmp1(const void*x,const void*y)10 {11 struct Node *aa=(struct Node*)x;12 ... 阅读全文

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=4386QuadrilateralTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 937Accepted Submission(s): 421Problem Description One day the little Jack is playing a game with four crabsticks. The game is simple, he wan. 阅读全文

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=1410PK武林盟主Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 704Accepted Submission(s): 155Problem Description枫之羽认为自己很强，想当武林盟主，于是找现任武林盟主氢氧化铜挑战。氢氧化铜欣然接受了挑战，两人约好于下个月的月圆之夜在HDU校园内的三根柱子上进行决战。这场PK赛肯定能吸引武林中所有人前来观战，所以 阅读全文

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=1204糖果大战Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1324Accepted Submission(s): 408Problem Description生日Party结束的那天晚上，剩下了一些糖果，Gandon想把所有的都统统拿走，Speakless于是说：“可以是可以，不过我们来玩24点，你不是已经拿到了一些糖果了吗？这样，如果谁赢一局，就拿走对方 阅读全文

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=1155Problem DescriptionOnce again, James Bond is fleeing from some evil people who want to see him dead. Fortunately, he has left a bungee rope on a nearby highway bridge which he can use to escape from his enemies. His plan is to attach one end of the rope 阅读全文

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=1205水题一枚，糊里糊涂就过了！！View Code 1 #include<stdio.h> 2 int main() 3 { 4 int t; 5 int n; 6 int x,max,sum; 7 scanf("%d",&t); 8 while(t--) 9 {10 max=0;11 sum=0;12 scanf("%d",&n);13 for(int i=0;i<n;i++)14 ... 阅读全文

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=1999思路：列举1000000能组成的所有数，1000以内最后一个素数是997，s（998*998）=998+1,998*998=996004.。。 阅读全文