acm之路--好题/陷阱
关注
分享
扫一扫
文章平均质量分 87
synapse7
这个作者很懒，什么都没留下…
展开
-
POJ 1068 Parencodings (字符串处理)
Parencodingshttp://poj.org/problem?id=1068Time Limit: 1000MSMemory Limit: 10000KDescriptionLet S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in t原创 2013-08-28 21:32:11 · 846 阅读 · 0 评论 -
World Finals 2004 / UVa 1030 Image Is Everything (想法题&迭代更新)
1030 - Image Is EverythingTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=3471Your new company is buildin原创 2013-09-01 20:58:39 · 1233 阅读 · 0 评论 -
UVa 11489 Integer Game (博弈&想法题)
11489 - Integer GameTime limit: 1.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=467&page=show_problem&problem=2484Two players, S and T, are playing原创 2013-09-12 00:39:01 · 1332 阅读 · 0 评论 -
UVa 278 Chess (想法题)
278 - ChessTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=467&page=show_problem&problem=214Almost everyone knows the problem of puttin原创 2013-09-13 09:55:49 · 1136 阅读 · 0 评论 -
UVa 696 How Many Knights (想法题)
696 - How Many KnightsTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=637The knight is a piece used in chess, a game played on a bo原创 2013-09-13 09:31:23 · 1485 阅读 · 0 评论 -
UVa 10025 The ? 1 ? 2 ? ... ? n = k problem (数学&想法题&常数算法)
10025 - The ? 1 ? 2 ? ... ? n = k problemTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=99&page=show_problem&problem=966The problem原创 2013-09-14 18:56:12 · 1350 阅读 · 0 评论 -
UVa 10916 Factstone Benchmark (数学&阶乘的处理技巧)
10916 - Factstone BenchmarkTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=99&page=show_problem&problem=1857Amtel has announced that it w原创 2013-09-15 14:01:54 · 1079 阅读 · 0 评论 -
UVa 340 Master-Mind Hints (优化查找&复制数组)
学英语：1. Match (i,j) is called strong when i =j, and is called weak otherwise.当i=j时，匹配(i,j)被叫做强匹配，反之叫做弱匹配。2. Two matches (i,j) and (p,q) are called independent when i = p if and only if j = q. A set of matches is called independent when all of its members原创 2013-09-30 00:22:56 · 1985 阅读 · 0 评论 -
UVa 10115 Automatic Editing (字符串中间替换技巧)
10115 - Automatic EditingTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=96&page=show_problem&problem=1056Text-processing tools like aw原创 2013-09-29 09:24:02 · 1360 阅读 · 0 评论 -
UVa 10229 Modular Fibonacci (矩阵快速幂求斐波那契)
10229 - Modular FibonacciTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=115&page=show_problem&problem=1170The Fibonacci numbers (0, 1,原创 2013-10-02 17:55:48 · 1547 阅读 · 0 评论 -
UVa 10137 The Trip (小数四舍五入&需要注意的地方)
10137 - The TripTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=29&page=show_problem&problem=1078A number of students are members of a club原创 2013-10-03 00:35:56 · 1761 阅读 · 0 评论 -
UVa 10127/POJ 2551 Ones (模运算&转换思想)
10127 - OnesTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=13&page=show_problem&problem=1068Given any integer 0 Sample input3 7 99原创 2013-08-09 20:31:36 · 1074 阅读 · 0 评论 -
UVa 507 Jill Rides Again (贪心&最大连续子串和)
507 - Jill Rides AgainTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=448Jill likes to ride her bicycle,原创 2013-09-19 00:18:25 · 1255 阅读 · 0 评论 -
UVa 108 Maximum Sum (贪心&最大子矩阵和)
108 - Maximum SumTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=44BackgroundA problem that is simple原创 2013-09-19 09:20:27 · 2671 阅读 · 0 评论 -
UVa 112 Tree Summing (scanf()去空格&递归&二叉树遍历)
112 - Tree SummingTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=48BackgroundLISP was one of the earliest high-le原创 2013-10-04 12:49:06 · 1472 阅读 · 0 评论 -
UVa 350 Pseudo-Random Numbers (伪随机数的循环长度)
350 - Pseudo-Random NumbersTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=100&page=show_problem&problem=286Computers normally cannot g原创 2013-10-01 10:41:00 · 1618 阅读 · 0 评论 -
UVa 10730 Antiarithmetic? (想法题)
10730 - Antiarithmetic?Time limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1671A permutation of n is a bijective function of the initia原创 2013-09-20 13:27:48 · 1665 阅读 · 0 评论 -
UVa 10827 Maximum sum on a torus (贪心&矩阵环中的最大子矩阵和)
10827 - Maximum sum on a torusTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1768A grid that wraps both h原创 2013-09-20 18:22:33 · 1020 阅读 · 0 评论 -
UVa 10061 How many zero's and how many digits ? (任意进制下的阶乘长度和尾0的数目)
10061 - How many zero's and how many digits ?Time limit: 20.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=100&page=show_problem&problem=1002Given原创 2013-10-01 14:28:04 · 1458 阅读 · 0 评论 -
4th IIUC Inter-University Programming Contest, 2005 / UVa 10905 Children's Game (等长转化技巧)
10905 - Children's GameTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=512&page=show_problem&problem=1846There are lots of number games原创 2013-09-02 13:16:55 · 1353 阅读 · 0 评论 -
HDU 1538 A Puzzle for Pirates (博弈&海盗分赃问题)
A Puzzle for Pirateshttp://acm.hdu.edu.cn/showproblem.php?pid=1538Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionA bunch原创 2013-10-04 13:09:06 · 1522 阅读 · 2 评论 -
UVa 562 Dividing coins (0-1背包&等价转化)
562 - Dividing coinsTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=503It's commonly known that the Dutch原创 2013-10-07 14:53:04 · 1251 阅读 · 0 评论 -
UVa 11538 Chess Queen (组合&分类)
11538 - Chess QueenTime limit: 2.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=469&page=show_problem&problem=2533You probably know how the game of原创 2013-10-09 09:23:56 · 862 阅读 · 0 评论 -
UVa 10673 Play with Floor and Ceil (数论)
10673 - Play with Floor and CeilTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=115&page=show_problem&problem=1614TheoremFor any tw原创 2013-09-25 18:24:23 · 875 阅读 · 0 评论 -
UVa 11078 Open Credit System (序列前后最大差)
11078 - Open Credit SystemTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=460&page=show_problem&problem=2019In an open credit system, t原创 2013-09-05 13:15:53 · 1014 阅读 · 0 评论 -
UVa 10881 Piotr's Ants (等价转化思想)
10881 - Piotr's AntsTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=1822"One thing is for certain原创 2013-09-01 16:41:41 · 858 阅读 · 0 评论 -
SEERC 2006 / UVa 1121 Subsequence (有和下界的最短连续子序列)
1121 - SubsequenceTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=460&page=show_problem&problem=3562A sequence of N positive integers (原创 2013-09-06 00:03:34 · 1233 阅读 · 0 评论 -
Dhaka 2003 / UVa 12050 - Palindrome Numbers (回文数)
12050 - Palindrome NumbersTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=467&page=show_problem&problem=3202A palindrome is a word, num原创 2013-09-10 23:35:42 · 1307 阅读 · 0 评论 -
Tokyo 2005 / UVa 1352 Colored Cubes (部分枚举&贪心)
1352 - Colored CubesTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=4098There are several colored cubes.原创 2013-09-04 18:01:26 · 1076 阅读 · 0 评论 -
NWERC 2006 / UVa 12097 Pie (二分法求精度)
12097 - PieTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=3249 My birthday is coming up and traditio原创 2013-09-03 19:22:19 · 1481 阅读 · 0 评论 -
UVa 11464 Even Parity (想法题&部分枚举)
11464 - Even ParityTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=2459We have a grid of size N x N. Each原创 2013-09-03 08:05:58 · 826 阅读 · 0 评论 -
UVa 10759 Dice Throwing (概率DP)
10759 - Dice ThrowingTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1700n common cubic dice are thrown. W原创 2013-10-02 21:44:01 · 1252 阅读 · 0 评论 -
UVa 1362 Exploring Pyramids (多叉树遍历&DP)
1362 - Exploring PyramidsTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=469&page=show_problem&problem=4108Archaeologists have discover原创 2013-10-13 09:37:09 · 1044 阅读 · 0 评论 -
UVa 11137 Ingenuous Cubrency (DP)
11137 - Ingenuous CubrencyTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2078People in Cubeland use cubic coins. Not on原创 2013-10-13 13:03:17 · 910 阅读 · 0 评论 -
Calgary Collegiate Programming Contest 2008 / UVa 11549 Calculator Conundrum (Floyd判圈算法&更快的优化)
11549 - Calculator ConundrumTime limit: 6.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=460&page=show_problem&problem=2544Alice got a hold of an ol原创 2013-09-05 14:16:15 · 1416 阅读 · 0 评论 -
UVa 10773 Back to Intermediate Math (数学&速度的分解&陷阱)
10773 - Back to Intermediate MathTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=467&page=show_problem&problem=1714Umm! So, you claim y原创 2013-09-12 18:46:10 · 1880 阅读 · 0 评论 -
UVa 439/HDU 1372/POJ 2243/ZOJ 1091 Knight Moves(BFS&纯数学方法)
439 - Knight MovesTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=105&page=show_problem&problem=380http://acm.hdu.edu.cn/showproblem.php?原创 2013-08-03 19:35:48 · 1285 阅读 · 0 评论 -
UVa 524 Prime Ring Problem (数论&DFS)
524 - Prime Ring ProblemTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=465A ring is composed of n (even number) circl原创 2013-09-13 16:20:38 · 1313 阅读 · 0 评论 -
UVa 103 Stacking Boxes (DP&DAG)
103 - Stacking BoxesTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=114&page=show_problem&problem=39BackgroundSome concepts in Math原创 2013-09-17 20:40:41 · 1114 阅读 · 0 评论 -
NEERC 2006 / UVa 1388 Graveyard (数学&想法题&找最近整数)
1388 - GraveyardTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=4134Programming contests became so popula原创 2013-09-01 15:39:00 · 1121 阅读 · 0 评论