Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"TopCoder-6876\":[\"ValidPlates\",5,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10665\\u0026amp;pm\\u003d6876\\\"\\u003eSingle Round Match 341 Round 1 - Division I, Level Three\\u003c/a\\u003e\"],\"UVA-10003\":[\"Cutting Sticks\",17484,null],\"UVA-10000\":[\"Longest Paths\",5790,null],\"UVA-11450\":[\"Wedding shopping\",6957,null],\"UVA-10120\":[\"Gift?!\",809,null],\"SPOJ-FCTRL2\":[\"Small factorials\",49774,\"\"],\"UVA-10648\":[\"Chocolate Box\",423,null],\"UVA-10405\":[\"Longest Common Subsequence\",16422,null],\"UVA-10523\":[\"Very Easy !!!\",4594,null],\"UVA-10007\":[\"Count the Trees\",2899,null],\"UVA-10249\":[\"The Grand Dinner\",2923,null],\"UVA-10887\":[\"Concatenation of Languages\",2317,null],\"UVA-10368\":[\"Euclid\\u0027s Game\",2325,null],\"UVA-775\":[\"Hamiltonian Cycle\",621,null],\"SPOJ-COINS\":[\"Bytelandian gold coins\",26868,\"Purdue Programming Contest Training\"],\"UVA-495\":[\"Fibonacci Freeze\",12033,null],\"UVA-136\":[\"Ugly Numbers\",31814,null],\"UVA-410\":[\"Station Balance\",2644,null],\"UVA-133\":[\"The Dole Queue\",11369,null],\"SPOJ-ACODE\":[\"Alphacode\",22862,\"ACM East Central North America Regional Programming Contest 2004\"],\"UVA-10196\":[\"Check The Check\",5134,null],\"UVA-11044\":[\"Searching for Nessy\",22709,null],\"UVA-10591\":[\"Happy Number\",8489,null],\"UVA-10074\":[\"Take the Land\",4991,null],\"TopCoder-7332\":[\"FairTournament\",3,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10668\\u0026amp;pm\\u003d7332\\\"\\u003eSingle Round Match 344 Round 1 - Division I, Level Three\\u003c/a\\u003e\"],\"UVA-707\":[\"Robbery\",560,null],\"UVA-10910\":[\"Marks Distribution\",2626,null],\"UVA-706\":[\"LC-Display\",11553,null],\"UVA-10878\":[\"Decode the tape\",6713,null],\"SPOJ-MAIN72\":[\"Subset sum\",2069,\"Own problem used for NSIT-IIITA main contest #7\"],\"UVA-10116\":[\"Robot Motion\",4348,null],\"UVA-305\":[\"Joseph\",6242,null],\"UVA-424\":[\"Integer Inquiry\",15091,null],\"UVA-10918\":[\"Tri Tiling\",2733,null],\"UVA-10917\":[\"Walk Through the Forest\",2020,null],\"UVA-307\":[\"Sticks\",3523,null],\"UVA-147\":[\"Dollars\",12208,null],\"UVA-146\":[\"ID Codes\",16595,null],\"SPOJ-PARTY\":[\"Party Schedule\",9066,\"Swiss Olympiad in Informatics 2004\"],\"UVA-10068\":[\"The Treasure Hunt\",158,null],\"UVA-10860\":[\"Many a Little makes a Mickle\",379,null],\"UVA-10981\":[\"String Morphing\",186,null],\"UVA-10982\":[\"Troublemakers\",546,null],\"UVA-10341\":[\"Solve It\",9693,null],\"UVA-10220\":[\"I Love Big Numbers !\",7093,null],\"UVA-10583\":[\"Ubiquitous Religions\",7757,null],\"UVA-10462\":[\"Is There A Second Way Left?\",2722,null],\"UVA-10100\":[\"Longest Match\",3131,null],\"UVA-10065\":[\"Useless Tile Packers\",1998,null],\"UVA-10183\":[\"How Many Fibs?\",6259,null],\"TopCoder-7540\":[\"QuantumAlchemy\",2,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10668\\u0026amp;pm\\u003d7540\\\"\\u003eSingle Round Match 344 Round 1 - Division I, Level Two\\u003c/a\\u003e\\n\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10668\\u0026amp;pm\\u003d7540\\\"\\u003eSingle Round Match 344 Round 1 - Division II, Level Three\\u003c/a\\u003e\"],\"UVA-11714\":[\"Blind Sorting\",857,null],\"UVA-10900\":[\"So you want to be a 2n-aire?\",1037,null],\"UVA-10226\":[\"Hardwood Species\",11277,null],\"UVA-11799\":[\"Horror Dash\",26989,null],\"UVA-10502\":[\"Counting Rectangles\",2067,null],\"UVA-10983\":[\"Buy one, get the rest free\",624,null],\"UVA-11710\":[\"Expensive subway\",1981,null],\"UVA-11039\":[\"Building designing\",4261,null],\"UVA-10909\":[\"Lucky Number\",570,null],\"UVA-116\":[\"Unidirectional TSP\",12055,null],\"UVA-115\":[\"Climbing Trees\",1925,null],\"UVA-11718\":[\"Fantasy of a Summation\",856,null],\"UVA-110\":[\"Meta-Loopless Sorts\",2491,null],\"UVA-10192\":[\"Vacation\",9090,null],\"UVA-231\":[\"Testing the CATCHER\",7058,null],\"UVA-11040\":[\"Add bricks in the wall\",2751,null],\"UVA-196\":[\"Spreadsheet\",2054,null],\"UVA-113\":[\"Power of Cryptography\",23965,null],\"UVA-111\":[\"History Grading\",12019,null],\"UVA-10970\":[\"Big Chocolate\",18979,null],\"UVA-10453\":[\"Make Palindrome\",2531,null],\"UVA-11420\":[\"Chest of Drawers\",2225,null],\"UVA-10616\":[\"Divisible Group Sums\",4124,null],\"UVA-10579\":[\"Fibonacci Numbers\",5869,null],\"UVA-10337\":[\"Flight Planner\",2747,null],\"UVA-10576\":[\"Y2K Accounting Bug\",2148,null],\"UVA-10851\":[\"2D Hieroglyphs decoder\",1368,null],\"UVA-402\":[\"M*A*S*H\",1493,null],\"SPOJ-PIGBANK\":[\"Piggy-Bank\",8359,\"ACM Central European Programming Contest, Prague 1999\"],\"UVA-10739\":[\"String to Palindrome\",3933,null],\"UVA-526\":[\"String Distance and Transform Process\",2227,null],\"UVA-120\":[\"Stacks of Flapjacks\",13528,null],\"UVA-640\":[\"Self Numbers\",5797,null],\"UVA-10200\":[\"Prime Time\",4144,null],\"UVA-10288\":[\"Coupons\",1728,null],\"UVALive-2729\":[\"The Solar System\",148,\"World Finals \\u003e\\u003e 2003 - Beverly Hills\"],\"UVA-11532\":[\"Simple Adjacency Maximization\",729,null],\"UVA-11136\":[\"Hoax or what\",5152,null],\"UVA-10165\":[\"Stone Game\",2643,null],\"UVA-11494\":[\"Queen\",5233,null],\"UVA-10285\":[\"Longest Run on a Snowboard\",6917,null],\"UVA-11495\":[\"Bubbles and Buckets\",2687,null],\"UVA-11096\":[\"Nails\",869,null],\"UVALive-2721\":[\"Building Bridges\",365,\"World Finals \\u003e\\u003e 2003 - Beverly Hills\"],\"UVALive-2722\":[\"Light Bulbs\",362,\"World Finals \\u003e\\u003e 2003 - Beverly Hills\"],\"UVA-10327\":[\"Flip Sort\",16620,null],\"UVA-10844\":[\"Bloques\",275,null],\"UVA-10600\":[\"ACM Contest and Blackout\",5705,null],\"UVALive-3530\":[\"Martian Mining\",380,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"UVA-612\":[\"DNA Sorting\",7102,null],\"UVA-336\":[\"A Node Too Far\",9673,null],\"UVA-10608\":[\"Friends\",10725,null],\"UVA-218\":[\"Moth Eradication\",1784,null],\"UVA-11003\":[\"Boxes\",2216,null],\"UVA-10036\":[\"Divisibility\",6070,null],\"TopCoder-7415\":[\"ReverseResources\",0,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10666\\u0026amp;pm\\u003d7415\\\"\\u003eSingle Round Match 342 Round 1 - Division I, Level Two\\u003c/a\\u003e\"],\"UVA-10034\":[\"Freckles\",10950,null],\"UVA-10672\":[\"Marbles on a tree\",1017,null],\"UVA-590\":[\"Always on the run\",1626,null],\"SPOJ-EDIST\":[\"Edit distance\",14899,\"Internet\"],\"UVALive-3527\":[\"Find the Clones\",285,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"UVALive-3528\":[\"The Warehouse\",51,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"UVA-11000\":[\"Bee\",8853,null],\"UVA-11088\":[\"End up with More Teams\",785,null],\"UVA-10954\":[\"Add All\",18421,null],\"UVA-10798\":[\"Be wary of Roses\",188,null],\"UVA-10158\":[\"War\",3526,null],\"UVA-908\":[\"Re-connecting Computer Sites\",4022,null],\"UVA-12578\":[\"10:6:2\",8304,null],\"UVA-107\":[\"The Cat in the Hat\",6577,null],\"UVA-348\":[\"Optimal Array Multiplication Sequence\",5265,null],\"UVA-623\":[\"500!\",10198,null],\"UVA-104\":[\"Arbitrage\",5138,null],\"UVA-109\":[\"SCUD Busters\",2728,null],\"UVA-10958\":[\"How Many Solutions?\",398,null],\"UVA-108\":[\"Maximum Sum\",22202,null],\"UVA-900\":[\"Brick Wall Patterns\",11809,null],\"UVA-10838\":[\"The Pawn Chess\",189,null],\"UVA-103\":[\"Stacking Boxes\",8040,null],\"UVA-12049\":[\"Just Prune The List\",3160,null],\"TopCoder-7625\":[\"SimpleRotationDecoder\",0,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10668\\u0026amp;pm\\u003d7625\\\"\\u003eSingle Round Match 344 Round 1 - Division II, Level Two\\u003c/a\\u003e\"],\"UVA-10023\":[\"Square root\",2115,null],\"UVA-10020\":[\"Minimal coverage\",4612,null],\"UVA-10305\":[\"Ordering Tasks\",23266,null],\"UVA-10944\":[\"Nuts for nuts..\",1002,null],\"UVA-11755\":[\"Table Tennis\",103,null],\"UVA-10941\":[\"Words adjustment\",127,null],\"UVA-10700\":[\"Camel trading\",3337,null],\"UVA-10821\":[\"Constructing BST\",719,null],\"UVA-10026\":[\"Shoemaker\\u0027s Problem\",9013,null],\"UVA-11512\":[\"GATTACA\",2474,null],\"UVA-10940\":[\"Throwing cards away II\",4100,null],\"UVA-714\":[\"Copying Books\",4937,null],\"UVA-713\":[\"Adding Reversed Numbers\",9695,null],\"UVA-154\":[\"Recycling\",3350,null],\"UVA-674\":[\"Coin Change\",18673,null],\"SPOJ-PERMUT1\":[\"Permutations\",4495,\"III Polish Collegiate Team Programming Contest (AMPPZ), 1998\"],\"UVA-793\":[\"Network Connections\",8395,null],\"UVA-155\":[\"All Squares\",2993,null],\"TopCoder-6802\":[\"MoneyGame\",0,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10667\\u0026amp;pm\\u003d6802\\\"\\u003eSingle Round Match 343 Round 1 - Division I, Level Two\\u003c/a\\u003e\"],\"UVA-10013\":[\"Super long sums\",7258,null],\"UVA-10891\":[\"Game of Sum\",4539,null],\"UVA-10099\":[\"The Tourist Guide\",7591,null],\"UVA-10010\":[\"Where\\u0027s Waldorf?\",10353,null],\"UVA-10131\":[\"Is Bigger Smarter?\",9710,null],\"UVA-10494\":[\"If We Were a Child Again\",4635,null],\"UVA-11462\":[\"Age Sort\",18912,null],\"UVA-10491\":[\"Cows and Cars\",5374,null],\"UVA-11506\":[\"Angry Programmer\",1800,null],\"UVA-10934\":[\"Dropping water balloons\",1504,null],\"UVA-10534\":[\"Wavio Sequence\",5492,null],\"UVA-10930\":[\"A-Sequence\",1551,null],\"UVA-10810\":[\"Ultra-QuickSort\",5767,null],\"UVA-10898\":[\"Combo Deal\",761,null],\"UVA-10896\":[\"Known Plaintext Attack\",960,null],\"UVA-327\":[\"Evaluating Simple C Expressions\",1479,null],\"UVA-10937\":[\"Blackbeard the Pirate\",669,null],\"UVA-284\":[\"Logic\",67,null],\"UVA-444\":[\"Encoder and Decoder\",5852,null],\"UVA-202\":[\"Repeating Decimals\",7414,null],\"UVA-443\":[\"Humble Numbers\",6239,null],\"UVA-200\":[\"Rare Order\",7300,null],\"TopCoder-7505\":[\"CsCourses\",10,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10664\\u0026amp;pm\\u003d7505\\\"\\u003eSingle Round Match 340 Round 1 - Division I, Level Two\\u003c/a\\u003e\\n\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10664\\u0026amp;pm\\u003d7505\\\"\\u003eSingle Round Match 340 Round 1 - Division II, Level Three\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"tigerisland45","updateTime":1553676658000,"title":"π-Algorithmist分类题目(3)","dislikeCnt":0,"content":"\n[海岛Blog](http://blog.csdn.net/tigerisland45)\n\n[挑战ACM编程](https://cn.vjudge.net/group/challenge)是自由参与组。提供挑战题、水题、白书、紫书和蓝书等等......\n\nπ-Algorithmist分类题目(3)\n\nProbability Theory\n1. [problem:UVA-10288] Coupons\n2. [problem:UVA-10491] Cows and Cars\n3. [problem:UVA-10900] So you want to be a 2n-aire?\n\nNumerical Method\n1. [problem:UVA-10341] Solve It\n\nCalculus\n1. [problem:UVALive-2729] The Solar System\n2. [problem:UVA-10900] So you want to be a 2n-aire?\n\nData Structure\n1. [problem:UVA-10010] Where\u0027s Waldorf?\n2. [problem:UVA-10909] Lucky Number\n3. [problem:UVA-11512] GATTACA\n4. [problem:UVA-10887] Concatenation of Languages\n5. [problem:UVA-11462] Age Sort\n\nInterval tree\n1. [problem:UVA-10534] Wavio Sequence\n\nMinimum Spanning Tree\n1. [problem:UVALive-2721] Building Bridges\n2. [problem:UVA-10034] Freckles\n3. [problem:UVA-10462] Is There A Second Way Left?\n4. [problem:UVA-10600] ACM Contest and Blackout\n5. [problem:UVA-908] Re-connecting Computer Sites\n\nBacktracking\n1. [problem:UVALive-3528] The Warehouse\n2. [problem:UVA-10285] Longest Run on a Snowboard\n3. [problem:UVA-10576] Y2K Accounting Bug\n4. [problem:UVA-110] Meta-Loopless Sorts\n\nBacktracking (DP)\n1. [problem:TopCoder-7505] CsCourses\n\nDivide and Conquer\n1. [problem:UVA-10327] Flip Sort\n2. [problem:UVA-10810] Ultra-QuickSort\n3. [problem:UVA-11495] Bubbles and Buckets\n\nGreedy\n1. [problem:UVALive-2722] Light Bulbs\n2. [problem:TopCoder-7540] QuantumAlchemy\n3. [problem:UVA-10020] Minimal coverage\n4. [problem:UVA-10026] Shoemaker\u0027s Problem\n5. [problem:UVA-10249] The Grand Dinner\n6. [problem:UVA-10672] Marbles on a tree\n7. [problem:UVA-10700] Camel trading\n8. [problem:UVA-10821] Constructing BST\n9. [problem:UVA-10954] Add All\n10. [problem:UVA-10982] Troublemakers\n11. [problem:UVA-11039] Building designing\n12. [problem:UVA-11040] Add bricks in the wall\n13. [problem:UVA-11532] Simple Adjacency Maximization\n14. [problem:UVA-120] Stacks of Flapjacks\n15. [problem:UVA-410] Station Balance\n16. [problem:UVA-714] Copying Books\n\nBigNum\n1. [problem:UVALive-2722] Light Bulbs\n2. [problem:SPOJ-FCTRL2] Small factorials\n3. [problem:UVA-10007] Count the Trees\n4. [problem:UVA-10013] Super long sums\n5. [problem:UVA-10116] Robot Motion\n6. [problem:UVA-10183] How Many Fibs?\n7. [problem:UVA-10220] I Love Big Numbers !\n8. [problem:UVA-10494] If We Were a Child Again\n9. [problem:UVA-10523] Very Easy !!!\n10. [problem:UVA-10579] Fibonacci Numbers\n11. [problem:UVA-10844] Bloques\n12. [problem:UVA-424] Integer Inquiry\n13. [problem:UVA-495] Fibonacci Freeze\n14. [problem:UVA-623] 500!\n15. [problem:UVA-713] Adding Reversed Numbers\n\nCryptography\n1. [problem:SPOJ-ACODE] Alphacode\n2. [problem:TopCoder-7625] SimpleRotationDecoder\n3. [problem:UVA-10851] 2D Hieroglyphs decoder\n4. [problem:UVA-10878] Decode the tape\n5. [problem:UVA-10896] Known Plaintext Attack\n6. [problem:UVA-444] Encoder and Decoder\n\nDynamic Programming\n1. [problem:UVALive-3530] Martian Mining\n2. [problem:SPOJ-ACODE] Alphacode\n3. [problem:SPOJ-COINS] Bytelandian gold coins\n4. [problem:SPOJ-EDIST] Edit distance\n5. [problem:SPOJ-MAIN72] Subset sum\n6. [problem:SPOJ-PARTY] Party Schedule\n7. [problem:SPOJ-PERMUT1] Permutations\n8. [problem:SPOJ-PIGBANK] Piggy-Bank\n9. [problem:TopCoder-7505] CsCourses\n10. [problem:TopCoder-7332] FairTournament\n11. [problem:TopCoder-7415] ReverseResources\n12. [problem:TopCoder-6876] ValidPlates\n13. [problem:UVA-10000] Longest Paths\n14. [problem:UVA-10003] Cutting Sticks\n15. [problem:UVA-10036] Divisibility\n16. [problem:UVA-10068] The Treasure Hunt\n17. [problem:UVA-10074] Take the Land\n18. [problem:UVA-10099] The Tourist Guide\n19. [problem:UVA-10100] Longest Match\n20. [problem:UVA-10131] Is Bigger Smarter?\n21. [problem:UVA-10192] Vacation\n22. [problem:UVA-103] Stacking Boxes\n23. [problem:UVA-10337] Flight Planner\n24. [problem:UVA-104] Arbitrage\n25. [problem:UVA-10405] Longest Common Subsequence\n26. [problem:UVA-10453] Make Palindrome\n27. [problem:UVA-10502] Counting Rectangles\n28. [problem:UVA-10616] Divisible Group Sums\n29. [problem:UVA-10648] Chocolate Box\n30. [problem:UVA-107] The Cat in the Hat\n31. [problem:UVA-10739] String to Palindrome\n32. [problem:UVA-10798] Be wary of Roses\n33. [problem:UVA-108] Maximum Sum\n34. [problem:UVA-10838] The Pawn Chess\n35. [problem:UVA-10860] Many a Little makes a Mickle\n36. [problem:UVA-10891] Game of Sum\n37. [problem:UVA-10898] Combo Deal\n38. [problem:UVA-10910] Marks Distribution\n39. [problem:UVA-10917] Walk Through the Forest\n40. [problem:UVA-10918] Tri Tiling\n41. [problem:UVA-10930] A-Sequence\n42. [problem:UVA-10934] Dropping water balloons\n43. [problem:UVA-10937] Blackbeard the Pirate\n44. [problem:UVA-10940] Throwing cards away II\n45. [problem:UVA-10944] Nuts for nuts..\n46. [problem:UVA-10970] Big Chocolate\n47. [problem:UVA-10981] String Morphing\n48. [problem:UVA-11000] Bee\n49. [problem:UVA-11003] Boxes\n50. [problem:UVA-11088] End up with More Teams\n51. [problem:UVA-111] History Grading\n52. [problem:UVA-11420] Chest of Drawers\n53. [problem:UVA-11450] Wedding shopping\n54. [problem:UVA-116] Unidirectional TSP\n55. [problem:UVA-136] Ugly Numbers\n56. [problem:UVA-147] Dollars\n57. [problem:UVA-231] Testing the CATCHER\n58. [problem:UVA-348] Optimal Array Multiplication Sequence\n59. [problem:UVA-443] Humble Numbers\n60. [problem:UVA-526] String Distance and Transform Process\n61. [problem:UVA-590] Always on the run\n62. [problem:UVA-612] DNA Sorting\n63. [problem:UVA-674] Coin Change\n64. [problem:UVA-707] Robbery\n65. [problem:UVA-900] Brick Wall Patterns\n\nSubset Sum\n1. [problem:UVA-10120] Gift?!\n2. [problem:UVA-147] Dollars\n\nLongest Increasing Subsequence\n1. [problem:UVA-10131] Is Bigger Smarter?\n2. [problem:UVA-103] Stacking Boxes\n3. [problem:UVA-10534] Wavio Sequence\n4. [problem:UVA-111] History Grading\n\nLongest Common Subsequence\n1. [problem:UVA-10100] Longest Match\n2. [problem:UVA-10192] Vacation\n3. [problem:UVA-10405] Longest Common Subsequence\n4. [problem:UVA-10453] Make Palindrome\n\nStubs\n1. [problem:UVA-10023] Square root\n2. [problem:UVA-10196] Check The Check\n3. [problem:UVA-10200] Prime Time\n4. [problem:UVA-10226] Hardwood Species\n5. [problem:UVA-10368] Euclid\u0027s Game\n6. [problem:UVA-10591] Happy Number\n7. [problem:UVA-10958] How Many Solutions?\n8. [problem:UVA-11044] Searching for Nessy\n9. [problem:UVA-11136] Hoax or what\n10. [problem:UVA-11494] Queen\n11. [problem:UVA-115] Climbing Trees\n12. [problem:UVA-11532] Simple Adjacency Maximization\n13. [problem:UVA-11710] Expensive subway\n14. [problem:UVA-11714] Blind Sorting\n15. [problem:UVA-11718] Fantasy of a Summation\n16. [problem:UVA-11755] Table Tennis\n17. [problem:UVA-11799] Horror Dash\n18. [problem:UVA-133] The Dole Queue\n19. [problem:UVA-154] Recycling\n20. [problem:UVA-202] Repeating Decimals\n21. [problem:UVA-284] Logic\n22. [problem:UVA-305] Joseph\n23. [problem:UVA-307] Sticks\n24. [problem:UVA-327] Evaluating Simple C Expressions\n25. [problem:UVA-336] A Node Too Far\n26. [problem:UVA-402] M*A*S*H\n27. [problem:UVA-640] Self Numbers\n\nCleanup\n1. [problem:UVA-110] Meta-Loopless Sorts\n2. [problem:UVA-146] ID Codes\n3. [problem:UVA-155] All Squares\n4. [problem:UVA-231] Testing the CATCHER\n\nCombinatorial Game Theory\n1. [problem:TopCoder-6802] MoneyGame\n2. [problem:UVA-10165] Stone Game\n\nFibonacci\n1. [problem:UVA-900] Brick Wall Patterns\n\nHashing\n1. [problem:UVALive-3527] Find the Clones\n2. [problem:UVA-12049] Just Prune The List\n\nKnapsack\n1. [problem:SPOJ-PARTY] Party Schedule\n\nLogarithms\n1. [problem:UVA-113] Power of Cryptography\n\nMincut-Maxflow\n1. [problem:UVA-10983] Buy one, get the rest free\n\nNP-complete\n1. [problem:UVA-775] Hamiltonian Cycle\n\nNetwork Flow\n1. [problem:UVA-11506] Angry Programmer\n\nOutput related\n1. [problem:UVA-706] LC-Display\n\nSimple math\n1. [problem:UVA-12578] 10:6:2\n\nTest Cases\n1. [problem:UVA-10941] Words adjustment\n\nRMQ\n1. [problem:UVA-10534] Wavio Sequence\n\nConvex Hull\n1. [problem:UVA-10065] Useless Tile Packers\n2. [problem:UVA-109] SCUD Busters\n3. [problem:UVA-11096] Nails\n4. [problem:UVA-218] Moth Eradication\n\nTopological sort\n1. [problem:UVA-10305] Ordering Tasks\n2. [problem:UVA-10672] Marbles on a tree\n3. [problem:UVA-196] Spreadsheet\n4. [problem:UVA-200] Rare Order\n\nUnion Find\n1. [problem:UVA-10158] War\n2. [problem:UVA-10583] Ubiquitous Religions\n3. [problem:UVA-10608] Friends\n4. [problem:UVA-793] Network Connections","threadId":25985,"likeCnt":2,"createTime":1519566310000,"isWorkbook":true,"viewCnt":3640,"openness":1,"fav":false,"id":370,"trustable":false}