- 博客(10)
- 资源 (2)
- 收藏
- 关注
原创 2013多校联合3 G The Unsolvable Problem(hdu 4627)
The Unsolvable ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 230 Accepted Submission(s): 136Problem DescriptionThere
2013-07-30 20:35:47 1733
原创 2013多校联合3 1010 No Pain No Game(hdu 4630)
http://acm.hdu.edu.cn/showproblem.php?pid=4630No Pain No GameTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 72 Accepted Submis
2013-07-30 20:09:06 1779 2
原创 2013多校联合 3 B Reincarnation (hdu 4622)
http://acm.hdu.edu.cn/showproblem.php?pid=4622ReincarnationTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 92 Accepted Submi
2013-07-30 19:39:35 7385 5
原创 2013 多校联合 2 A Balls Rearrangement (hdu 4611)
Balls RearrangementTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 322 Accepted Submission(s): 114Problem Description Bob h
2013-07-25 22:38:14 1966
原创 2013 多校联合2 D Vases and Flowers (hdu 4614)
Vases and FlowersTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 347 Accepted Submission(s): 108Problem Description Alice i
2013-07-25 21:53:35 1245
原创 2013多校联合2 I Warm up 2(hdu 4619)
Warm up 2Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 243 Accepted Submission(s): 108Problem Description Some 1×2 dominoes are
2013-07-25 21:38:33 1245
原创 2013 多校联合 F Magic Ball Game (hdu 4605)
http://acm.hdu.edu.cn/showproblem.php?pid=4605Magic Ball GameTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 309 Accepted Subm
2013-07-24 16:03:31 1360
原创 2013 多校联合 H Park Visit (hdu 4607)
http://acm.hdu.edu.cn/showproblem.php?pid=4607Park VisitProblem DescriptionClaire and her little friend, ykwd, are travelling in Shevchenko's Park! The park is beautiful - but large, ind
2013-07-23 21:55:03 1016
原创 2013 多校联合 I I-number(hdu 4608)
http://acm.hdu.edu.cn/showproblem.php?pid=4608I-numberThe I-number of x is defined to be an integer y, which satisfied the the conditions below:1. y>x;2. the sum of each digit of y(und
2013-07-23 21:35:41 1202
原创 2013 多校联合 C Partition (hdu 4602)
http://acm.hdu.edu.cn/showproblem.php?pid=4602PartitionDefine f(n) as the number of ways to perform n in format of the sum of some positive integers. For instance, when n=4, we have 4=1+1+1
2013-07-23 21:30:26 1603
计算机程序设计艺术卷1.pdf
2011-10-23
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人