摘要: Max Factorhttp://acm.hdu.edu.cn/showproblem.php?pid=2710Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2412 Accepted Submission(s): 734 Problem DescriptionTo improve the organization of his farm, Farmer John labels each of his N (1 <= N <= 阅读全文
posted @ 2012-12-28 11:00 Jack Ge 阅读(692) 评论(0) 推荐(0) 编辑
摘要: Huntershttp://acm.hdu.edu.cn/showproblem.php?pid=4438Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 382 Accepted Submission(s): 281 Problem DescriptionAlice and Bob are the topmost hunters in the forest, so no preys can escape from them. However 阅读全文
posted @ 2012-12-27 11:56 Jack Ge 阅读(361) 评论(0) 推荐(0) 编辑
摘要: Sum of divisorshttp://acm.hdu.edu.cn/showproblem.php?pid=4432Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 875 Accepted Submission(s): 342 Problem Descriptionmmm is learning division, she's so proud of herself that she can figure out the su 阅读全文
posted @ 2012-12-27 11:12 Jack Ge 阅读(218) 评论(0) 推荐(0) 编辑
摘要: Online Judgehttp://www.cnblogs.com/kuangbin/archive/2012/10/28/2743788.htmlTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3589 Accepted Submission(s): 1349 Problem DescriptionIgnatius is building an Online Judge, now he has worked out all the pr 阅读全文
posted @ 2012-12-27 10:48 Jack Ge 阅读(329) 评论(0) 推荐(0) 编辑
摘要: Dressinghttp://acm.hdu.edu.cn/showproblem.php?pid=4451Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1112 Accepted Submission(s): 471 Problem DescriptionWangpeng has N clothes, M pants and K shoes so theoretically he can have N×M×K dif 阅读全文
posted @ 2012-12-26 23:08 Jack Ge 阅读(363) 评论(0) 推荐(0) 编辑
摘要: Integer Inquiryhttp://acm.hdu.edu.cn/showproblem.php?pid=1047Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7564 Accepted Submission(s): 1961 Problem DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He extended h 阅读全文
posted @ 2012-12-26 19:03 Jack Ge 阅读(317) 评论(0) 推荐(0) 编辑
摘要: N!http://acm.hdu.edu.cn/showproblem.php?pid=1042Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 37977 Accepted Submission(s): 10555 Problem DescriptionGiven an integer N(0 ≤ N ≤ 10000), your task is to calculate N!InputOne N in one line, process 阅读全文
posted @ 2012-12-26 16:55 Jack Ge 阅读(382) 评论(0) 推荐(0) 编辑
摘要: A + B Problem IIhttp://acm.hdu.edu.cn/showproblem.php?pid=1002Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 137421 Accepted Submission(s): 26074 Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to 阅读全文
posted @ 2012-12-26 16:37 Jack Ge 阅读(436) 评论(0) 推荐(0) 编辑
摘要: Biorhythmshttp://poj.org/problem?id=1006Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 97029Accepted: 29832DescriptionSome people believe that there are three cycles in a person's life that start the day he or she is born. These three cycles are the physical, emotional, and intellectua 阅读全文
posted @ 2012-12-26 13:24 Jack Ge 阅读(316) 评论(0) 推荐(0) 编辑
摘要: 初期: 一.基本算法: (1)枚举. (poj1753,poj2965) (2)贪心(poj1328,poj2109,poj2586) (3)递归和分治法. (4)递推. (5)构造法.(poj3295) (6)模拟法.(poj1068,poj2632,poj1573,poj2993,poj2996)二.图算法: (1)图的深度优先遍历和广度优先遍历. (2)最短路径算法 (dijkstra,bellman-ford,floyd,heap+dijkstra) (poj1860,poj3259,poj1062,poj2253,poj1125,poj2240) (3)最小生成树算法(prim,k. 阅读全文
posted @ 2012-12-25 22:53 Jack Ge 阅读(945) 评论(0) 推荐(0) 编辑