Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"ZOJ-3190\":[\"Resource Archiver\",258,null],\"HDU-1429\":[\"胜利大逃亡(续)\",3083,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d+ACM%CA%EE%C6%DA%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A8%C8%FD%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM暑期集训队练习赛(三) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2871\":[\"Memory Control\",1055,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+7+-+Host+by+FZU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 7 - Host by FZU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1449\":[\"Maximum Sum\",557,null],\"HDU-2070\":[\"Fibbonacci Number\",18295,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%CD%F8%C2%E7%D1%A1%B0%CE%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙江工业大学网络选拔赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1217\":[\"Eight\",2673,null],\"ZOJ-1459\":[\"String Distance and Transform Process\",389,null],\"HDU-2072\":[\"单词数\",20624,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%CD%F8%C2%E7%D1%A1%B0%CE%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙江工业大学网络选拔赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4252\":[\"A Famous City\",1266,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dFudan+Local+Programming+Contest+2012\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Fudan Local Programming Contest 2012 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1576\":[\"Marriage is Stable\",565,null],\"HDU-4370\":[\"0 or 1\",1502,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+Multi-University+Training+Contest+8\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 8 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2421\":[\"Recaman\\u0027s Sequence\",1786,null],\"ZOJ-1454\":[\"Employment Planning\",859,null],\"ZOJ-3195\":[\"Design the city\",2117,null],\"HDU-1316\":[\"How Many Fibs?\",2874,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUniversity+of+Ulm+Local+Contest+2000\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Ulm Local Contest 2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2648\":[\"Shopping\",3192,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D4%F8%CA%C7%BE%AA%BA%E8%D5%D5%D3%B0%C0%B4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 曾是惊鸿照影来 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1671\":[\"Phone List\",6636,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+%A1%B0Insigma+International+Cup%A1%B1+Zhejiang+Collegiate+Programming+Contest+-+Warm+Up%A3%A83%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 “Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up(3) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4022\":[\"Bombing\",1211,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+36th+ACM%2FICPC+Asia+Regional+Shanghai+Site+%A1%AA%A1%AA+Online+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 36th ACM/ICPC Asia Regional Shanghai Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3054\":[\"Fibonacci\",155,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+15+-+Host+by+BUAA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 15 - Host by BUAA \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4268\":[\"Alice and Bob\",1344,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+ACM%2FICPC+Asia+Regional+Changchun+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Changchun Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1346\":[\"Comparing Your Heroes\",397,null],\"ZOJ-1107\":[\"FatMouse and Cheese\",2366,null],\"ZOJ-1227\":[\"Free Candies\",910,null],\"HDU-4020\":[\"Ads Proposal\",496,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+36th+ACM%2FICPC+Asia+Regional+Shanghai+Site+%A1%AA%A1%AA+Warmup\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 36th ACM/ICPC Asia Regional Shanghai Site —— Warmup \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1463\":[\"Brackets Sequence\",737,null],\"ZOJ-1103\":[\"Hike on a Graph\",1114,null],\"ZOJ-1344\":[\"A Mazing Problem\",984,null],\"HDU-4261\":[\"Estimation\",295,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+University+of+Chicago+Invitational+Programming+Contest+2012\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The University of Chicago Invitational Programming Contest 2012 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2672\":[\"Fibonacci Subsequence\",767,null],\"ZOJ-1462\":[\"Team Them Up!\",230,null],\"HDU-1568\":[\"Fibonacci\",3021,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHappy+2007\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Happy 2007 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1329\":[\"Hanoi Tower Troubles Again!\",777,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dOIBH+Reminiscence+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e OIBH Reminiscence Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3509\":[\"Buge\\u0027s Fibonacci Number Problem\",285,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A88%A3%A9%A1%AA%A1%AAHost+by+ECNU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(8)——Host by ECNU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3601\":[\"Tower of Hanoi\",584,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPKU+Campus+2008+%28POJ+Founder+Monthly+Contest+%E2%80%93+2008.05.10%29\\\"\\u003ePKU Campus 2008 (POJ Founder Monthly Contest – 2008.05.10)\\u003c/a\\u003e, xfxyjwf\\u003c/div\\u003e\"],\"HDU-4277\":[\"USACO ORZ\",1322,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+ACM%2FICPC+Asia+Regional+Changchun+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Changchun Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1109\":[\"Language of FatMouse\",6450,null],\"ZOJ-1108\":[\"FatMouse\\u0027s Speed\",2894,null],\"ZOJ-1900\":[\"Forests\",406,null],\"ZOJ-3408\":[\"Gao\",467,null],\"ZOJ-2319\":[\"Beautiful People\",929,null],\"ZOJ-1902\":[\"Hay Points\",1039,null],\"ZOJ-2206\":[\"Roll Playing Games\",60,null],\"ZOJ-1239\":[\"Hanoi Tower Troubles Again!\",3136,null],\"ZOJ-3412\":[\"Special Special Judge II\",179,null],\"ZOJ-1596\":[\"Hamming Problem\",903,null],\"ZOJ-1475\":[\"Ranklist\",303,null],\"ZOJ-2202\":[\"Alphacode\",1348,null],\"ZOJ-1474\":[\"Counter Strike\",5,null],\"ZOJ-1353\":[\"Unimodal Palindromic Decompositions\",557,null],\"ZOJ-1234\":[\"Chopsticks\",1812,null],\"ZOJ-1470\":[\"How Many Trees?\",231,null],\"HDU-4725\":[\"The Shortest Path in Nya Graph\",2867,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+ACM%2FICPC+Asia+Regional+Online+%A1%AA%A1%AA+Warmup2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Online —— Warmup2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1456\":[\"Transportation\",166,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM%CA%EE%C6%DA%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A8%C6%DF%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM暑期集训队练习赛(七) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4288\":[\"Coder\",1549,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+ACM%2FICPC+Asia+Regional+Chengdu+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Chengdu Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4286\":[\"Data Handler\",461,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+ACM%2FICPC+Asia+Regional+Tianjin+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Tianjin Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3873\":[\"Invade the Mars\",624,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Multi-University+Training+Contest+4+-+Host+by+SDU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Multi-University Training Contest 4 - Host by SDU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4841\":[\"圆桌问题\",4382,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAHOI1999\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e AHOI1999 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2338\":[\"The Towers of Hanoi Revisited\",386,null],\"ZOJ-3427\":[\"Array Slicing\",199,null],\"ZOJ-2339\":[\"Hyperhuffman\",890,null],\"ZOJ-1368\":[\"BOAT\",37,null],\"ZOJ-2337\":[\"Non Absorbing DFA\",291,null],\"ZOJ-1249\":[\"Pushing Boxes\",411,null],\"ZOJ-2213\":[\"Fun Game\",47,null],\"ZOJ-2214\":[\"Square\",28,null],\"ZOJ-1004\":[\"Anagrams by Stack\",7592,null],\"ZOJ-1245\":[\"Triangles\",1198,null],\"ZOJ-1366\":[\"Cash Machine\",2427,null],\"ZOJ-1484\":[\"Minimum Inversion Number\",1719,null],\"ZOJ-1483\":[\"Robots\",289,null],\"HDU-4857\":[\"逃生\",3127,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%231\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1588\":[\"Gauss Fibonacci\",1303,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+%A1%B0Valentines+Day%A1%B1+Open+Programming+Contest+2007-02-14\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU “Valentines Day” Open Programming Contest 2007-02-14 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4858\":[\"项目管理\",1020,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%231\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1920\":[\"Towers of Hanoi\",725,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCEOI+2003\\\"\\u003eCEOI 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1466\":[\"计算直线的交点数\",4101,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM%CA%EE%C6%DA%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A8%BE%C5%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM暑期集训队练习赛(九) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-3309\":[\"Search New Posts\",327,null],\"ZOJ-1259\":[\"Rails\",3266,null],\"ZOJ-2349\":[\"Mix and Build\",127,null],\"ZOJ-1016\":[\"Parencodings\",5474,null],\"ZOJ-2589\":[\"Circles\",371,null],\"ZOJ-2227\":[\"Minimax Triangulation\",52,null],\"ZOJ-2104\":[\"Let the Balloon Rise\",6799,null],\"ZOJ-1136\":[\"Multiple\",2004,null],\"ZOJ-1499\":[\"Increasing Sequences\",486,null],\"ZOJ-2341\":[\"Quantization Problem\",188,null],\"ZOJ-1250\":[\"Always On the Run\",372,null],\"ZOJ-1011\":[\"NTA\",1194,null],\"ZOJ-1490\":[\"Satellite Antenna\",28,null],\"HDU-1237\":[\"简单计算器\",10864,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%B4%F3%BC%C6%CB%E3%BB%FA%D1%D0%BE%BF%C9%FA%B8%B4%CA%D4%C9%CF%BB%FA%BF%BC%CA%D4-2006%C4%EA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙大计算机研究生复试上机考试-2006年 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2680\":[\"Choose the best route\",5327,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009%D5%E3%BD%AD%B4%F3%D1%A7%BC%C6%CB%E3%BB%FA%D1%D0%BF%BC%B8%B4%CA%D4%A3%A8%BB%FA%CA%D4%B2%BF%B7%D6%A3%A9%A1%AA%A1%AA%C8%AB%D5%E6%C4%A3%C4%E2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009浙江大学计算机研考复试(机试部分)——全真模拟 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1596\":[\"find the safest road\",4505,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-Spring+Programming+Contest+-+Warm+Up+%A3%A81%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-Spring Programming Contest - Warm Up (1) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1113\":[\"Word Amalgamation\",2527,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Central+USA+1998\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central USA 1998 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1149\":[\"Dividing\",2447,null],\"ZOJ-2118\":[\"Christopher\\u0027s Rainy Day\",71,null],\"ZOJ-1027\":[\"Human Gene Functions\",3268,null],\"ZOJ-2238\":[\"Code\",86,null],\"ZOJ-1387\":[\"Decoding Morse Sequences\",819,null],\"ZOJ-2115\":[\"Dangerous Pattern\",36,null],\"ZOJ-3201\":[\"Tree of Tree\",1828,null],\"ZOJ-1147\":[\"Formatting Text\",158,null],\"ZOJ-2354\":[\"Elevator Stopping Plan\",67,null],\"ZOJ-1025\":[\"Wooden Sticks\",4909,null],\"ZOJ-1267\":[\"Mapping the Route\",50,null],\"ZOJ-3321\":[\"Circle\",986,null],\"ZOJ-2353\":[\"Special Experiment\",64,null],\"ZOJ-1022\":[\"Parallel Expectations\",148,null],\"HDU-1908\":[\"Double Queue\",620,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSoutheastern+Europe+2007\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Southeastern Europe 2007 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3306\":[\"Another kind of Fibonacci\",1321,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+Monthly+Contest+%A8C+2010.02.06+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.02.06 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4879\":[\"ZCC loves march\",223,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014+Multi-University+Training+Contest+2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 Multi-University Training Contest 2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1828\":[\"Fibonacci Numbers\",2980,null],\"HDU-1242\":[\"Rescue\",9362,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZOJ+Monthly%2C+October+2003\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ZOJ Monthly, October 2003 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1944\":[\"Tree Recovery\",1810,null],\"HDU-1004\":[\"Let the Balloon Rise\",60290,\"\\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\"],\"ZOJ-1705\":[\"Exchange Rates\",165,null],\"HDU-4631\":[\"Sad Love Story\",400,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+Multi-University+Training+Contest+3\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 3 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1825\":[\"Compound Words\",869,null],\"ZOJ-2008\":[\"Invitation Cards\",1570,null],\"HDU-5040\":[\"Instrusive\",421,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014+ACM%2FICPC+Asia+Regional+Beijing+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 ACM/ICPC Asia Regional Beijing Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1038\":[\"T9\",804,null],\"ZOJ-2127\":[\"Zuma\",74,null],\"ZOJ-1711\":[\"Sum It Up\",2161,null],\"ZOJ-1156\":[\"Unscrambling Images\",240,null],\"ZOJ-1276\":[\"Optimal Array Multiplication Sequence\",971,null],\"ZOJ-2244\":[\"Land Division Tax\",54,null],\"ZOJ-2366\":[\"Weird Dissimilarity\",234,null],\"ZOJ-2242\":[\"Huffman\\u0027s Greed\",49,null],\"ZOJ-1151\":[\"Word Reversal\",8996,null],\"HDU-1250\":[\"Hat\\u0027s Fibonacci\",3988,\"\"],\"HDU-1257\":[\"最少拦截系统\",26022,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙江工业大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-3348\":[\"Schedule\",303,null],\"ZOJ-3228\":[\"Searching the String\",2544,null],\"ZOJ-3467\":[\"3D Knight Moves\",148,null],\"ZOJ-3225\":[\"Maze\",149,null],\"ZOJ-2136\":[\"Longest Ordered Subsequence\",3480,null],\"ZOJ-1167\":[\"Trees on the Level\",1035,null],\"ZOJ-2255\":[\"Best Editor\",4,null],\"ZOJ-1163\":[\"The Staircases\",2766,null],\"ZOJ-2374\":[\"Marbles on a tree\",212,null],\"ZOJ-2254\":[\"Island Country\",155,null],\"ZOJ-2372\":[\"Work Reduction\",96,null],\"HDU-3328\":[\"Flipper\",620,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dEast+Central+North+America+2009\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e East Central North America 2009 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1029\":[\"Ignatius and the Princess IV\",21637,\"\"],\"HDU-1702\":[\"ACboy needs your help again!\",9508,\"\\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%A81%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(1) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1022\":[\"Train Problem I\",17853,\"\"],\"HDU-4099\":[\"Revenge of Fibonacci\",598,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Asia+Shanghai+Regional+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Asia Shanghai Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1021\":[\"Fibonacci Again\",33538,\"\"],\"HDU-1142\":[\"A Walk Through the Forest\",2786,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUniversity+of+Waterloo+Local+Contest+2005.09.24\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Waterloo Local Contest 2005.09.24 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1263\":[\"水果\",6392,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙江工业大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1387\":[\"Team Queue\",1367,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUniversity+of+Ulm+Local+Contest+1998\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Ulm Local Contest 1998 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2112\":[\"HDU Today\",6718,\"\\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%A8%CA%B1%BC%E4%D2%D1%B6%A8%A3%A1%A3%A1%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM程序设计_期末考试(时间已定!!) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1026\":[\"Ignatius and the Princess I\",5943,\"\"],\"ZOJ-1610\":[\"Count the Colors\",13016,null],\"ZOJ-2029\":[\"The Intervals\",525,null],\"ZOJ-1174\":[\"Skip Letter Code\",134,null],\"ZOJ-2264\":[\"Confusing Login Names\",54,null],\"ZOJ-3354\":[\"DoIt is Being Flooded\",84,null],\"ZOJ-2144\":[\"Sending Gift\",18,null],\"ZOJ-3230\":[\"Solving the Problems\",682,null],\"ZOJ-2142\":[\"Light The Square\",33,null],\"HDU-1272\":[\"小希的迷宫\",17270,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2006-4+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2006-4 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1857\":[\"Fire Station\",354,null],\"HDU-4302\":[\"Holedox Eating\",1147,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+Multi-University+Training+Contest+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4786\":[\"Fibonacci Tree\",2187,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+Asia+Chengdu+Regional+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Asia Chengdu Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2954\":[\"Hanoi Tower\",938,null],\"ZOJ-1985\":[\"Largest Rectangle in a Histogram\",1222,null],\"ZOJ-1503\":[\"One Person \\\"The Price is Right\\\"\",837,null],\"ZOJ-1986\":[\"Bridging Signals\",2008,null],\"ZOJ-2398\":[\"Islands and Bridges\",99,null],\"ZOJ-2156\":[\"Charlie\\u0027s Change\",302,null],\"ZOJ-2278\":[\"Fight for Food\",94,null],\"ZOJ-2397\":[\"Tian Ji -- The Horse Racing\",1114,null],\"ZOJ-2031\":[\"Song List\",91,null],\"HDU-1708\":[\"Fibonacci String\",2857,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-Spring+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-Spring Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1060\":[\"Sorting It All Out\",1966,null],\"ZOJ-2271\":[\"Chance to Encounter a Girl\",473,null],\"ZOJ-1181\":[\"Word Amalgamation\",1521,null],\"ZOJ-1062\":[\"Trees Made to Order\",1201,null],\"ZOJ-1183\":[\"Scheduling Lectures\",460,null],\"ZOJ-1061\":[\"Web Navigation\",2718,null],\"HDU-2018\":[\"母牛的故事\",69220,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dC%D3%EF%D1%D4%B3%CC%D0%F2%C9%E8%BC%C6%C1%B7%CF%B0%A3%A8%C8%FD%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e C语言程序设计练习(三) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1190\":[\"Optimal Programs\",426,null],\"HDU-2814\":[\"Interesting Fibonacci\",239,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+1st+%A1%B0Old-Vegetable-Birds+Cup%A1%B1+Programming+Open+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 1st “Old-Vegetable-Birds Cup” Programming Open Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1848\":[\"Fibonacci again and again\",5590,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM+Short+Term+Exam_2007%2F12%2F13\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM Short Term Exam_2007/12/13 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1043\":[\"Eight\",5251,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSouth+Central+USA+1998+%28Sepcial+Judge+Module+By+JGShining%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e South Central USA 1998 (Sepcial Judge Module By JGShining) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1505\":[\"Solitaire\",687,null],\"HDU-4557\":[\"非诚勿扰\",945,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013%BD%F0%C9%BD%CE%F7%C9%BD%BE%D3%B4%B4%D2%E2%D3%CE%CF%B7%B3%CC%D0%F2%CC%F4%D5%BD%C8%FC%A1%AA%A1%AA%B8%B4%C8%FC%A3%A81%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013金山西山居创意游戏程序挑战赛——复赛(1) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2835\":[\"Magic Square\",2903,null],\"ZOJ-1512\":[\"Water Treatment Plants\",89,null],\"ZOJ-1633\":[\"Big String\",1127,null],\"ZOJ-1635\":[\"Directory Listing\",1644,null],\"ZOJ-1196\":[\"Fast Food\",1451,null],\"ZOJ-1074\":[\"To the Max\",5304,null],\"ZOJ-2284\":[\"Inversion Number\",738,null],\"HDU-1719\":[\"Friend\",1499,\"\\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%A82%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3572\":[\"Hanoi Towers\",215,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2007\\\"\\u003eNortheastern Europe 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"ZOJ-2283\":[\"Challenge of Wisdom\",289,null],\"ZOJ-2280\":[\"Key to Freedom\",74,null],\"ZOJ-2281\":[\"Way to Freedom\",587,null],\"HDU-3117\":[\"Fibonacci Numbers\",1406,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dIPCP+2005+Northern+Preliminary+for+Northeast+North-America\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e IPCP 2005 Northern Preliminary for Northeast North-America \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1053\":[\"Entropy\",3073,\"\\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\"],\"HDU-4441\":[\"Queue Sequence\",321,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+Asia+Tianjin+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Asia Tianjin Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1515\":[\"Square Lottery\",162,null],\"POJ-1958\":[\"Strange Towers of Hanoi\",2968,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTUD+Programming+Contest+2002\\\"\\u003eTUD Programming Contest 2002\\u003c/a\\u003e, Darmstadt, Germany\\u003c/div\\u003e\"],\"ZOJ-2613\":[\"Auction\",1212,null],\"ZOJ-1524\":[\"Supermarket\",829,null],\"ZOJ-2059\":[\"The Twin Towers\",1128,null],\"ZOJ-1521\":[\"Not Too Convex Hull\",52,null],\"ZOJ-2971\":[\"Give Me the Number\",2658,null],\"ZOJ-2058\":[\"The Archaeologist\\u0027s Trouble II\",422,null],\"ZOJ-1520\":[\"Duty Free Shop\",849,null],\"ZOJ-2297\":[\"Survival\",484,null],\"ZOJ-1083\":[\"Frame Stacking\",1087,null],\"ZOJ-2180\":[\"City Game\",571,null],\"ZOJ-1409\":[\"Communication System\",1021,null],\"ZOJ-1655\":[\"Transport Goods\",1895,null],\"HDU-1181\":[\"变形课\",9404,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dGardon-DYGG+Contest+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Gardon-DYGG Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1180\":[\"诡异的楼梯\",4057,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dGardon-DYGG+Contest+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Gardon-DYGG Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2189\":[\"Exact Change Only\",358,null],\"ZOJ-2068\":[\"Chopsticks\",191,null],\"ZOJ-2069\":[\"Greatest Least Common Multiple\",110,null],\"ZOJ-3397\":[\"Change the Major\",188,null],\"ZOJ-1097\":[\"Code the Tree\",1107,null],\"ZOJ-2067\":[\"White Rectangles\",949,null],\"ZOJ-1093\":[\"Monkey and Banana\",3069,null],\"ZOJ-2060\":[\"Fibonacci Again\",6019,null],\"ZOJ-1094\":[\"Matrix Chain Multiplication\",3566,null],\"HDU-1515\":[\"Anagrams by Stack\",1209,\"\\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\"],\"HDU-1075\":[\"What Are You Talking About\",8372,\"\"],\"HDU-4585\":[\"Shaolin\",2155,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013ACM-ICPC%BA%BC%D6%DD%C8%FC%C7%F8%C8%AB%B9%FA%D1%FB%C7%EB%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013ACM-ICPC杭州赛区全国邀请赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1870\":[\"愚人节的礼物\",9447,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008%BA%BC%B5%E7%BC%AF%D1%B5%B6%D3%D1%A1%B0%CE%C8%FC%A1%AA%A1%AA%C8%C8%C9%ED%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008杭电集训队选拔赛——热身赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2747\":[\"Paint the Wall\",499,null],\"HDU-1873\":[\"看病要排队\",8622,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008%D5%E3%B4%F3%D1%D0%BE%BF%C9%FA%B8%B4%CA%D4%C8%C8%C9%ED%C8%FC%A3%A82%A3%A9%A1%AA%A1%AA%C8%AB%D5%E6%C4%A3%C4%E2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008浙大研究生复试热身赛(2)——全真模拟 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1539\":[\"Lot\",2218,null],\"ZOJ-1424\":[\"Painting A Board\",194,null],\"ZOJ-1303\":[\"Jury Compromise\",315,null],\"ZOJ-1423\":[\"(Your)((Term)((Project)))\",1535,null],\"ZOJ-1665\":[\"Rational Irrationals\",38,null],\"ZOJ-1425\":[\"Crossed Matchings\",1056,null],\"ZOJ-1788\":[\"Quad Trees\",1255,null],\"HDU-3371\":[\"Connect the Cities\",3292,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+Monthly+Contest+%A8C+2010.04.04\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.04.04 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1540\":[\"Censored!\",307,null],\"HDU-1509\":[\"Windows Message Queue\",3559,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZhejiang+University+Local+Contest+2006%2C+Preliminary\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Zhejiang University Local Contest 2006, Preliminary \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2991\":[\"Flipping Burned Pancakes\",104,null],\"HDU-3823\":[\"Prime Friend\",881,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+6th+Central+China+Invitational+Programming+Contest+and+9th+Wuhan+University+Programming+Contest+Final\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 6th Central China Invitational Programming Contest and 9th Wuhan University Programming Contest Final \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2081\":[\"Mission Impossible\",403,null],\"HDU-2855\":[\"Fibonacci Check-up\",878,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+5+-+Host+by+NUDT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 5 - Host by NUDT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1428\":[\"Magazine Delivery\",707,null],\"HDU-4114\":[\"Disney\\u0027s FastPass\",485,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Asia+ChengDu+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Asia ChengDu Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2526\":[\"FatMouse and JavaBean II\",247,null],\"ZOJ-2402\":[\"Lenny\\u0027s Lucky Lotto Lists\",988,null],\"ZOJ-2401\":[\"Zipper\",1368,null],\"ZOJ-1551\":[\"Cricket Field\",112,null],\"ZOJ-1554\":[\"Folding\",189,null],\"ZOJ-3059\":[\"Die Board Game\",252,null],\"ZOJ-2089\":[\"Learn to Write\",19,null],\"ZOJ-1671\":[\"Walking Ant\",680,null],\"ZOJ-3172\":[\"Extend 7-day Vacation\",302,null],\"HDU-1896\":[\"Stones\",3326,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2008-4+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2008-4 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1535\":[\"Invitation Cards\",1929,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dCentral+Europe+1998\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Central Europe 1998 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2529\":[\"A+B in Hogwarts\",1011,null],\"HDU-4006\":[\"The kth great number\",4805,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+36th+ACM%2FICPC+Asia+Regional+Dalian+Site+%A1%AA%A1%AA+Online+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1319\":[\"Black Box\",525,null],\"ZOJ-1204\":[\"Additive equations\",4335,null],\"ZOJ-1446\":[\"Hyper-Prime Expression\",78,null],\"ZOJ-1567\":[\"Restaurant\",20,null],\"ZOJ-2416\":[\"Open the Lock\",1591,null],\"ZOJ-2897\":[\"Desmond\\u0027s Ambition\",35,null],\"ZOJ-1206\":[\"Win the Bonus\",715,null],\"ZOJ-2414\":[\"Index of Prime\",466,null],\"ZOJ-1200\":[\"Mining\",904,null],\"ZOJ-1563\":[\"Pearls\",596,null],\"ZOJ-2411\":[\"Link Link Look\",340,null],\"ZOJ-1201\":[\"Inversion\",3956,null],\"ZOJ-2770\":[\"Burn the Linked Camp\",2946,null],\"ZOJ-2096\":[\"Door to Secret\",284,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"tigerisland45","updateTime":1552943302000,"title":"赵端阳《算法设计与分析--以ACM-ICPC为例》题目一览","dislikeCnt":0,"content":"\n[海岛Blog](http://blog.csdn.net/tigerisland45)\n\n[挑战ACM编程](https://cn.vjudge.net/group/challenge)是自由参与组。提供挑战题、水题、白书、紫书和蓝书等等......\n\n赵端阳《算法设计与分析--以ACM-ICPC为例》题目一览\n\n第2章数据结构和STL(例题)\n1. [problem:ZOJ-1004] Anagrams by Stack\n2. [problem:ZOJ-1094] Matrix Chain Multiplication\n3. [problem:ZOJ-1011] NTA\n4. [problem:ZOJ-1062] Trees Made to Order\n5. [problem:ZOJ-1097] Code the Tree\n6. [problem:ZOJ-1156] Unscrambling Images\n7. [problem:ZOJ-1167] Trees on the Level\n8. [problem:ZOJ-1016] Parencodings\n9. [problem:ZOJ-1944] Tree Recovery\n10. [problem:ZOJ-2104] Let the Balloon Rise\n\n第2章数据结构和STL(习题:ZOJ与HDU堆栈)\n1. [problem:ZOJ-1061] Web Navigation\n2. [problem:ZOJ-1151] Word Reversal\n3. [problem:ZOJ-1190] Optimal Programs\n4. [problem:ZOJ-1259] Rails\n5. [problem:ZOJ-1267] Mapping the Route\n6. [problem:ZOJ-1423] \\(Your\\)\\(\\(Term\\)\\(\\(Project\\)\\)\\)\n7. [problem:ZOJ-1635] Directory Listing\n8. [problem:ZOJ-1985] Largest Rectangle in a Histogram\n9. [problem:ZOJ-1986] Bridging Signals\n10. [problem:ZOJ-2238] Code\n11. [problem:ZOJ-2529] A+B in Hogwarts\n12. [problem:ZOJ-2954] Hanoi Tower\n13. [problem:ZOJ-2991] Flipping Burned Pancakes\n14. [problem:ZOJ-3354] DoIt is Being Flooded\n15. [problem:HDU-1022] Train Problem I\n16. [problem:HDU-1237] 简单计算器\n17. [problem:HDU-1515] Anagrams by Stack\n18. [problem:HDU-1702] ACboy needs your help again!\n19. [problem:HDU-1870] 愚人节的礼物\n20. [problem:HDU-3328] Flipper\n\n第2章数据结构和STL(习题:ZOJ与HDU向量)\n1. [problem:ZOJ-1174] Skip Letter Code\n2. [problem:ZOJ-1204] Additive equations\n3. [problem:ZOJ-1227] Free Candies\n4. [problem:ZOJ-1409] Communication System\n5. [problem:ZOJ-1705] Exchange Rates\n6. [problem:ZOJ-1857] Fire Station\n7. [problem:ZOJ-2029] The Intervals\n8. [problem:ZOJ-2526] FatMouse and JavaBean II\n9. [problem:ZOJ-2613] Auction\n10. [problem:ZOJ-2897] Desmond\u0027s Ambition\n11. [problem:ZOJ-3201] Tree of Tree\n12. [problem:ZOJ-3225] Maze\n13. [problem:ZOJ-3309] Search New Posts\n14. [problem:ZOJ-3412] Special Special Judge II\n15. [problem:ZOJ-3427] Array Slicing\n16. [problem:ZOJ-3467] 3D Knight Moves\n17. [problem:HDU-1113] Word Amalgamation\n18. [problem:HDU-1181] 变形课\n19. [problem:HDU-1257] 最少拦截系统\n20. [problem:HDU-2648] Shopping\n21. [problem:HDU-2871] Memory Control\n22. [problem:HDU-3823] Prime Friend\n23. [problem:HDU-4288] Coder\n24. [problem:HDU-4557] 非诚勿扰\n25. [problem:HDU-4841] 圆桌问题\n26. [problem:HDU-4858] 项目管理\n\n第2章数据结构和STL(习题:ZOJ和HDU映射)\n1. [problem:ZOJ-1038] T9\n2. [problem:ZOJ-1109] Language of FatMouse\n3. [problem:ZOJ-1576] Marriage is Stable\n4. [problem:ZOJ-1610] Count the Colors\n5. [problem:ZOJ-1902] Hay Points\n6. [problem:ZOJ-2613] Auction\n7. [problem:ZOJ-2971] Give Me the Number\n8. [problem:ZOJ-3309] Search New Posts\n9. [problem:ZOJ-3354] DoIt is Being Flooded\n10. [problem:ZOJ-3467] 3D Knight Moves\n11. [problem:HDU-1004] Let the Balloon Rise\n12. [problem:HDU-1029] Ignatius and the Princess IV\n13. [problem:HDU-1075] What Are You Talking About\n14. [problem:HDU-1263] 水果\n15. [problem:HDU-1719] Friend\n16. [problem:HDU-1908] Double Queue\n17. [problem:HDU-2112] HDU Today\n18. [problem:HDU-4022] Bombing\n19. [problem:HDU-4302] Holedox Eating\n20. [problem:HDU-4585] Shaolin\n\n第2章数据结构和STL(习题:ZOJ和HDU链表)\n1. [problem:ZOJ-1181] Word Amalgamation\n2. [problem:ZOJ-1201] Inversion\n3. [problem:ZOJ-1596] Hamming Problem\n4. [problem:ZOJ-1635] Directory Listing\n5. [problem:ZOJ-1655] Transport Goods\n6. [problem:ZOJ-1665] Rational Irrationals\n7. [problem:ZOJ-2339] Hyperhuffman\n8. [problem:ZOJ-3195] Design the city\n9. [problem:ZOJ-3309] Search New Posts\n10. [problem:ZOJ-3427] Array Slicing\n11. [problem:HDU-1671] Phone List\n12. [problem:HDU-4286] Data Handler\n\n第2章数据结构和STL(习题:ZOJ和HDU集合)\n1. [problem:ZOJ-1083] Frame Stacking\n2. [problem:ZOJ-1217] Eight\n3. [problem:ZOJ-1319] Black Box\n4. [problem:ZOJ-1505] Solitaire\n5. [problem:ZOJ-1711] Sum It Up\n6. [problem:ZOJ-1825] Compound Words\n7. [problem:ZOJ-1900] Forests\n8. [problem:ZOJ-2421] Recaman\u0027s Sequence\n9. [problem:ZOJ-2589] Circles\n10. [problem:ZOJ-2747] Paint the Wall\n11. [problem:ZOJ-2835] Magic Square\n12. [problem:ZOJ-3059] Die Board Game\n13. [problem:ZOJ-3230] Solving the Problems\n14. [problem:ZOJ-3397] Change the Major\n15. [problem:HDU-1272] 小希的迷宫\n16. [problem:HDU-1466] 计算直线的交点数\n17. [problem:HDU-2072] 单词数\n18. [problem:HDU-4020] Ads Proposal\n19. [problem:HDU-4022] Bombing\n20. [problem:HDU-4252] A Famous City\n21. [problem:HDU-4268] Alice and Bob\n22. [problem:HDU-4277] USACO ORZ\n23. [problem:HDU-4302] Holedox Eating\n24. [problem:HDU-4585] Shaolin\n25. [problem:HDU-4631] Sad Love Story\n26. [problem:HDU-4879] ZCC loves march\n\n第2章数据结构和STL(习题:ZOJ和HDU队列)\n1. [problem:ZOJ-1060] Sorting It All Out\n2. [problem:ZOJ-1103] Hike on a Graph\n3. [problem:ZOJ-1344] A Mazing Problem\n4. [problem:ZOJ-1671] Walking Ant\n5. [problem:ZOJ-1788] Quad Trees\n6. [problem:ZOJ-2008] Invitation Cards\n7. [problem:ZOJ-2031] Song List\n8. [problem:ZOJ-2411] Link Link Look\n9. [problem:ZOJ-2416] Open the Lock\n10. [problem:ZOJ-2770] Burn the Linked Camp\n11. [problem:ZOJ-3172] Extend 7-day Vacation\n12. [problem:ZOJ-3190] Resource Archiver\n13. [problem:ZOJ-3228] Searching the String\n14. [problem:ZOJ-3321] Circle\n15. [problem:ZOJ-3348] Schedule\n16. [problem:ZOJ-3408] Gao\n17. [problem:HDU-1026] Ignatius and the Princess I\n18. [problem:HDU-1043] Eight\n19. [problem:HDU-1053] Entropy\n20. [problem:HDU-1142] A Walk Through the Forest\n21. [problem:HDU-1180] 诡异的楼梯\n22. [problem:HDU-1242] Rescue\n23. [problem:HDU-1387] Team Queue\n24. [problem:HDU-1429] 胜利大逃亡(续)\n25. [problem:HDU-1456] Transportation\n26. [problem:HDU-1509] Windows Message Queue\n27. [problem:HDU-1535] Invitation Cards\n28. [problem:HDU-1596] find the safest road\n29. [problem:HDU-1873] 看病要排队\n30. [problem:HDU-1896] Stones\n31. [problem:HDU-2680] Choose the best route\n32. [problem:HDU-3371] Connect the Cities\n33. [problem:HDU-4006] The kth great number\n34. [problem:HDU-4114] Disney\u0027s FastPass\n35. [problem:HDU-4261] Estimation\n36. [problem:HDU-4302] Holedox Eating\n37. [problem:HDU-4370] 0 or 1\n38. [problem:HDU-4441] Queue Sequence\n39. [problem:HDU-4725] The Shortest Path in Nya Graph\n40. [problem:HDU-4857] 逃生\n41. [problem:HDU-3873] Invade the Mars\n42. [problem:HDU-5040] Instrusive\n\n第3章递归与分治(例题与习题)\n1. [problem:ZOJ-1633] Big String\n\nHanoi塔\n1. [problem:ZOJ-1239] Hanoi Tower Troubles Again!\n2. [problem:ZOJ-2338] The Towers of Hanoi Revisited\n3. [problem:ZOJ-2954] Hanoi Tower\n4. [problem:POJ-1920] Towers of Hanoi\n5. [problem:POJ-3572] Hanoi Towers\n6. [problem:POJ-3601] Tower of Hanoi\n7. [problem:POJ-1958] Strange Towers of Hanoi\n\nFibonacci数列\n1. [problem:ZOJ-1828] Fibonacci Numbers\n2. [problem:ZOJ-2060] Fibonacci Again\n3. [problem:ZOJ-2672] Fibonacci Subsequence\n4. [problem:HDU-1021] Fibonacci Again\n5. [problem:HDU-1250] Hat\u0027s Fibonacci\n6. [problem:HDU-1316] How Many Fibs?\n7. [problem:HDU-1329] Hanoi Tower Troubles Again!\n8. [problem:HDU-1568] Fibonacci\n9. [problem:HDU-1588] Gauss Fibonacci\n10. [problem:HDU-1708] Fibonacci String\n11. [problem:HDU-1848] Fibonacci again and again\n12. [problem:HDU-2018] 母牛的故事\n13. [problem:HDU-2070] Fibbonacci Number\n14. [problem:HDU-2814] Interesting Fibonacci\n15. [problem:HDU-2855] Fibonacci Check-up\n16. [problem:HDU-3054] Fibonacci\n17. [problem:HDU-3117] Fibonacci Numbers\n18. [problem:HDU-3306] Another kind of Fibonacci\n19. [problem:HDU-3509] Buge\u0027s Fibonacci Number Problem\n20. [problem:HDU-4099] Revenge of Fibonacci\n21. [problem:HDU-4786] Fibonacci Tree\n\n第4章动态规划(例题)\n1. [problem:ZOJ-1027] Human Gene Functions\n2. [problem:ZOJ-1074] To the Max\n3. [problem:ZOJ-1093] Monkey and Banana\n4. [problem:ZOJ-1107] FatMouse and Cheese\n5. [problem:ZOJ-1108] FatMouse\u0027s Speed\n6. [problem:ZOJ-1147] Formatting Text\n7. [problem:ZOJ-1149] Dividing\n8. [problem:ZOJ-1163] The Staircases\n9. [problem:ZOJ-1183] Scheduling Lectures\n10. [problem:ZOJ-1196] Fast Food\n11. [problem:ZOJ-1206] Win the Bonus\n12. [problem:ZOJ-1227] Free Candies\n13. [problem:ZOJ-1234] Chopsticks\n\n第4章动态规划(习题)\n1. [problem:ZOJ-1022] Parallel Expectations\n2. [problem:ZOJ-1025] Wooden Sticks\n3. [problem:ZOJ-1094] Matrix Chain Multiplication\n4. [problem:ZOJ-1136] Multiple\n5. [problem:ZOJ-1200] Mining\n6. [problem:ZOJ-1245] Triangles\n7. [problem:ZOJ-1249] Pushing Boxes\n8. [problem:ZOJ-1250] Always On the Run\n9. [problem:ZOJ-1276] Optimal Array Multiplication Sequence\n10. [problem:ZOJ-1303] Jury Compromise\n11. [problem:ZOJ-1346] Comparing Your Heroes\n12. [problem:ZOJ-1353] Unimodal Palindromic Decompositions\n13. [problem:ZOJ-1366] Cash Machine\n14. [problem:ZOJ-1368] BOAT\n15. [problem:ZOJ-1387] Decoding Morse Sequences\n16. [problem:ZOJ-1424] Painting A Board\n17. [problem:ZOJ-1425] Crossed Matchings\n18. [problem:ZOJ-1428] Magazine Delivery\n19. [problem:ZOJ-1446] Hyper-Prime Expression\n20. [problem:ZOJ-1449] Maximum Sum\n21. [problem:ZOJ-1454] Employment Planning\n22. [problem:ZOJ-1459] String Distance and Transform Process\n23. [problem:ZOJ-1462] Team Them Up!\n24. [problem:ZOJ-1463] Brackets Sequence\n25. [problem:ZOJ-1470] How Many Trees?\n26. [problem:ZOJ-1474] Counter Strike\n27. [problem:ZOJ-1475] Ranklist\n28. [problem:ZOJ-1483] Robots\n29. [problem:ZOJ-1484] Minimum Inversion Number\n30. [problem:ZOJ-1490] Satellite Antenna\n31. [problem:ZOJ-1499] Increasing Sequences\n32. [problem:ZOJ-1503] One Person \"The Price is Right\"\n33. [problem:ZOJ-1512] Water Treatment Plants\n34. [problem:ZOJ-1515] Square Lottery\n35. [problem:ZOJ-1520] Duty Free Shop\n36. [problem:ZOJ-1521] Not Too Convex Hull\n37. [problem:ZOJ-1524] Supermarket\n38. [problem:ZOJ-1539] Lot\n39. [problem:ZOJ-1540] Censored!\n40. [problem:ZOJ-1551] Cricket Field\n41. [problem:ZOJ-1554] Folding\n42. [problem:ZOJ-1563] Pearls\n43. [problem:ZOJ-1567] Restaurant\n44. [problem:ZOJ-2058] The Archaeologist\u0027s Trouble II\n45. [problem:ZOJ-2059] The Twin Towers\n46. [problem:ZOJ-2067] White Rectangles\n47. [problem:ZOJ-2068] Chopsticks\n48. [problem:ZOJ-2069] Greatest Least Common Multiple\n49. [problem:ZOJ-2081] Mission Impossible\n50. [problem:ZOJ-2089] Learn to Write\n51. [problem:ZOJ-2096] Door to Secret\n52. [problem:ZOJ-2115] Dangerous Pattern\n53. [problem:ZOJ-2118] Christopher\u0027s Rainy Day\n54. [problem:ZOJ-2127] Zuma\n55. [problem:ZOJ-2136] Longest Ordered Subsequence\n56. [problem:ZOJ-2142] Light The Square\n57. [problem:ZOJ-2144] Sending Gift\n58. [problem:ZOJ-2156] Charlie\u0027s Change\n59. [problem:ZOJ-2180] City Game\n60. [problem:ZOJ-2189] Exact Change Only\n61. [problem:ZOJ-2202] Alphacode\n62. [problem:ZOJ-2206] Roll Playing Games\n63. [problem:ZOJ-2213] Fun Game\n64. [problem:ZOJ-2214] Square\n65. [problem:ZOJ-2227] Minimax Triangulation\n66. [problem:ZOJ-2242] Huffman\u0027s Greed\n67. [problem:ZOJ-2244] Land Division Tax\n68. [problem:ZOJ-2254] Island Country\n69. [problem:ZOJ-2255] Best Editor\n70. [problem:ZOJ-2264] Confusing Login Names\n71. [problem:ZOJ-2271] Chance to Encounter a Girl\n72. [problem:ZOJ-2278] Fight for Food\n73. [problem:ZOJ-2280] Key to Freedom\n74. [problem:ZOJ-2281] Way to Freedom\n75. [problem:ZOJ-2283] Challenge of Wisdom\n76. [problem:ZOJ-2284] Inversion Number\n77. [problem:ZOJ-2297] Survival\n78. [problem:ZOJ-2319] Beautiful People\n79. [problem:ZOJ-2337] Non Absorbing DFA\n80. [problem:ZOJ-2338] The Towers of Hanoi Revisited\n81. [problem:ZOJ-2341] Quantization Problem\n82. [problem:ZOJ-2349] Mix and Build\n83. [problem:ZOJ-2353] Special Experiment\n84. [problem:ZOJ-2354] Elevator Stopping Plan\n85. [problem:ZOJ-2366] Weird Dissimilarity\n86. [problem:ZOJ-2372] Work Reduction\n87. [problem:ZOJ-2374] Marbles on a tree\n88. [problem:ZOJ-2397] Tian Ji -- The Horse Racing\n89. [problem:ZOJ-2398] Islands and Bridges\n90. [problem:ZOJ-2401] Zipper\n91. [problem:ZOJ-2402] Lenny\u0027s Lucky Lotto Lists\n92. [problem:ZOJ-2414] Index of Prime\n\n\n\n","threadId":40840,"likeCnt":0,"createTime":1545126060000,"isWorkbook":true,"viewCnt":3130,"openness":1,"fav":false,"id":807,"trustable":false}