09 2015 档案
(KMP Next的运用) Period II -- fzu -- 1901
摘要:http://acm.fzu.edu.cn/problem.php?pid=1901http://acm.hust.edu.cn/vjudge/contest/view.action?cid=70325#problem/QPeriod IITime Limit:1000MSMemory Limit:...
阅读全文
(字典树)How many--hdu--2609
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=2609How manyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(...
阅读全文
(KMP 最大表示最小表示)String Problem -- hdu-- 3374
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=3374String ProblemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submi...
阅读全文
(KMP 暴力)Corporate Identity -- hdu -- 2328
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=2328Corporate IdentityTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total S...
阅读全文
(KMP 扩展)Clairewd’s message -- hdu -- 4300
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=4300Clairewd’s messageTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total S...
阅读全文
(KMP 字符串处理)Substrings -- hdu -- 1238
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=1238SubstringsTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 1238...
阅读全文
(KMP)Count the string -- hdu -- 3336
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=3336Count the stringTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Sub...
阅读全文
(KMP)Simpsons’ Hidden Talents -- hdu -- 2594
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=2594Simpsons’ Hidden TalentsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)T...
阅读全文
(并查集)Travel -- hdu -- 5441(2015 ACM/ICPC Asia Regional Changchun Online )
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=5441 Travel Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submissi
阅读全文
(KMP)Seek the Name, Seek the Fame -- poj --2752
摘要:http://poj.org/problem?id=2752Seek the Name, Seek the FameTime Limit:2000MSMemory Limit:65536KTotal Submissions:14611Accepted:7320DescriptionThe littl...
阅读全文
(KMP 求循环节)The Minimum Length
摘要:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=70325#problem/FThe Minimum LengthTime Limit:1000MSMemory Limit:131072KB64bit IO Format:%lld & %l...
阅读全文
(KMP 根据循环节来计算)Period -- hdu -- 1358
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=1358PeriodTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s)...
阅读全文
(KMP扩展 利用循环节来计算) Cyclic Nacklace -- hdu -- 3746
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=3746Cyclic NacklaceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Subm...
阅读全文
(二叉树)Elven Postman -- HDU -- 54444(2015 ACM/ICPC Asia Regional Changchun Online)
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=5444 Elven Postman Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total S
阅读全文
(KMP)剪花布条 -- hdu -- 2087
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=2087剪花布条Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): ...
阅读全文
(KMP)Oulipo -- poj --3461
摘要:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=92486#problem/Bhttp://poj.org/problem?id=3461OulipoTime Limit:1000MSMemory Limit:32768KB64bit IO...
阅读全文
(KMP 模板)Number Sequence -- Hdu -- 1711
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=1711Number SequenceTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Sub...
阅读全文
( KMP 求循环节的个数)Power Strings -- poj -- 2406
摘要:链接:http://poj.org/problem?id=2406Power StringsTime Limit:3000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionGiven two strin...
阅读全文
(矩阵快速幂) Fibonacci -- poj -- 3070
摘要:链接:http://poj.org/problem?id=3070FibonacciTime Limit:1000MSMemory Limit:65536KTotal Submissions:11236Accepted:7991DescriptionIn the Fibonacci integer ...
阅读全文
(字符串处理)Fang Fang -- hdu -- 5455 (2015 ACM/ICPC Asia Regional Shenyang Online)
摘要:链接: http://acm.hdu.edu.cn/showproblem.php?pid=5455 Fang Fang Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Sub
阅读全文
(线段树 区间查询)The Water Problem -- hdu -- 5443 (2015 ACM/ICPC Asia Regional Changchun Online)
摘要:链接: http://acm.hdu.edu.cn/showproblem.php?pid=5443 The Water Problem Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others
阅读全文
(最短路 spfa)Wormholes -- poj -- 3259
摘要:http://poj.org/problem?id=3259WormholesTime Limit:2000MSMemory Limit:65536KTotal Submissions:37356Accepted:13734DescriptionWhile exploring his many fa...
阅读全文
(水题) Div 3 -- SGU -- 105
摘要:链接:http://vj.acmclub.cn/contest/view.action?cid=168#problem/E时限:250MS内存:4096KB64位IO格式:%I64d & %I64u提交状态练习SGU 105问题描述There is sequence 1, 12, 123, 1234...
阅读全文
(水题)987654321 problem -- SGU 107
摘要:链接:http://vj.acmclub.cn/contest/view.action?cid=168#problem/G时限:250MS内存:4096KB64位IO格式:%I64d & %I64u提交状态练习SGU 107问题描述For given number N you must output...
阅读全文
(最短路 dijkstra)昂贵的聘礼 -- poj -- 1062
摘要:链接:http://poj.org/problem?id=1062昂贵的聘礼Time Limit:1000MSMemory Limit:10000KTotal Submissions:41359Accepted:12076Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿...
阅读全文
(欧拉公式 很水) Coprimes -- sgu -- 1002
摘要:链接:http://vj.acmclub.cn/contest/view.action?cid=168#problem/BCoprimes时限:250MS内存:4096KB64位IO格式:%I64d & %I64u状态练习SGU 102问题描述For given integer N (1#inclu...
阅读全文
(广搜) Find a way -- hdu -- 2612
摘要:链接:http://acm.hdu.edu.cn/showproblem.php?pid=2612Find a wayTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submis...
阅读全文
(广搜)可口可乐 -- hdu -- 1495
摘要:链接:http://acm.hdu.edu.cn/showproblem.php?pid=1495Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7...
阅读全文
(网络流)Food -- hdu -- 4292
摘要:链接:http://acm.hdu.edu.cn/showproblem.php?pid=4292FoodTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s...
阅读全文
(并查集 带关系)Find them, Catch them -- poj -- 1703
摘要:链接:http://poj.org/problem?id=1703Time Limit:1000MSMemory Limit:10000KTotal Submissions:36768Accepted:11294DescriptionThe police office in Tadu City de...
阅读全文
(最短路 SPFA)Currency Exchange -- poj -- 1860
摘要:链接:http://poj.org/problem?id=1860Time Limit:1000MSMemory Limit:30000KTotal Submissions:23261Accepted:8419DescriptionSeveral currency exchange points a...
阅读全文
(最小生成树)Eddy's picture -- hdu -- 1162
摘要:链接:http://acm.hdu.edu.cn/showproblem.php?pid=1162Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8...
阅读全文
(二分搜索)Can you solve this equation? -- hdu -- 2199
摘要:链接:http://acm.hdu.edu.cn/showproblem.php?pid=2199Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1...
阅读全文
(简单的物理题)Bungee Jumping
摘要:链接:http://acm.hdu.edu.cn/showproblem.php?pid=1155Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7...
阅读全文
(广搜)Catch That Cow -- poj -- 3278
摘要:链接:http://poj.org/problem?id=3278Time Limit:2000MSMemory Limit:65536KTotal Submissions:62113Accepted:19441DescriptionFarmer John has been informed of ...
阅读全文
(广搜)Dungeon Master -- poj -- 2251
摘要:链接:http://poj.org/problem?id=2251Time Limit:1000MSMemory Limit:65536KTotal Submissions:21370Accepted:8299DescriptionYou are trapped in a 3D dungeon an...
阅读全文
(深搜)棋盘问题 -- poj -- 1321
摘要:链接:http://poj.org/problem?id=1321Time Limit:1000MSMemory Limit:10000KTotal Submissions:28899Accepted:14307Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区...
阅读全文
Max Sum -- hdu -- 1003
摘要:链接:http://acm.hdu.edu.cn/showproblem.php?pid=1003Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1...
阅读全文
(深搜)Oil Deposits -- hdu -- 1241
摘要:链接:http://acm.hdu.edu.cn/showproblem.php?pid=1241Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1...
阅读全文
(博弈 sg入门2)
摘要:接下来介绍Nim游戏(同样引用杭电上的,懒的打字)1.有两个玩家;2.有三堆扑克牌(比如:可以分别是5,7,9张);3.游戏双方轮流操作;4.玩家的每次操作是选择其中某一堆牌,然后从中取走任意张;5.最后一次取牌的一方为获胜方;想一会:还记得刚才说的P点和N点吗?P:必败点,N:必胜点先给出结论,这...
阅读全文
(博弈 sg入门)kiki's game -- hdu -- 2147
摘要:链接:http://acm.hdu.edu.cn/showproblem.php?pid=2147题意:在一个n*m的棋盘上,从(1,m),即右上角开始向左下角走。下棋者只能往左边(left),左下面(left-underneath),下面(underneath),这三个方格下棋。最后不能移动的人算...
阅读全文
(巴什博弈 sg函数入门1) Brave Game -- hdu -- 1846
摘要:链接:http://acm.hdu.edu.cn/showproblem.php?pid=1846首先来玩个游戏,引用杭电课件上的:(1)玩家:2人;(2)道具:23张扑克牌;(3)规则:游戏双方轮流取牌;每人每次仅限于取1张、2张或3张牌;扑克牌取光,则游戏结束;最后取牌的一方为胜者。想一下。。首...
阅读全文
(全排列)Ignatius and the Princess II -- HDU -- 1027
摘要:链接:http://acm.hdu.edu.cn/showproblem.php?pid=1027Ignatius and the Princess IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/O...
阅读全文
浙公网安备 33010602011771号