摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=1030Delta-waveTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submissi... 阅读全文
posted @ 2015-09-08 17:01
午夜阳光~
阅读(206)
评论(0)
推荐(0)
摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=1199Color the BallTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Subm... 阅读全文
posted @ 2015-09-06 20:39
午夜阳光~
阅读(220)
评论(0)
推荐(0)
摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=2084数塔Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 28... 阅读全文
posted @ 2015-09-06 15:30
午夜阳光~
阅读(215)
评论(0)
推荐(0)
摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=1084What Is Your Grade?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total ... 阅读全文
posted @ 2015-09-06 13:01
午夜阳光~
阅读(298)
评论(0)
推荐(0)
摘要：
http://acm.hdu.edu.cn/howproblem.php?pid=2199Can you solve this equation?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Other... 阅读全文
posted @ 2015-09-03 22:16
午夜阳光~
阅读(175)
评论(0)
推荐(0)
摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=1176免费馅饼Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): ... 阅读全文
posted @ 2015-09-03 08:14
午夜阳光~
阅读(119)
评论(0)
推荐(0)
摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=5310题目大意：要买n个纪念品，可以单个买p元每个，可以成套买q元一套，每套有m个，求最少花费#include#include#include#include#define N 110using namespace... 阅读全文
posted @ 2015-09-02 12:48
午夜阳光~
阅读(180)
评论(1)
推荐(0)
摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=5311Hidden StringTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others)Total Subm... 阅读全文
posted @ 2015-09-01 13:24
午夜阳光~
阅读(130)
评论(0)
推荐(0)
摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=2899Strange fuctionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Subm... 阅读全文
posted @ 2015-08-31 20:14
午夜阳光~
阅读(187)
评论(0)
推荐(0)
摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=5424哈密顿通路：联通的图，访问每个顶点的路径且只访问一次n个点n条边n个顶点有n - 1条边，最后一条边的连接情况：(1)自环（这里不需要考虑)；(2)最后一条边将首和尾连接，这样每个点的度都为2；(3)最后一条... 阅读全文
posted @ 2015-08-31 17:45
午夜阳光~
阅读(165)
评论(0)
推荐(0)
浙公网安备 33010602011771号