Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"POJ-2376\":[\"Cleaning Shifts\",9398,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+December+Silver\\\"\\u003eUSACO 2004 December Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-11212\":[\"Editing a Book\",2035,null],\"UVA-11059\":[\"Maximum Product\",11068,null],\"UVA-10366\":[\"Faucet Flow\",470,null],\"UVA-11694\":[\"Gokigen Naname\",255,null],\"HDU-1789\":[\"Doing Homework again\",10468,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2007%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A810%A3%A9_%D2%D4%B4%CB%B8%D0%D0%BBDOOMIII\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(10)_以此感谢DOOMIII \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10001\":[\"Garden of Eden\",1875,null],\"UVA-11175\":[\"From D to E and Back\",581,null],\"UVA-11054\":[\"Wine trading in Gergovia\",5409,null],\"UVA-12265\":[\"Selling Land\",519,null],\"UVA-11572\":[\"Unique Snowflakes\",8847,null],\"UVA-1149\":[\"Bin Packing\",2341,null],\"POJ-1328\":[\"Radar Installation\",24608,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBeijing+2002\\\"\\u003eBeijing 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-818\":[\"Cutting Chains\",1000,null],\"POJ-2019\":[\"Cornfields\",3734,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2003+March+Green\\\"\\u003eUSACO 2003 March Green\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-817\":[\"According to Bartjens\",540,null],\"UVA-10128\":[\"Queue\",2799,null],\"UVA-10249\":[\"The Grand Dinner\",2909,null],\"UVA-11214\":[\"Guarding the Chessboard\",849,null],\"UVA-10368\":[\"Euclid\\u0027s Game\",2321,null],\"UVA-12545\":[\"Bits Equalizer\",2335,null],\"ZOJ-3118\":[\"Highway\",145,null],\"UVA-539\":[\"The Settlers of Catan\",3855,null],\"POJ-3190\":[\"Stall Reservations\",5964,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+February+Silver\\\"\\u003eUSACO 2006 February Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"ZOJ-1213\":[\"Lumber Cutting\",150,null],\"UVA-410\":[\"Station Balance\",2638,null],\"UVA-133\":[\"The Dole Queue\",11349,null],\"ZOJ-1171\":[\"Sorting the Photos\",1034,null],\"CodeForces-97B\":[\"Superset\",1024,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/97\\\"\\u003eYandex.Algorithm 2011: Finals\\u003c/a\\u003e\"],\"UVA-10196\":[\"Check The Check\",5127,null],\"UVA-11044\":[\"Searching for Nessy\",22657,null],\"UVA-10591\":[\"Happy Number\",8481,null],\"UVA-1312\":[\"Cricket Field\",493,null],\"HDU-3177\":[\"Crixalis\\u0027s Equipment\",1925,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2009-10+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2009-10 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1854\":[\"Evil Straw Warts Live\",708,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2004.09.19\\\"\\u003eWaterloo local 2004.09.19\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-11846\":[\"Finding Seats Again\",240,null],\"POJ-1979\":[\"Red and Black\",25935,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2004+Domestic\\\"\\u003eJapan 2004 Domestic\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-305\":[\"Joseph\",6236,null],\"UVALive-3055\":[\"Symmetric Order \",319,\"Regionals 2004 \\u003e\\u003e North America - Mid-Central USA\"],\"UVA-704\":[\"Colour Hash\",1395,null],\"UVA-307\":[\"Sticks\",3505,null],\"UVA-140\":[\"Bandwidth\",4882,null],\"UVA-301\":[\"Transportation\",1956,null],\"UVA-1153\":[\"Keep the Customer Satisfied\",905,null],\"UVA-1152\":[\"4 Values whose Sum is 0\",3408,null],\"POJ-2393\":[\"Yogurt factory\",8320,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+March+Gold\\\"\\u003eUSACO 2005 March Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-1606\":[\"Amphiphilic Carbon Molecules\",757,null],\"UVA-10982\":[\"Troublemakers\",545,null],\"UVA-1607\":[\"Gates\",453,null],\"POJ-2352\":[\"Stars\",17275,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUral+Collegiate+Programming+Contest+1999\\\"\\u003eUral Collegiate Programming Contest 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-1608\":[\"Non-boring sequences\",1536,null],\"UVA-1609\":[\"Foul Play\",420,null],\"UVA-1205\":[\"Color a Tree\",785,null],\"POJ-2114\":[\"Boatherds\",923,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCTU+Open+2004\\\"\\u003eCTU Open 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"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-1601\":[\"The Morning after Halloween\",1425,null],\"UVA-10226\":[\"Hardwood Species\",11251,null],\"UVA-11799\":[\"Horror Dash\",26913,null],\"UVA-1602\":[\"Lattice Animals\",688,null],\"HDU-1045\":[\"Fire Net\",9449,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZhejiang+University+Local+Contest+2001\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Zhejiang University Local Contest 2001 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-1603\":[\"Square Destroyer\",719,null],\"UVA-1604\":[\"Cubic Eight-Puzzle\",312,null],\"POJ-3728\":[\"The merchant\",1558,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly+Contest+%E2%80%93+2009.04.05\\\"\\u003ePOJ Monthly Contest – 2009.04.05\\u003c/a\\u003e, GaoYihan\\u003c/div\\u003e\"],\"UVA-11710\":[\"Expensive subway\",1979,null],\"UVA-11039\":[\"Building designing\",4258,null],\"UVA-1605\":[\"Building for UN\",1958,null],\"ZOJ-3018\":[\"Population\",875,null],\"UVA-115\":[\"Climbing Trees\",1924,null],\"UVA-639\":[\"Don\\u0027t Get Rooked\",4124,null],\"UVA-757\":[\"Gone Fishing\",831,null],\"UVA-11718\":[\"Fantasy of a Summation\",856,null],\"UVA-110\":[\"Meta-Loopless Sorts\",2489,null],\"POJ-2083\":[\"Fractal\",8278,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dShanghai+2004+Preliminary\\\"\\u003eShanghai 2004 Preliminary\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-1442\":[\"Cav\",840,null],\"UVA-11040\":[\"Add bricks in the wall\",2749,null],\"ZOJ-1076\":[\"Gene Assembly\",3491,null],\"UVA-591\":[\"Box of Bricks\",27160,null],\"UVA-993\":[\"Product of digits\",5221,null],\"UVA-750\":[\"8 Queens Chess Problem\",7370,null],\"UVA-1617\":[\"Laptop\",501,null],\"UVA-1618\":[\"Weak Key\",416,null],\"UVA-12113\":[\"Overlapping Squares\",470,null],\"UVA-1619\":[\"Feel Good\",901,null],\"UVA-10570\":[\"Meeting with Aliens\",1114,null],\"HDU-1053\":[\"Entropy\",3070,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dGreater+New+York+2000\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Greater New York 2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-1610\":[\"Party Games\",1489,null],\"HDU-1055\":[\"Color a Tree\",1240,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+2004%2C+Beijing+%28Mainland+China%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 2004, Beijing (Mainland China) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10976\":[\"Fractions Again?!\",11275,null],\"UVA-1611\":[\"Crane\",714,null],\"UVA-1612\":[\"Guess\",584,null],\"UVA-1613\":[\"K-Graph Oddity\",481,null],\"UVA-1614\":[\"Hell on the Markets\",782,null],\"UVA-10576\":[\"Y2K Accounting Bug\",2143,null],\"UVA-1615\":[\"Highway\",855,null],\"UVA-1616\":[\"Caravan Robbers\",475,null],\"ZOJ-2734\":[\"Exchange Cards\",1796,null],\"UVA-129\":[\"Krypton Factor\",5048,null],\"UVA-524\":[\"Prime Ring Problem\",15419,null],\"UVA-402\":[\"M*A*S*H\",1493,null],\"HDU-1051\":[\"Wooden Sticks\",9463,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+2001%2C+Taejon+%28South+Korea%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 2001, Taejon (South Korea) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1050\":[\"Moving Tables\",12813,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+2001%2C+Taejon+%28South+Korea%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 2001, Taejon (South Korea) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10181\":[\"15-Puzzle Problem\",2092,null],\"UVA-120\":[\"Stacks of Flapjacks\",13424,null],\"UVA-1451\":[\"Average\",890,null],\"POJ-2370\":[\"Democracy in danger\",2478,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUral+State+University+Internal+Contest+October%272000+Junior+Session\\\"\\u003eUral State University Internal Contest October\\u00272000 Junior Session\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-640\":[\"Self Numbers\",5792,null],\"UVA-10200\":[\"Prime Time\",4140,null],\"UVA-11532\":[\"Simple Adjacency Maximization\",728,null],\"UVA-11136\":[\"Hoax or what\",5143,null],\"UVA-11134\":[\"Fabled Rooks\",2572,null],\"UVA-11494\":[\"Queen\",5220,null],\"UVA-10285\":[\"Longest Run on a Snowboard\",6904,null],\"UVA-11495\":[\"Bubbles and Buckets\",2678,null],\"UVA-1620\":[\"Lazy Susan\",389,null],\"UVA-1621\":[\"Jumping Around\",33,null],\"UVALive-2722\":[\"Light Bulbs\",362,\"World Finals \\u003e\\u003e 2003 - Beverly Hills\"],\"UVA-10327\":[\"Flip Sort\",16608,null],\"UVA-12627\":[\"Erratic Expansion\",1805,null],\"UVA-1622\":[\"Robot\",184,null],\"UVA-10603\":[\"Fill\",3198,null],\"UVA-1623\":[\"Enter The Dragon\",395,null],\"UVA-1624\":[\"Knots\",123,null],\"UVA-11536\":[\"Smallest Sub-Array\",2139,null],\"UVA-12107\":[\"Digit Puzzle\",334,null],\"UVALive-2322\":[\"Wooden Sticks\",353,\"Regionals 2001 \\u003e\\u003e Asia - Taejon\"],\"HDU-2037\":[\"今年暑假不AC\",47639,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM%B3%CC%D0%F2%C9%E8%BC%C6%C6%DA%C4%A9%BF%BC%CA%D4%A3%A82006%2F06%2F07%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM程序设计期末考试(2006/06/07) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-1580\":[\"Pirate Chest\",170,null],\"UVA-336\":[\"A Node Too Far\",9652,null],\"ZOJ-1012\":[\"Mainframe\",904,null],\"UVA-1344\":[\"Tian Ji -- The Horse Racing\",621,null],\"UVA-1343\":[\"The Rotation Game\",1338,null],\"UVA-690\":[\"Pipeline Scheduling\",497,null],\"UVA-211\":[\"The Domino Effect\",1166,null],\"UVA-177\":[\"Paper Folding\",1023,null],\"UVA-11882\":[\"Biggest Number\",691,null],\"UVA-10672\":[\"Marbles on a tree\",1015,null],\"POJ-1017\":[\"Packets\",19458,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCentral+Europe+1996\\\"\\u003eCentral Europe 1996\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVALive-3528\":[\"The Warehouse\",51,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"UVA-10032\":[\"Tug of War\",2390,null],\"UVA-12174\":[\"Shuffle\",943,null],\"UVA-11925\":[\"Generating Permutations\",762,null],\"UVA-10954\":[\"Add All\",18343,null],\"UVA-1193\":[\"Radar Installation\",1631,null],\"ZOJ-1665\":[\"Rational Irrationals\",38,null],\"UVA-1471\":[\"Defense Lines\",1415,null],\"ZOJ-1029\":[\"Moving Tables\",2872,null],\"UVA-225\":[\"Golygons\",1218,null],\"ZOJ-1145\":[\"Dreisam Equations\",431,null],\"UVA-10958\":[\"How Many Solutions?\",398,null],\"ZOJ-1025\":[\"Wooden Sticks\",4909,null],\"UVA-10160\":[\"Servicing Stations\",1413,null],\"POJ-3040\":[\"Allowance\",3635,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+October+Silver\\\"\\u003eUSACO 2005 October Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-1354\":[\"Mobile Computing\",1355,null],\"UVA-11491\":[\"Erasing and Winning\",2206,null],\"UVA-11093\":[\"Just Finish it up\",2808,null],\"UVA-861\":[\"Little Bishops\",3450,null],\"POJ-2155\":[\"Matrix\",8917,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly\\\"\\u003ePOJ Monthly\\u003c/a\\u003e,Lou Tiancheng\\u003c/div\\u003e\"],\"UVA-10023\":[\"Square root\",2090,null],\"UVA-10020\":[\"Minimal coverage\",4595,null],\"UVA-11230\":[\"Annoying painting tool\",554,null],\"HDU-1009\":[\"FatMouse\\u0027 Trade\",31590,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZJCPC2004\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ZJCPC2004 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10384\":[\"The Wall Pushers\",405,null],\"POJ-1862\":[\"Stripies\",9540,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2001\\\"\\u003eNortheastern Europe 2001\\u003c/a\\u003e, Northern Subregion\\u003c/div\\u003e\"],\"UVA-11755\":[\"Table Tennis\",103,null],\"UVA-10700\":[\"Camel trading\",3337,null],\"UVA-12569\":[\"Planning mobile robot on Tree (EASY Version)\",412,null],\"UVA-10821\":[\"Constructing BST\",716,null],\"UVA-10026\":[\"Shoemaker\\u0027s Problem\",8966,null],\"UVA-12325\":[\"Zombie\\u0027s Treasure Chest\",1561,null],\"SPOJ-PRO\":[\"Promotion\",2180,\"VII Polish Olympiad In Informatics 2000, stage III\"],\"UVA-714\":[\"Copying Books\",4928,null],\"ZOJ-1157\":[\"A Plug for UNIX\",363,null],\"UVA-154\":[\"Recycling\",3349,null],\"UVA-10270\":[\"Bigger Square Please...\",425,null],\"POJ-1195\":[\"Mobile phones\",8483,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dIOI+2001\\\"\\u003eIOI 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"SPOJ-QTREE5\":[\"Query on a tree V\",2141,\"XunYunbo, modified from ZJOI07\"],\"POJ-1230\":[\"Pass-Muraille\",3000,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+2002+Preliminary\\\"\\u003eTehran 2002 Preliminary\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-1533\":[\"Moving Pegs\",315,null],\"UVA-12559\":[\"Finding Black Circles\",130,null],\"UVA-12558\":[\"Egyptian Fractions (HARD version)\",1279,null],\"UVA-10810\":[\"Ultra-QuickSort\",5748,null],\"UVA-327\":[\"Evaluating Simple C Expressions\",1479,null],\"ZOJ-1166\":[\"Anagram Checker\",230,null],\"UVA-208\":[\"Firetruck\",3614,null],\"UVA-725\":[\"Division\",13964,null],\"UVA-12161\":[\"Ironman Race in Treeland\",184,null],\"UVA-284\":[\"Logic\",67,null],\"UVA-202\":[\"Repeating Decimals\",7402,null],\"UVA-167\":[\"The Sultan\\u0027s Successors\",9608,null],\"ZOJ-1161\":[\"Gone Fishing\",995,null],\"POJ-3262\":[\"Protecting the Flowers\",5899,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+January+Silver\\\"\\u003eUSACO 2007 January Silver\\u003c/a\\u003e\\u003c/div\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"tigerisland45","updateTime":1552943486000,"title":"TYUT基础算法题汇","dislikeCnt":0,"content":"\nTYUT基础算法题汇\n\n紫书 第7章 暴力解法(例题)\n1. [problem:UVA-725] Division\n2. [problem:UVA-11059] Maximum Product\n3. [problem:UVA-10976] Fractions Again?!\n4. [problem:UVA-524] Prime Ring Problem\n5. [problem:UVA-129] Krypton Factor\n6. [problem:UVA-140] Bandwidth\n7. [problem:UVA-1354] Mobile Computing\n8. [problem:UVA-10603] Fill\n9. [problem:UVA-1601] The Morning after Halloween\n10. [problem:UVA-11212] Editing a Book\n11. [problem:UVA-12325] Zombie\u0027s Treasure Chest\n12. [problem:UVA-1343] The Rotation Game\n13. [problem:UVA-1602] Lattice Animals\n14. [problem:UVA-1603] Square Destroyer\n\n紫书 第7章 暴力解法(习题)\n1. [problem:UVA-208] Firetruck\n2. [problem:UVA-225] Golygons\n3. [problem:UVA-211] The Domino Effect\n4. [problem:UVA-818] Cutting Chains\n5. [problem:UVA-690] Pipeline Scheduling\n6. [problem:UVA-12113] Overlapping Squares\n7. [problem:UVA-12558] Egyptian Fractions (HARD version)\n8. [problem:UVA-12107] Digit Puzzle\n9. [problem:UVA-1604] Cubic Eight-Puzzle\n10. [problem:UVA-11214] Guarding the Chessboard\n11. [problem:UVA-12569] Planning mobile robot on Tree (EASY Version)\n12. [problem:UVA-1533] Moving Pegs\n13. [problem:UVA-817] According to Bartjens\n14. [problem:UVA-307] Sticks\n15. [problem:UVA-11882] Biggest Number\n16. [problem:UVA-11846] Finding Seats Again\n17. [problem:UVA-11694] Gokigen Naname\n18. [problem:UVA-10384] The Wall Pushers\n\n白书 -4.6分治法(练习题)\n1. [problem:POJ-1854] Evil Straw Warts Live\n2. [problem:CodeForces-97B] Superset\n3. [problem:POJ-2114] Boatherds\n4. [problem:UVA-12161] Ironman Race in Treeland\n5. [problem:SPOJ-QTREE5] Query on a tree V\n\nπ-Algorithmist Divide and Conquer\n1. [problem:UVA-10327] Flip Sort\n2. [problem:UVA-10810] Ultra-QuickSort\n3. [problem:UVA-11495] Bubbles and Buckets\n\nπ-Algorithmist Greedy\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\nHDU Greedy\n1. [problem:HDU-1009] \t FatMouse\u0027 Trade \t\n2. [problem:HDU-1045] \t Fire Net \t\n3. [problem:HDU-1050] \t Moving Tables \t\n4. [problem:HDU-1051] \t Wooden Sticks \t\n5. [problem:HDU-1053] \t Entropy \t\n6. [problem:HDU-1055] \t Color a Tree \t\n7. [problem:HDU-1789] \t Doing Homework again \t\n8. [problem:HDU-2037] \t 今年暑假不AC \t\n9. [problem:HDU-3177] \t Crixalis\u0027s Equipment \n\n白书 2.2贪心法(练习题)\n1. [problem:POJ-2376] Cleaning Shifts\n2. [problem:POJ-1328] Radar Installation\n3. [problem:POJ-3190] Stall Reservations\n4. [problem:POJ-2393] Yogurt factory\n5. [problem:POJ-1017] Packets\n6. [problem:POJ-3040] Allowance\n7. [problem:POJ-1862] Stripies\n8. [problem:POJ-3262] Protecting the Flowers\n\n吴书《算法设计编程实验》 第5章 贪心法\n1. [problem:POJ-1230] Pass-Muraille\n2. [problem:UVA-1344] Tian Ji -- The Horse Racing\n3. [problem:UVA-10026] Shoemaker\u0027s Problem\n4. [problem:UVA-10954] Add All\n5. [problem:UVALive-2322] Wooden Sticks\n6. [problem:UVA-1193] Radar Installation\n7. [problem:UVA-1205] Color a Tree\n8. [problem:UVA-714] Copying Books\n9. [problem:POJ-1862] Stripies\n10. [problem:UVA-993] Product of digits\n11. [problem:POJ-2370] Democracy in danger\n12. [problem:UVA-591] Box of Bricks\n13. [problem:UVA-10020] Minimal coverage\n14. [problem:UVA-11230] Annoying painting tool\n15. [problem:UVA-10982] Troublemakers\n16. [problem:UVA-10821] Constructing BST\n17. [problem:UVA-757] Gone Fishing\n\n赵书 第八章 贪心法\n1. [problem:ZOJ-1171] Sorting the Photos\n2. [problem:ZOJ-1161] Gone Fishing\n3. [problem:ZOJ-1665] Rational Irrationals\n4. [problem:ZOJ-3118] Highway\n\n赵书2 第七章 贪心法与回溯(1-2)\n1. [problem:ZOJ-1012] Mainframe\n2. [problem:ZOJ-1025] Wooden Sticks\n3. [problem:ZOJ-1029] Moving Tables\n4. [problem:ZOJ-1076] Gene Assembly\n5. [problem:ZOJ-1145] Dreisam Equations\n6. [problem:ZOJ-1157] A Plug for UNIX\n\nπ-Algorithmist Backtracking\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\n吴书《数据结构编程实验》 第3章 递归与回溯\n1. [problem:UVALive-3055] Symmetric Order\n2. [problem:UVA-307] Sticks\n3. [problem:POJ-1979] Red and Black\n4. [problem:UVA-167] The Sultan\u0027s Successors\n5. [problem:UVA-539] The Settlers of Catan\n6. [problem:POJ-2083] Fractal\n7. [problem:UVA-301] Transportation\n8. [problem:UVA-639] Don\u0027t Get Rooked\n9. [problem:UVA-750] 8 Queens Chess Problem\n\n《挑战编程--程序设计竞赛训练手册》 8 Backtracking\n1. [problem:UVA-861] Little Bishops\n2. [problem:UVA-10181] 15-Puzzle Problem\n3. [problem:UVA-10128] Queue\n4. [problem:UVA-10160] Servicing Stations\n5. [problem:UVA-10032] Tug of War\n6. [problem:UVA-10001] Garden of Eden\n7. [problem:UVA-704] Colour Hash\n8. [problem:UVA-10270] Bigger Square Please...\n\n赵书 第九章 回溯法\n1. [problem:ZOJ-1166] Anagram Checker\n2. [problem:ZOJ-1213] Lumber Cutting\n3. [problem:ZOJ-2734] Exchange Cards\n\n紫书 第8章 高效算法设计(例题)\n1. [problem:UVA-120] Stacks of Flapjacks\n2. [problem:UVA-1605] Building for UN\n3. [problem:UVA-1152] 4 Values whose Sum is 0\n4. [problem:UVA-11134] Fabled Rooks\n5. [problem:UVA-11054] Wine trading in Gergovia\n6. [problem:UVA-1606] Amphiphilic Carbon Molecules\n7. [problem:UVA-11572] Unique Snowflakes\n8. [problem:UVA-1471] Defense Lines\n9. [problem:UVA-1451] Average\n10. [problem:UVA-714] Copying Books\n11. [problem:UVA-10954] Add All\n12. [problem:UVA-12627] Erratic Expansion\n13. [problem:UVA-11093] Just Finish it up\n14. [problem:UVA-1607] Gates\n15. [problem:UVA-12174] Shuffle\n16. [problem:UVA-1608] Non-boring sequences\n17. [problem:UVA-1609] Foul Play\n18. [problem:UVA-1442] Cav\n19. [problem:UVA-12265] Selling Land\n\n紫书 第8章 高效算法设计(习题)\n1. [problem:UVA-1149] Bin Packing\n2. [problem:UVA-1610] Party Games\n3. [problem:UVA-12545] Bits Equalizer\n4. [problem:UVA-11491] Erasing and Winning\n5. [problem:UVA-177] Paper Folding\n6. [problem:UVA-1611] Crane\n7. [problem:UVA-11925] Generating Permutations\n8. [problem:UVA-1612] Guess\n9. [problem:UVA-1613] K-Graph Oddity\n10. [problem:UVA-1614] Hell on the Markets\n11. [problem:UVA-1615] Highway\n12. [problem:UVA-1153] Keep the Customer Satisfied\n13. [problem:UVA-10570] Meeting with Aliens\n14. [problem:UVA-1616] Caravan Robbers\n15. [problem:UVA-1617] Laptop\n16. [problem:UVA-1618] Weak Key\n17. [problem:UVA-11536] Smallest Sub-Array\n18. [problem:UVA-1619] Feel Good\n19. [problem:UVA-1312] Cricket Field\n20. [problem:UVA-1620] Lazy Susan\n21. [problem:UVA-1621] Jumping Around\n22. [problem:UVA-1622] Robot\n23. [problem:UVA-1623] Enter The Dragon\n24. [problem:UVA-10366] Faucet Flow\n25. [problem:UVA-11175] From D to E and Back\n26. [problem:UVA-12559] Finding Black Circles\n27. [problem:UVA-1580] Pirate Chest\n28. [problem:UVA-1624] Knots\n\n吴书3 第4章 统计与二分\n1. [problem:SPOJ-PRO] Promotion\n2. [problem:ZOJ-3018] Population\n3. [problem:POJ-2155] Matrix\n4. [problem:POJ-1195] Mobile phones\n5. [problem:POJ-3728] The merchant\n6. [problem:POJ-2019] Cornfields\n7. [problem:POJ-2352] Stars\n\nπ-Algorithmist Stubs\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\n\n\n\n\n","threadId":39799,"likeCnt":1,"createTime":1543277248000,"isWorkbook":true,"viewCnt":2231,"openness":1,"fav":false,"id":746,"trustable":false}