poj代码
亿念之茶
I'm a newbie,but i believe i could fly one day!
展开
-
杂码之纸老虎:Celebrity jeopardy POJ 3062
/*Celebrity jeopardyTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionIt's hard to construct a problem that's so easy that everyone will原创 2014-08-19 15:08:27 · 601 阅读 · 1 评论 -
poj 2250 Compromise(最长公共子序列)
CompromiseTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6641 Accepted: 2969 Special Judgehttp://poj.org/problem?id=2250DescriptionIn a few m原创 2014-12-14 00:09:10 · 410 阅读 · 0 评论 -
poj 2418 Hardwood Species(二叉排序树)
Hardwood SpeciesTime Limit: 10000MSMemory Limit: 65536KTotal Submissions: 19428Accepted: 7658http://poj.org/problem?id=2418DescriptionHardwoods are the bo原创 2014-12-18 21:10:54 · 538 阅读 · 0 评论 -
poj 3620 Avoid The Lakes(DFS)
Avoid The LakesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7034 Accepted: 3740点击打开链接DescriptionFarmer John's farm was flooded in the most recent原创 2015-08-08 08:23:45 · 475 阅读 · 0 评论 -
poj 2352 Stars(线段树||树状数组)
StarsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 36881 Accepted: 16056点击打开链接DescriptionAstronomers often examine star maps where stars are rep原创 2015-07-29 12:00:33 · 406 阅读 · 0 评论 -
LightOj 1112 Curious Robin Hood(线段树||树状数组)
Curious Robin HoodRobin Hood likes to loot rich people since he helps the poor people with this money. Instead of keeping all the money together he does another trick. He keeps n sacks where h原创 2015-08-17 17:49:58 · 827 阅读 · 0 评论 -
poj 3468 A Simple Problem with Integers(线段树 [区间更新])
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 78109 Accepted: 24051Case Time Limit: 2000MS点击打开链接DescriptionYo原创 2015-08-17 18:38:44 · 496 阅读 · 0 评论 -
poj 3984 迷宫问题(BFS+回溯)
迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11256 Accepted: 6733点击打开链接Description定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0原创 2015-08-06 17:11:19 · 1698 阅读 · 0 评论 -
poj 1458 Common Subsequence(最长公共子序列)
Common SubsequenceTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 39667Accepted: 15954http://poj.org/problem?id=1458DescriptionA subsequence of a g原创 2014-12-13 23:40:33 · 397 阅读 · 0 评论 -
poj 2251 Dungeon Master(BFS三维)
Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20912 Accepted: 8106点击打开链接DescriptionYou are trapped in a 3D dungeon and need to fin原创 2015-08-06 15:44:01 · 574 阅读 · 0 评论 -
poj 3278 Catch That Cow(BFS)
Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 61200 Accepted: 19106DescriptionFarmer John has been informed of the location of a fugitiv原创 2015-08-06 10:20:49 · 526 阅读 · 0 评论 -
递归及递推问题系列之 放苹果 poj 1664
/* 放苹果Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 26078 Accepted: 16587Description把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。Input第一行是测试数据的数原创 2014-08-20 18:46:42 · 545 阅读 · 0 评论 -
poj 1953 World Cup Noise[斐波那契数列](递归及递推问题系列)
/*World Cup NoiseTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15598 Accepted: 7691DescriptionBackground "KO-RE-A, KO-RE-A" shout 54.000 happy football fans after their tea原创 2014-08-20 20:26:26 · 533 阅读 · 0 评论 -
poj 1595 Prime Cuts(素数问题)
/*http://poj.org/problem?id=1595Prime CutsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10385 Accepted: 3975DescriptionA prime number is a counting number (1, 2, 3, ...)原创 2014-08-21 19:03:57 · 483 阅读 · 0 评论 -
分数加减法 poj 3979
分数加减法Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12238 Accepted: 4085 Description编写一个C程序,实现两个分数的加减法Input输入包含多行数据 每行数据是一个字符串,格式是"a/boc/d"。 其中a, b, c, d是一个0-9的整数。o是运算符"+原创 2014-08-02 09:22:43 · 458 阅读 · 0 评论 -
杂码之 Color Me Less POJ 1046
/*Color Me LessTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1046DescriptionA color reduction is a mapping from a set of原创 2014-08-19 14:57:04 · 384 阅读 · 0 评论 -
poj 2001 Shortest Prefixes(字典树 )
Shortest PrefixesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 14619 Accepted: 6310DescriptionA prefix of a string is a substring starting at the begi原创 2015-04-17 20:42:29 · 579 阅读 · 0 评论 -
poj 3630 Phone List (字典树)
Phone ListTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 24093Accepted: 7387DescriptionGiven a list of phone numbers, determine if it is consistent原创 2015-04-18 20:46:36 · 419 阅读 · 0 评论 -
poj 2503 Babelfish(字典树)
Babelfish点击打开链接Time Limit: 3000MSMemory Limit: 65536KTotal Submissions: 35059Accepted: 15002DescriptionYou have just moved from Waterloo to a big city. Th原创 2015-04-18 19:49:13 · 480 阅读 · 0 评论 -
poj 1159 Palindrome(最长公共子序列)
/*Palindromehttp://poj.org/problem?id=1159Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 53898 Accepted: 18618DescriptionA palindrome is a symmetrical string, that is,原创 2014-12-13 23:01:43 · 434 阅读 · 0 评论