随笔分类 -  STL

HDU 4666 Hyperspace （最远曼哈顿距离）
摘要：HyperspaceTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 314Accepted Submission(s): 155Problem DescriptionThe great Mr.Smith has invented a hyperspace particle generator. The device is very powerful. The device can generate a hyperspace. In the 阅读全文
posted @ 2013-08-14 08:31 Jack Ge 阅读(914) 评论(0) 推荐(0) 编辑
HDU 4585 Shaolin （STL）
摘要：ShaolinTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 315Accepted Submission(s): 162Problem DescriptionShaolin temple is very famous for its Kongfu monks.A lot of young men go to Shaolin temple every year, trying to be a monk there. The master of 阅读全文
posted @ 2013-08-11 09:58 Jack Ge 阅读(543) 评论(0) 推荐(0) 编辑
HDU 4302 Holedox Eating （STL + 模拟）
摘要：Holedox EatingTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2862Accepted Submission(s): 952Problem DescriptionHoledox is a small animal which can be considered as one point. It lives in a straight pipe whose length is L. Holedox can only move alo 阅读全文
posted @ 2013-08-04 14:42 Jack Ge 阅读(254) 评论(0) 推荐(0) 编辑
POJ 3096 Surprising Strings
摘要：Surprising StringsTime Limit:1000MSMemory Limit:65536KTotal Submissions:5081Accepted:3336DescriptionTheD-pairsof a string of letters are the ordered pairs of letters that are distance D from each other. A string isD-uniqueif all of its D-pairs are different. A string issurprisingif it is D-unique fo 阅读全文
posted @ 2013-06-19 09:37 Jack Ge 阅读(298) 评论(0) 推荐(0) 编辑
POJ 3295 Tautology （构造法）
摘要：TautologyTime Limit:1000MSMemory Limit:65536KTotal Submissions:7716Accepted:2935DescriptionWFF 'N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N, C, E, p, q, r, s, t. A Well-formed formula (WFF) is any string of these symbo 阅读全文
posted @ 2013-06-17 19:00 Jack Ge 阅读(494) 评论(0) 推荐(0) 编辑
HDU 1716 排列2
摘要：排列2Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3107Accepted Submission(s): 1220Problem DescriptionRay又对数字的列产生了兴趣：现有四张卡片，用这四张卡片能排列出很多不同的4位数，要求按从小到大的顺序输出这些4位数。Input每组数据占一行，代表四张卡片上的数字（0<=数字<=9），如果四张卡片都是0，则输入结束。Output对每组卡片按从小到大的顺序输出所有能由这四张卡片组 阅读全文
posted @ 2013-05-22 16:53 Jack Ge 阅读(4024) 评论(0) 推荐(0) 编辑
HDU Football Score
摘要：Football ScoreTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14Accepted Submission(s): 3Problem DescriptionFootball is one of the greatest games in the world. Lots of people like to play football. After one season of matches, the header has to ca 阅读全文
posted @ 2013-03-19 20:40 Jack Ge 阅读(548) 评论(0) 推荐(0) 编辑
HDU 2072 单词数
摘要：单词数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 阅读(218) 评论(0) 推荐(0) 编辑
HDU 2094 产生冠军
摘要：产生冠军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 阅读(250) 评论(0) 推荐(1) 编辑
SDUT 2538 Lucky Transformation
摘要：---恢复内容开始---Lucky Transformationhttp://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2538Time Limit: 1000MS Memory limit: 65536K题目描述ZYJ非常喜欢幸运数字4，和7，他认为只要是只含有4和7的数字就是幸运的。比如，4,47，4477,7都是幸运的，427就不是。 现在有一个n位没有前导零的数字d，从最高位认为是第一位。ZYJ想看看这个数字能否经得起变化.如果这个数字里面有一个连着的“47”，那么就做这样的操作：如果4的位数 阅读全文
posted @ 2013-01-01 15:54 Jack Ge 阅读(253) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示