Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"UVA-11054\":[\"Wine trading in Gergovia\",5422,null],\"UVA-11176\":[\"Winning Streak\",683,null],\"UVA-10085\":[\"The most distant state\",767,null],\"UVA-10404\":[\"Bachet\\u0027s Game\",3358,null],\"UVA-10405\":[\"Longest Common Subsequence\",16364,null],\"UVA-10887\":[\"Concatenation of Languages\",2311,null],\"UVA-10400\":[\"Game Show Math\",2207,null],\"UVA-10763\":[\"Foreign Exchange\",8405,null],\"UVA-10401\":[\"Injured Queen Problem\",1358,null],\"UVA-138\":[\"Street Numbers\",8146,null],\"UVA-253\":[\"Cube painting\",7291,null],\"UVA-494\":[\"Kindergarten Counting Game\",29343,null],\"UVA-131\":[\"The Psychic Poker Player\",1763,null],\"UVA-11181\":[\"Probability|Given\",2400,null],\"UVA-375\":[\"Inscribed Circles and Isosceles Triangles\",1313,null],\"UVA-133\":[\"The Dole Queue\",11362,null],\"UVA-254\":[\"Towers of Hanoi\",908,null],\"UVA-10079\":[\"Pizza Cutting\",19773,null],\"UVA-11045\":[\"My T-shirt suits me\",2796,null],\"UVA-11044\":[\"Searching for Nessy\",22701,null],\"UVA-270\":[\"Lining Up\",1920,null],\"UVA-10194\":[\"Football (aka Soccer)\",4363,null],\"UVA-10879\":[\"Code Refactoring\",4156,null],\"UVA-709\":[\"Formatting Text\",385,null],\"UVA-10516\":[\"Another Counting Problem\",310,null],\"UVA-10759\":[\"Dice Throwing\",1799,null],\"UVA-10635\":[\"Prince and Princess\",4671,null],\"UVA-10878\":[\"Decode the tape\",6712,null],\"UVA-10994\":[\"Simple Addition\",2484,null],\"UVA-701\":[\"The Archeologists\\u0027 Dilemma\",3112,null],\"UVA-705\":[\"Slash Maze\",2604,null],\"UVA-825\":[\"Walking on the Safe Side\",3706,null],\"UVA-704\":[\"Colour Hash\",1399,null],\"UVA-10518\":[\"How Many Calls?\",1730,null],\"UVA-10519\":[\"!! Really Strange !!\",1547,null],\"UVA-141\":[\"The Spot Game\",2720,null],\"UVA-140\":[\"Bandwidth\",4890,null],\"UVA-10081\":[\"Tight Words\",2247,null],\"UVA-147\":[\"Dollars\",12207,null],\"UVA-146\":[\"ID Codes\",16594,null],\"UVA-387\":[\"A Puzzling Problem\",483,null],\"UVA-10069\":[\"Distinct Subsequences\",3732,null],\"UVA-10066\":[\"The Twin Towers\",8590,null],\"UVA-11151\":[\"Longest Palindrome\",4821,null],\"UVA-10183\":[\"How Many Fibs?\",6254,null],\"UVA-10626\":[\"Buying Coke\",1506,null],\"UVA-10624\":[\"Super Number\",698,null],\"UVA-10746\":[\"Crime Wave - The Sequel\",1034,null],\"UVA-10985\":[\"Rings\\u0027n\\u0027Ropes\",339,null],\"UVA-10986\":[\"Sending email\",10532,null],\"UVA-10862\":[\"Connect the Cable Wires\",1570,null],\"UVA-116\":[\"Unidirectional TSP\",12055,null],\"UVA-357\":[\"Let Me Count The Ways\",14032,null],\"UVA-110\":[\"Meta-Loopless Sorts\",2490,null],\"UVA-10071\":[\"Back to High School Physics\",65285,null],\"UVA-10192\":[\"Vacation\",9086,null],\"UVA-350\":[\"Pseudo-Random Numbers\",8363,null],\"UVA-592\":[\"Island of Logic\",595,null],\"UVA-591\":[\"Box of Bricks\",27193,null],\"UVA-113\":[\"Power of Cryptography\",23963,null],\"UVA-112\":[\"Tree Summing\",6756,null],\"UVA-111\":[\"History Grading\",12017,null],\"UVA-10970\":[\"Big Chocolate\",18978,null],\"UVA-10057\":[\"A mid-summer night\\u0027s dream.\",3957,null],\"UVA-10055\":[\"Hashmat the Brave Warrior\",73220,null],\"UVA-10056\":[\"What is the Probability ?\",5113,null],\"UVA-10177\":[\"(2/3/4)-D Sqr/Rects/Cubes/Boxes?\",2343,null],\"UVA-10054\":[\"The Necklace\",5519,null],\"UVA-490\":[\"Rotating Sentences\",13080,null],\"UVA-10051\":[\"Tower of Cubes\",2497,null],\"UVA-10616\":[\"Divisible Group Sums\",4124,null],\"UVA-11029\":[\"Leading and Trailing\",2500,null],\"UVA-11027\":[\"Palindromic Permutation\",446,null],\"UVA-128\":[\"Software CRC\",4076,null],\"UVA-127\":[\"\\\"Accordian\\\" Patience\",4871,null],\"UVA-489\":[\"Hangman Judge\",15007,null],\"UVA-10617\":[\"Again Palindrome\",2694,null],\"UVA-10739\":[\"String to Palindrome\",3929,null],\"UVA-120\":[\"Stacks of Flapjacks\",13525,null],\"UVA-10061\":[\"How many zero\\u0027s and how many digits ?\",2178,null],\"UVA-488\":[\"Triangle Wave\",20358,null],\"UVA-125\":[\"Numbering Paths\",2555,null],\"UVA-123\":[\"Searching Quickly\",3996,null],\"UVA-10201\":[\"Adventures in Moving - Part IV\",1440,null],\"UVA-10564\":[\"Paths through the Hourglass\",1110,null],\"UVA-10562\":[\"Undraw the Trees\",2820,null],\"UVA-10328\":[\"Coin Toss\",850,null],\"UVA-10205\":[\"Stack \\u0027em Up\",4458,null],\"UVA-458\":[\"The Decoder\",32842,null],\"UVA-579\":[\"Clock Hands\",18949,null],\"UVA-216\":[\"Getting in Line\",5274,null],\"UVA-457\":[\"Linear Cellular Automata\",3425,null],\"UVA-699\":[\"The Falling Leaves\",6186,null],\"UVA-572\":[\"Oil Deposits\",25730,null],\"UVA-571\":[\"Jugs\",3134,null],\"UVA-575\":[\"Skew Binary\",15910,null],\"UVA-696\":[\"How Many Knights\",4783,null],\"UVA-694\":[\"The Collatz Sequence\",12752,null],\"UVA-573\":[\"The Snail\",17175,null],\"UVA-331\":[\"Mapping the Swaps\",1862,null],\"UVA-10673\":[\"Play with Floor and Ceil\",4513,null],\"UVA-10790\":[\"How Many Points of Intersection?\",3638,null],\"UVA-590\":[\"Always on the run\",1626,null],\"UVA-10791\":[\"Minimum Sum LCM\",4815,null],\"UVA-10670\":[\"Work Reduction\",1786,null],\"UVA-10558\":[\"A Brief Gerrymander\",237,null],\"UVA-10557\":[\"XYZZY\",2867,null],\"UVA-10313\":[\"Pay the Price\",2080,null],\"UVA-107\":[\"The Cat in the Hat\",6577,null],\"UVA-106\":[\"Fermat vs. Pythagoras\",4979,null],\"UVA-348\":[\"Optimal Array Multiplication Sequence\",5261,null],\"UVA-104\":[\"Arbitrage\",5138,null],\"UVA-108\":[\"Maximum Sum\",22191,null],\"UVA-340\":[\"Master-Mind Hints\",11264,null],\"UVA-103\":[\"Stacking Boxes\",8040,null],\"UVA-465\":[\"Overflow\",4978,null],\"UVA-101\":[\"The Blocks Problem\",22939,null],\"UVA-10420\":[\"List of Conquests\",14334,null],\"UVA-10300\":[\"Ecological Premium\",31327,null],\"UVA-11198\":[\"Dancing Digits\",525,null],\"UVA-10308\":[\"Roads in the North\",1628,null],\"UVA-10305\":[\"Ordering Tasks\",23243,null],\"UVA-10306\":[\"e-Coins\",3329,null],\"UVA-10303\":[\"How Many Trees?\",2313,null],\"UVA-10304\":[\"Optimal Binary Search Tree\",2578,null],\"UVA-10785\":[\"The Mad Numerologist\",1725,null],\"UVA-10422\":[\"Knights in FEN\",2306,null],\"UVA-437\":[\"The Tower of Babylon\",8998,null],\"UVA-558\":[\"Wormholes\",10277,null],\"UVA-557\":[\"Burger\",1253,null],\"UVA-439\":[\"Knight Moves\",16522,null],\"UVA-317\":[\"Hexagon\",169,null],\"UVA-550\":[\"Multiplying by Rotation\",1649,null],\"UVA-11081\":[\"Strings\",530,null],\"UVA-674\":[\"Coin Change\",18671,null],\"UVA-311\":[\"Packets\",3128,null],\"UVA-673\":[\"Parentheses Balance\",30580,null],\"UVA-310\":[\"L--system\",286,null],\"UVA-10651\":[\"Pebble Solitaire\",3337,null],\"UVA-11069\":[\"A Graph Problem\",3358,null],\"UVA-10891\":[\"Game of Sum\",4539,null],\"UVA-10099\":[\"The Tourist Guide\",7589,null],\"UVA-10098\":[\"Generating Fast\",8465,null],\"UVA-10417\":[\"Gift Exchanging\",282,null],\"UVA-10534\":[\"Wavio Sequence\",5483,null],\"UVA-327\":[\"Evaluating Simple C Expressions\",1479,null],\"UVA-568\":[\"Just the Facts\",8182,null],\"UVA-567\":[\"Risk\",6653,null],\"UVA-445\":[\"Marvelous Mazes\",11803,null],\"UVA-208\":[\"Firetruck\",3626,null],\"UVA-565\":[\"Pizza Anyone?\",862,null],\"UVA-322\":[\"Ships\",70,null],\"UVA-321\":[\"The New Villa\",1298,null],\"UVA-442\":[\"Matrix Chain Multiplication\",9281,null],\"UVA-563\":[\"Crimewave\",1371,null],\"UVA-562\":[\"Dividing coins\",13828,null],\"UVA-10123\":[\"No Tipping\",462,null],\"UVA-10003\":[\"Cutting Sticks\",17458,null],\"UVA-10245\":[\"The Closest Pair Problem\",5378,null],\"UVA-10487\":[\"Closest Sums\",7709,null],\"UVA-11210\":[\"Chinese Mahjong\",1127,null],\"UVA-10001\":[\"Garden of Eden\",1878,null],\"UVA-10361\":[\"Automatic Poetry\",5949,null],\"UVA-10803\":[\"Thunder Mountain\",2000,null],\"UVA-10129\":[\"Play on Words\",5542,null],\"UVA-11218\":[\"KTV\",1733,null],\"UVA-10801\":[\"Lift Hopping\",4483,null],\"UVA-10006\":[\"Carmichael Numbers\",10929,null],\"UVA-10369\":[\"Arctic Network\",6214,null],\"UVA-10128\":[\"Queue\",2804,null],\"UVA-10004\":[\"Bicoloring\",26217,null],\"UVA-10125\":[\"Sumsets\",4389,null],\"UVA-10247\":[\"Complete Tree Labeling\",909,null],\"UVA-657\":[\"The die is cast\",3412,null],\"UVA-414\":[\"Machined Surfaces\",10963,null],\"UVA-10806\":[\"Dijkstra, Dijkstra.\",2042,null],\"UVA-539\":[\"The Settlers of Catan\",3857,null],\"UVA-658\":[\"It\\u0027s not a Bug, it\\u0027s a Feature!\",1775,null],\"UVA-537\":[\"Artificial Intelligence?\",5257,null],\"UVA-532\":[\"Dungeon Master\",8116,null],\"UVA-531\":[\"Compromise\",4500,null],\"UVA-10112\":[\"Myacm Triangles\",2003,null],\"UVA-10596\":[\"Morning Walk\",1702,null],\"UVA-10110\":[\"Light, more light\",24369,null],\"UVA-10594\":[\"Data Flow\",1183,null],\"UVA-10474\":[\"Where is the Marble?\",27203,null],\"UVA-10591\":[\"Happy Number\",8486,null],\"UVA-10912\":[\"Simple Minded Hashing\",1968,null],\"UVA-10913\":[\"Walking on a Grid\",1149,null],\"UVA-10118\":[\"Free Candies\",1943,null],\"UVA-10910\":[\"Marks Distribution\",2626,null],\"UVA-10911\":[\"Forming Quiz Teams\",4768,null],\"UVA-11205\":[\"The broken pedometer\",1558,null],\"UVA-10359\":[\"Tiling\",2082,null],\"UVA-10115\":[\"Automatic Editing\",3342,null],\"UVA-10599\":[\"Robots(II)\",522,null],\"UVA-10236\":[\"The Fibonacci Primes\",507,null],\"UVA-424\":[\"Integer Inquiry\",15091,null],\"UVA-10918\":[\"Tri Tiling\",2732,null],\"UVA-10916\":[\"Factstone Benchmark\",2418,null],\"UVA-307\":[\"Sticks\",3520,null],\"UVA-548\":[\"Tree\",6509,null],\"UVA-306\":[\"Cipher\",1662,null],\"UVA-301\":[\"Transportation\",1958,null],\"UVA-784\":[\"Maze Exploration\",5139,null],\"UVA-542\":[\"France \\u002798\",1769,null],\"UVA-540\":[\"Team Queue\",12437,null],\"UVA-10465\":[\"Homer Simpson\",5329,null],\"UVA-10344\":[\"23 out of 5\",7759,null],\"UVA-10341\":[\"Solve It\",9692,null],\"UVA-10340\":[\"All in All\",26599,null],\"UVA-519\":[\"Puzzle (II)\",409,null],\"UVA-10229\":[\"Modular Fibonacci\",4826,null],\"UVA-10900\":[\"So you want to be a 2n-aire?\",1036,null],\"UVA-10105\":[\"Polynomial Coefficients\",4212,null],\"UVA-10106\":[\"Product\",15114,null],\"UVA-755\":[\"487--3279\",4275,null],\"UVA-753\":[\"A Plug for UNIX\",1995,null],\"UVA-639\":[\"Don\\u0027t Get Rooked\",4141,null],\"UVA-10905\":[\"Children\\u0027s Game\",7113,null],\"UVA-757\":[\"Gone Fishing\",837,null],\"UVA-515\":[\"King\",830,null],\"UVA-197\":[\"Cube\",186,null],\"UVA-196\":[\"Spreadsheet\",2054,null],\"UVA-993\":[\"Product of digits\",5235,null],\"UVA-991\":[\"Safe Salutations\",3203,null],\"UVA-10453\":[\"Make Palindrome\",2527,null],\"UVA-10330\":[\"Power Transmission\",3086,null],\"UVA-10570\":[\"Meeting with Aliens\",1120,null],\"UVA-409\":[\"Excuses, Excuses!\",4869,null],\"UVA-10334\":[\"Ray Through Glasses\",5371,null],\"UVA-644\":[\"Immediate Decodability\",5312,null],\"UVA-401\":[\"Palindromes\",24678,null],\"UVA-408\":[\"Uniform Generator\",8385,null],\"UVA-529\":[\"Addition Chains\",2107,null],\"UVA-400\":[\"Unix ls\",8397,null],\"UVA-763\":[\"Fibinary Numbers\",1967,null],\"UVA-10167\":[\"Birthday Cake\",3622,null],\"UVA-10047\":[\"The Monocycle\",3113,null],\"UVA-10163\":[\"Storage Keepers\",1119,null],\"UVA-10285\":[\"Longest Run on a Snowboard\",6916,null],\"UVA-10161\":[\"Ant on a Chessboard\",9264,null],\"UVA-10282\":[\"Babelfish\",11077,null],\"UVA-10041\":[\"Vito\\u0027s Family\",23136,null],\"UVA-10604\":[\"Chemical Reaction\",617,null],\"UVA-10723\":[\"Cyborg Genes\",1315,null],\"UVA-10602\":[\"Editor Nottoobad\",1417,null],\"UVA-10603\":[\"Fill\",3204,null],\"UVA-10721\":[\"Bar Codes\",3655,null],\"UVA-11137\":[\"Ingenuous Cubrency\",6745,null],\"UVA-11258\":[\"String Partition\",1964,null],\"UVA-10048\":[\"Audiophobia\",8932,null],\"UVA-10169\":[\"Urn-ball Probabilities!\",534,null],\"UVA-10720\":[\"Graph Construction\",1623,null],\"UVA-10608\":[\"Friends\",10715,null],\"UVA-297\":[\"Quadtrees\",6624,null],\"UVA-10050\":[\"Hartals\",18768,null],\"UVA-299\":[\"Train Swapping\",29990,null],\"UVA-10277\":[\"Boastin\\u0027 Red Socks\",460,null],\"UVA-10157\":[\"Expressions\",1072,null],\"UVA-11125\":[\"Arrange Some Marbles\",389,null],\"UVA-10154\":[\"Weights and Measures\",3246,null],\"UVA-10034\":[\"Freckles\",10946,null],\"UVA-10397\":[\"Connect the Campus\",3989,null],\"UVA-10152\":[\"ShellSort\",5334,null],\"UVA-10273\":[\"Eat or Not to Eat?\",500,null],\"UVA-193\":[\"Graph Coloring\",4525,null],\"UVA-10274\":[\"Fans and Gems\",159,null],\"UVA-11121\":[\"Base -2\",2559,null],\"UVA-10392\":[\"Factoring Large Numbers\",3711,null],\"UVA-10271\":[\"Chopsticks\",3010,null],\"UVA-10714\":[\"Ants\",4323,null],\"UVA-10954\":[\"Add All\",18417,null],\"UVA-11008\":[\"Antimatter Ray Clearcutting\",675,null],\"UVA-11129\":[\"An antiarithmetic permutation\",1004,null],\"UVA-10158\":[\"War\",3526,null],\"UVA-624\":[\"CD\",15019,null],\"UVA-502\":[\"DEL command\",198,null],\"UVA-622\":[\"Grammar Evaluation\",646,null],\"UVA-621\":[\"Secret Research\",13997,null],\"UVA-507\":[\"Jill Rides Again\",7373,null],\"UVA-10718\":[\"Bit Mask\",2455,null],\"UVA-10719\":[\"Quotient Polynomial\",1681,null],\"UVA-748\":[\"Exponentiation\",4201,null],\"UVA-10716\":[\"Evil Straw Warts Live\",727,null],\"UVA-10717\":[\"Mint\",2211,null],\"UVA-10280\":[\"Old Wine Into New Bottles\",363,null],\"UVA-10160\":[\"Servicing Stations\",1413,null],\"UVA-185\":[\"Roman Numerals\",887,null],\"UVA-620\":[\"Cellular Structure\",1764,null],\"UVA-188\":[\"Perfect Hash\",1760,null],\"UVA-10387\":[\"Billiard\",1428,null],\"UVA-11234\":[\"Expressions\",1448,null],\"UVA-10025\":[\"The ? 1 ? 2 ? ... ? n \\u003d k problem\",4000,null],\"UVA-11111\":[\"Generalized Matrioshkas\",2637,null],\"UVA-10023\":[\"Square root\",2115,null],\"UVA-10020\":[\"Minimal coverage\",4609,null],\"UVA-10382\":[\"Watering Grass\",3889,null],\"UVA-839\":[\"Not so Mobile\",7142,null],\"UVA-10943\":[\"How do you add?\",7452,null],\"UVA-10820\":[\"Send a Table\",3830,null],\"UVA-10029\":[\"Edit Step Ladders\",1837,null],\"UVA-10700\":[\"Camel trading\",3337,null],\"UVA-10026\":[\"Shoemaker\\u0027s Problem\",8998,null],\"UVA-10940\":[\"Throwing cards away II\",4100,null],\"UVA-10148\":[\"Advertisement\",567,null],\"UVA-10269\":[\"Adventure of Super Mario\",1045,null],\"UVA-712\":[\"S-Trees\",4158,null],\"UVA-714\":[\"Copying Books\",4933,null],\"UVA-10706\":[\"Number Sequence\",2862,null],\"UVA-10827\":[\"Maximum sum on a torus\",3666,null],\"UVA-10391\":[\"Compound Words\",6413,null],\"UVA-152\":[\"Tree\\u0027s a Crowd\",3559,null],\"UVA-156\":[\"Ananagrams\",18467,null],\"UVA-10014\":[\"Simple calculations\",3248,null],\"UVA-10132\":[\"File Fragmentation\",3350,null],\"UVA-11100\":[\"The Trip, 2007\",2898,null],\"UVA-10012\":[\"How Big Is It?\",1983,null],\"UVA-10375\":[\"Choose and divide\",3698,null],\"UVA-10254\":[\"The Priest Mathematician\",1495,null],\"UVA-10130\":[\"SuperSale\",13777,null],\"UVA-10010\":[\"Where\\u0027s Waldorf?\",10353,null],\"UVA-10131\":[\"Is Bigger Smarter?\",9708,null],\"UVA-10494\":[\"If We Were a Child Again\",4635,null],\"UVA-10491\":[\"Cows and Cars\",5373,null],\"UVA-10250\":[\"The Other Two Trees\",1503,null],\"UVA-729\":[\"The Hamming Distance Problem\",7017,null],\"UVA-607\":[\"Scheduling Lectures\",1430,null],\"UVA-10499\":[\"The Land of Justice\",7245,null],\"UVA-10817\":[\"Headmaster\\u0027s Headache\",2420,null],\"UVA-10815\":[\"Andy\\u0027s First Dictionary\",24644,null],\"UVA-846\":[\"Steps\",7514,null],\"UVA-165\":[\"Stamps\",1308,null],\"UVA-167\":[\"The Sultan\\u0027s Successors\",9625,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"tigerisland45","updateTime":1624202446000,"title":"AOAPC I: Beginning Algorithm Contests (Rujia Liu)","dislikeCnt":0,"content":"\n[海岛Blog](http://blog.csdn.net/tigerisland45)\n\n[挑战ACM编程](https://cn.vjudge.net/group/challenge)是自由参与组。提供挑战题、水题、白书、紫书和蓝书等等......\n\nAOAPC I: Beginning Algorithm Contests (Rujia Liu)\n\nVolume 0. Getting Started\n1. [problem:UVA-10055] Hashmat the Brave Warrior\n2. [problem:UVA-10071] Back to High School Physics\n3. [problem:UVA-10300] Ecological Premium\n4. [problem:UVA-458] The Decoder\n5. [problem:UVA-494] Kindergarten Counting Game\n6. [problem:UVA-414] Machined Surfaces\n7. [problem:UVA-490] Rotating Sentences\n8. [problem:UVA-445] Marvelous Mazes\n9. [problem:UVA-488] Triangle Wave\n10. [problem:UVA-489] Hangman Judge\n11. [problem:UVA-694] The Collatz Sequence\n12. [problem:UVA-457] Linear Cellular Automata\n\nVolume 1. Elementary Problem Solving\n\nString\n1. [problem:UVA-401] Palindromes\n2. [problem:UVA-10010] Where\u0027s Waldorf?\n3. [problem:UVA-10361] Automatic Poetry\n4. [problem:UVA-537] Artificial Intelligence?\n5. [problem:UVA-409] Excuses, Excuses!\n6. [problem:UVA-10878] Decode the tape\n7. [problem:UVA-10815] Andy\u0027s First Dictionary\n8. [problem:UVA-644] Immediate Decodability\n9. [problem:UVA-10115] Automatic Editing\n\nBig Number\n1. [problem:UVA-424] Integer Inquiry\n2. [problem:UVA-10106] Product\n3. [problem:UVA-465] Overflow\n4. [problem:UVA-748] Exponentiation\n5. [problem:UVA-10494] If We Were a Child Again\n\nSorting / Searching\n1. [problem:UVA-340] Master-Mind Hints\n2. [problem:UVA-10420] List of Conquests\n3. [problem:UVA-10474] Where is the Marble?\n4. [problem:UVA-152] Tree\u0027s a Crowd\n5. [problem:UVA-299] Train Swapping\n6. [problem:UVA-120] Stacks of Flapjacks\n7. [problem:UVA-156] Ananagrams\n8. [problem:UVA-400] Unix ls\n9. [problem:UVA-123] Searching Quickly\n10. [problem:UVA-10194] Football (aka Soccer)\n11. [problem:UVA-755] 487--3279\n12. [problem:UVA-10785] The Mad Numerologist\n\nMaths - Misc\n1. [problem:UVA-113] Power of Cryptography\n2. [problem:UVA-10161] Ant on a Chessboard\n3. [problem:UVA-253] Cube painting\n4. [problem:UVA-621] Secret Research\n5. [problem:UVA-10025] The ? 1 ? 2 ? ... ? n \u003d k problem\n6. [problem:UVA-591] Box of Bricks\n7. [problem:UVA-107] The Cat in the Hat\n8. [problem:UVA-573] The Snail\n9. [problem:UVA-846] Steps\n10. [problem:UVA-10499] The Land of Justice\n11. [problem:UVA-10790] How Many Points of Intersection?\n12. [problem:UVA-11044] Searching for Nessy\n13. [problem:UVA-10719] Quotient Polynomial\n14. [problem:UVA-10177] (2/3/4)-D Sqr/Rects/Cubes/Boxes?\n15. [problem:UVA-10916] Factstone Benchmark\n16. [problem:UVA-10970] Big Chocolate\n17. [problem:UVA-10014] Simple calculations\n\nMaths - Number Theory\n1. [problem:UVA-575] Skew Binary\n2. [problem:UVA-10110] Light, more light\n3. [problem:UVA-550] Multiplying by Rotation\n4. [problem:UVA-568] Just the Facts\n5. [problem:UVA-408] Uniform Generator\n6. [problem:UVA-350] Pseudo-Random Numbers\n7. [problem:UVA-10061] How many zero\u0027s and how many digits ?\n8. [problem:UVA-10392] Factoring Large Numbers\n9. [problem:UVA-10879] Code Refactoring\n\nMaths - Simple Geometry\n1. [problem:UVA-10250] The Other Two Trees\n2. [problem:UVA-579] Clock Hands\n3. [problem:UVA-375] Inscribed Circles and Isosceles Triangles\n4. [problem:UVA-10387] Billiard\n5. [problem:UVA-10112] Myacm Triangles\n\nVolume 2. Data Structures\n\nLists\n1. [problem:UVA-127] \"Accordian\" Patience\n2. [problem:UVA-101] The Blocks Problem\n3. [problem:UVA-133] The Dole Queue\n4. [problem:UVA-10152] ShellSort\n5. [problem:UVA-673] Parentheses Balance\n6. [problem:UVA-442] Matrix Chain Multiplication\n7. [problem:UVA-11111] Generalized Matrioshkas\n8. [problem:UVA-11234] Expressions\n9. [problem:UVA-540] Team Queue\n10. [problem:UVA-10050] Hartals\t\n\nBinary Trees\n1. [problem:UVA-112] Tree Summing\n2. [problem:UVA-548] Tree\n3. [problem:UVA-297] Quadtrees\n4. [problem:UVA-712] S-Trees\n5. [problem:UVA-699] The Falling Leaves\n6. [problem:UVA-327] Evaluating Simple C Expressions\n7. [problem:UVA-839] Not so Mobile\n8. [problem:UVA-10562] Undraw the Trees\n\nGraphs\n1. [problem:UVA-572] Oil Deposits\n2. [problem:UVA-657] The die is cast\n3. [problem:UVA-784] Maze Exploration\n4. [problem:UVA-705] Slash Maze\n5. [problem:UVA-439] Knight Moves\n6. [problem:UVA-532] Dungeon Master\n7. [problem:UVA-10557] XYZZY\n8. [problem:UVA-10047] The Monocycle\n9. [problem:UVA-10004] Bicoloring\n10. [problem:UVA-10129] Play on Words\n11. [problem:UVA-10054] The Necklace\n12. [problem:UVA-10596] Morning Walk\n13. [problem:UVA-10305] Ordering Tasks\n14. [problem:UVA-196] Spreadsheet\n\nVolume 3. Brute Force\n\nElementary Skills\n1. [problem:UVA-10167] Birthday Cake\n2. [problem:UVA-11205] The broken pedometer\n3. [problem:UVA-131] The Psychic Poker Player\n4. [problem:UVA-146] ID Codes\n5. [problem:UVA-10098] Generating Fast\n6. [problem:UVA-729] The Hamming Distance Problem\n7. [problem:UVA-592] Island of Logic\n8. [problem:UVA-110] Meta-Loopless Sorts\n\nBacktracking - Easy\n1. [problem:UVA-10474] Where is the Marble?\n2. [problem:UVA-216] Getting in Line\n3. [problem:UVA-639] Don\u0027t Get Rooked\n4. [problem:UVA-539] The Settlers of Catan\n5. [problem:UVA-301] Transportation\n6. [problem:UVA-10344] 23 out of 5\n7. [problem:UVA-331] Mapping the Swaps\n8. [problem:UVA-10012] How Big Is It?\n9. [problem:UVA-165] Stamps\n10. [problem:UVA-167] The Sultan\u0027s Successors\n11. [problem:UVA-10001] Garden of Eden\n12. [problem:UVA-140] Bandwidth\n13. [problem:UVA-193] Graph Coloring\n14. [problem:UVA-208] Firetruck\n\nBacktracking - Hard\n1. [problem:UVA-10123] No Tipping\n2. [problem:UVA-10160] Servicing Stations\n3. [problem:UVA-197] Cube\n4. [problem:UVA-185] Roman Numerals\n5. [problem:UVA-307] Sticks\n6. [problem:UVA-317] Hexagon\n7. [problem:UVA-387] A Puzzling Problem\n8. [problem:UVA-519] Puzzle (II)\n9. [problem:UVA-529] Addition Chains\n10. [problem:UVA-565] Pizza Anyone?\n11. [problem:UVA-502] DEL command\n12. [problem:UVA-322] Ships\n\nImplicit Graph Traversal\n1. [problem:UVA-10603] Fill\n2. [problem:UVA-10422] Knights in FEN\n3. [problem:UVA-10085] The most distant state\n4. [problem:UVA-310] L--system\n5. [problem:UVA-321] The New Villa\n6. [problem:UVA-704] Colour Hash\n\nHashing / Sets\n1. [problem:UVA-188] Perfect Hash\n2. [problem:UVA-10282] Babelfish\n3. [problem:UVA-10391] Compound Words\n4. [problem:UVA-10125] Sumsets\n5. [problem:UVA-10887] Concatenation of Languages\n6. [problem:UVA-141] The Spot Game\n7. [problem:UVA-10591] Happy Number\n\nRujia Liu\u0027s Problems for Beginners\n1. [problem:UVA-11218] KTV\n2. [problem:UVA-11198] Dancing Digits\n3. [problem:UVA-10274] Fans and Gems\n4. [problem:UVA-11210] Chinese Mahjong\n5. [problem:UVA-10624] Super Number\n\nVolume 4. Algorithm Design\n1. [problem:UVA-10905] Children\u0027s Game\n2. [problem:UVA-10763] Foreign Exchange\n3. [problem:UVA-10132] File Fragmentation\n4. [problem:UVA-270] Lining Up\n5. [problem:UVA-10341] Solve It\n6. [problem:UVA-10057] A mid-summer night\u0027s dream.\n7. [problem:UVA-10706] Number Sequence\n8. [problem:UVA-10487] Closest Sums\n9. [problem:UVA-10340] All in All\n10. [problem:UVA-10700] Camel trading\n11. [problem:UVA-10026] Shoemaker\u0027s Problem\n12. [problem:UVA-311] Packets\n13. [problem:UVA-10020] Minimal coverage\n14. [problem:UVA-10714] Ants\n15. [problem:UVA-10954] Add All\n16. [problem:UVA-714] Copying Books\n17. [problem:UVA-10602] Editor Nottoobad\n18. [problem:UVA-10400] Game Show Math\n19. [problem:UVA-10718] Bit Mask\n20. [problem:UVA-11054] Wine trading in Gergovia\n21. [problem:UVA-10382] Watering Grass\n22. [problem:UVA-10670] Work Reduction\n23. [problem:UVA-10720] Graph Construction\n24. [problem:UVA-993] Product of digits\n25. [problem:UVA-10716] Evil Straw Warts Live\n26. [problem:UVA-11100] The Trip, 2007\n27. [problem:UVA-10245] The Closest Pair Problem\n28. [problem:UVA-11129] An antiarithmetic permutation\n29. [problem:UVA-10041] Vito\u0027s Family\n30. [problem:UVA-507] Jill Rides Again\n31. [problem:UVA-108] Maximum Sum\n32. [problem:UVA-10827] Maximum sum on a torus\n33. [problem:UVA-757] Gone Fishing\n34. [problem:UVA-10148] Advertisement\n\nVolume 5. Dynamic Programming\n1. [problem:UVA-111] History Grading\n2. [problem:UVA-103] Stacking Boxes\n3. [problem:UVA-10405] Longest Common Subsequence\n4. [problem:UVA-674] Coin Change\n5. [problem:UVA-10003] Cutting Sticks\n6. [problem:UVA-116] Unidirectional TSP\n7. [problem:UVA-10131] Is Bigger Smarter?\n8. [problem:UVA-10066] The Twin Towers\n9. [problem:UVA-10192] Vacation\n10. [problem:UVA-147] Dollars\n11. [problem:UVA-357] Let Me Count The Ways\n12. [problem:UVA-562] Dividing coins\n13. [problem:UVA-348] Optimal Array Multiplication Sequence\n14. [problem:UVA-624] CD\n15. [problem:UVA-10130] SuperSale\n16. [problem:UVA-531] Compromise\n17. [problem:UVA-10465] Homer Simpson\n18. [problem:UVA-10285] Longest Run on a Snowboard\n19. [problem:UVA-437] The Tower of Babylon\n20. [problem:UVA-10404] Bachet\u0027s Game\n21. [problem:UVA-620] Cellular Structure\n22. [problem:UVA-825] Walking on the Safe Side\n23. [problem:UVA-10069] Distinct Subsequences\n24. [problem:UVA-10534] Wavio Sequence\n25. [problem:UVA-10051] Tower of Cubes\n26. [problem:UVA-10651] Pebble Solitaire\n27. [problem:UVA-590] Always on the run\n28. [problem:UVA-10306] e-Coins\n29. [problem:UVA-10739] String to Palindrome\n30. [problem:UVA-10304] Optimal Binary Search Tree\n31. [problem:UVA-10271] Chopsticks\n32. [problem:UVA-10617] Again Palindrome\n33. [problem:UVA-11137] Ingenuous Cubrency\n34. [problem:UVA-10154] Weights and Measures\n35. [problem:UVA-10201] Adventures in Moving - Part IV\n36. [problem:UVA-10453] Make Palindrome\n37. [problem:UVA-10029] Edit Step Ladders\n38. [problem:UVA-10313] Pay the Price\n39. [problem:UVA-10401] Injured Queen Problem\n40. [problem:UVA-10891] Game of Sum\n41. [problem:UVA-11151] Longest Palindrome\n42. [problem:UVA-10911] Forming Quiz Teams\n43. [problem:UVA-10635] Prince and Princess\n44. [problem:UVA-10564] Paths through the Hourglass\n45. [problem:UVA-622] Grammar Evaluation\n46. [problem:UVA-10626] Buying Coke\n47. [problem:UVA-10118] Free Candies\n48. [problem:UVA-607] Scheduling Lectures\n49. [problem:UVA-10604] Chemical Reaction\n50. [problem:UVA-10913] Walking on a Grid\n51. [problem:UVA-11008] Antimatter Ray Clearcutting\n52. [problem:UVA-10723] Cyborg Genes\n53. [problem:UVA-11258] String Partition\n54. [problem:UVA-10599] Robots(II)\n55. [problem:UVA-10817] Headmaster\u0027s Headache\n56. [problem:UVA-10163] Storage Keepers\n57. [problem:UVA-709] Formatting Text\n58. [problem:UVA-10280] Old Wine Into New Bottles\n59. [problem:UVA-10558] A Brief Gerrymander\n60. [problem:UVA-11081] Strings\n\nVolume 6. Mathematical Concepts and Methods\n1. [problem:UVA-138] Street Numbers\n2. [problem:UVA-10006] Carmichael Numbers\n3. [problem:UVA-128] Software CRC\n4. [problem:UVA-106] Fermat vs. Pythagoras\n5. [problem:UVA-10673] Play with Floor and Ceil\n6. [problem:UVA-11121] Base -2\n7. [problem:UVA-10791] Minimum Sum LCM\n8. [problem:UVA-10717] Mint\n9. [problem:UVA-10820] Send a Table\n10. [problem:UVA-571] Jugs\n11. [problem:UVA-11029] Leading and Trailing\n12. [problem:UVA-10023] Square root\n13. [problem:UVA-10308] Roads in the North\n14. [problem:UVA-10105] Polynomial Coefficients\n15. [problem:UVA-10375] Choose and divide\n16. [problem:UVA-11027] Palindromic Permutation\n17. [problem:UVA-10056] What is the Probability ?\n18. [problem:UVA-10491] Cows and Cars\n19. [problem:UVA-10759] Dice Throwing\n20. [problem:UVA-542] France \u002798\n21. [problem:UVA-10277] Boastin\u0027 Red Socks\n22. [problem:UVA-10169] Urn-ball Probabilities!\n23. [problem:UVA-11181] Probability|Given\n24. [problem:UVA-557] Burger\n25. [problem:UVA-10900] So you want to be a 2n-aire?\n26. [problem:UVA-11176] Winning Streak\n27. [problem:UVA-10417] Gift Exchanging\n28. [problem:UVA-10183] How Many Fibs?\n29. [problem:UVA-10303] How Many Trees?\n30. [problem:UVA-10518] How Many Calls?\n31. [problem:UVA-10862] Connect the Cable Wires\n32. [problem:UVA-10334] Ray Through Glasses\n33. [problem:UVA-10229] Modular Fibonacci\n34. [problem:UVA-763] Fibinary Numbers\n35. [problem:UVA-10236] The Fibonacci Primes\n36. [problem:UVA-991] Safe Salutations\n37. [problem:UVA-10079] Pizza Cutting\n38. [problem:UVA-10940] Throwing cards away II\n39. [problem:UVA-10359] Tiling\n40. [problem:UVA-10519] !! Really Strange !!\n41. [problem:UVA-10918] Tri Tiling\n42. [problem:UVA-11069] A Graph Problem\n43. [problem:UVA-10910] Marks Distribution\n44. [problem:UVA-10254] The Priest Mathematician\n45. [problem:UVA-10328] Coin Toss\n46. [problem:UVA-10157] Expressions\n47. [problem:UVA-10247] Complete Tree Labeling\n48. [problem:UVA-10516] Another Counting Problem\n49. [problem:UVA-10128] Queue\n50. [problem:UVA-10081] Tight Words\n51. [problem:UVA-10943] How do you add?\n52. [problem:UVA-10721] Bar Codes\n53. [problem:UVA-10912] Simple Minded Hashing\n54. [problem:UVA-10616] Divisible Group Sums\n55. [problem:UVA-11125] Arrange Some Marbles\n56. [problem:UVA-10205] Stack \u0027em Up\n57. [problem:UVA-701] The Archeologists\u0027 Dilemma\n58. [problem:UVA-696] How Many Knights\n59. [problem:UVA-254] Towers of Hanoi\n60. [problem:UVA-10994] Simple Addition\n61. [problem:UVA-306] Cipher\n62. [problem:UVA-10570] Meeting with Aliens\n\nVolume 7. Graph Algorithms and Implementation Techniques\n1. [problem:UVA-567] Risk\n2. [problem:UVA-10034] Freckles\n3. [problem:UVA-10048] Audiophobia\n4. [problem:UVA-10397] Connect the Campus\n5. [problem:UVA-10369] Arctic Network\n6. [problem:UVA-658] It\u0027s not a Bug, it\u0027s a Feature!\n7. [problem:UVA-10099] The Tourist Guide\n8. [problem:UVA-10801] Lift Hopping\n9. [problem:UVA-10986] Sending email\n10. [problem:UVA-558] Wormholes\n11. [problem:UVA-515] King\n12. [problem:UVA-104] Arbitrage\n13. [problem:UVA-125] Numbering Paths\n14. [problem:UVA-10803] Thunder Mountain\n15. [problem:UVA-10330] Power Transmission\n16. [problem:UVA-10806] Dijkstra, Dijkstra.\n17. [problem:UVA-11045] My T-shirt suits me\n18. [problem:UVA-753] A Plug for UNIX\n19. [problem:UVA-563] Crimewave\n20. [problem:UVA-10746] Crime Wave - The Sequel\n21. [problem:UVA-10594] Data Flow\n22. [problem:UVA-10985] Rings\u0027n\u0027Ropes\n23. [problem:UVA-10608] Friends\n24. [problem:UVA-10158] War\n25. [problem:UVA-10269] Adventure of Super Mario\n26. [problem:UVA-10273] Eat or Not to Eat?\n\n","threadId":43146,"likeCnt":8,"createTime":1549698949000,"isWorkbook":true,"viewCnt":5689,"openness":1,"fav":false,"id":875,"trustable":false}