上一页 1 ··· 46 47 48 49 50 51 52 53 54 ··· 56 下一页
摘要: Jury Compromisehttp://poj.org/problem?id=1015Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 22094Accepted: 5670Special JudgeDescriptionIn Frobnia, a far-away country, the verdicts in court trials are determined by a jury consisting of members of the general public. Every time a trial is se 阅读全文
posted @ 2013-01-09 15:48 Jack Ge 阅读(365) 评论(0) 推荐(0) 编辑
摘要: Maximum sumhttp://poj.org/problem?id=2479Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 28485Accepted: 8713DescriptionGiven a set of n integers: A={a1, a2,..., an}, we define a function d(A) as below:Your task is to calculate d(A).InputThe input consists of T(#include#includeusing namespac 阅读全文
posted @ 2013-01-09 09:39 Jack Ge 阅读(308) 评论(0) 推荐(0) 编辑
摘要: 单词数http://acm.hdu.edu.cn/showproblem.php?pid=2072Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 18418 Accepted Submission(s): 4573 Problem Descriptionlily的好朋友xiaoou333最近很空,他想了一件没有什么意义的事情,就是统计一篇文章里不同单词的总数。下面你的任务是帮助xiaoou333解决这个问题。Input有多组数据,每组一行, 阅读全文
posted @ 2013-01-08 23:10 Jack Ge 阅读(212) 评论(0) 推荐(0) 编辑
摘要: 产生冠军http://acm.hdu.edu.cn/showproblem.php?pid=2094Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5538 Accepted Submission(s): 2631 Problem Description有一群人,打乒乓球比赛,两两捉对撕杀,每两个人之间最多打一场比赛。 球赛的规则如下: 如果A打败了B,B又打败了C,而A与C之间没有进行过比赛,那么就认定,A一定能打败C。 如果A打败了B, 阅读全文
posted @ 2013-01-08 22:13 Jack Ge 阅读(246) 评论(0) 推荐(1) 编辑
摘要: Fibonaccihttp://acm.hdu.edu.cn/showproblem.php?pid=1568Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2292Accepted Submission(s): 1075Problem Description2007年到来了。经过2006年一年的修炼,数学神童zouyu终于把0到100000000的Fibonacci数列(f[0]=0,f[1]=1;f[i] = f[i-1]+f[i-2](i 阅读全文
posted @ 2013-01-08 12:24 Jack Ge 阅读(186) 评论(0) 推荐(0) 编辑
摘要: Gone Fishinghttp://poj.org/problem?id=1042Time Limit: 2000MSMemory Limit: 32768KTotal Submissions: 25233Accepted: 7423DescriptionJohn is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25) all reachable along a single, one-wa 阅读全文
posted @ 2013-01-06 16:14 Jack Ge 阅读(428) 评论(0) 推荐(0) 编辑
摘要: Just a Hookhttp://acm.hdu.edu.cn/showproblem.php?pid=1698Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10448 Accepted Submission(s): 5161 Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of 阅读全文
posted @ 2013-01-06 10:44 Jack Ge 阅读(223) 评论(0) 推荐(0) 编辑
摘要: Billboardhttp://acm.hdu.edu.cn/showproblem.php?pid=2795Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5633 Accepted Submission(s): 2580 Problem DescriptionAt the entrance to the university, there is a huge rectangular billboard of size h*w (h i 阅读全文
posted @ 2013-01-06 10:22 Jack Ge 阅读(208) 评论(0) 推荐(0) 编辑
摘要: Advanced Fruitshttp://acm.hdu.edu.cn/showproblem.php?pid=1503Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 977 Accepted Submission(s): 466Special JudgeProblem DescriptionThe company "21st Century Fruits" has specialized in creating new 阅读全文
posted @ 2013-01-05 21:27 Jack Ge 阅读(432) 评论(0) 推荐(0) 编辑
摘要: Periodhttp://acm.hdu.edu.cn/showproblem.php?pid=1358Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1537 Accepted Submission(s): 742 Problem DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code betwee 阅读全文
posted @ 2013-01-05 16:07 Jack Ge 阅读(428) 评论(0) 推荐(0) 编辑
上一页 1 ··· 46 47 48 49 50 51 52 53 54 ··· 56 下一页