Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"POJ-1321\":[\"棋盘问题\",36363,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003d%E8%94%A1%E9%94%99%40pku\\\"\\u003e蔡错@pku\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1681\":[\"Painter\\u0027s Problem\",2618,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2004.06.27+%E5%BC%A0%E5%98%89%E9%BE%84\\\"\\u003ePOJ Monthly--2004.06.27 张嘉龄\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2653\":[\"Pick-up sticks\",4689,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2005.09.17\\\"\\u003eWaterloo local 2005.09.17\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2774\":[\"Long Long Message\",7472,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.03.26\\\"\\u003ePOJ Monthly--2006.03.26\\u003c/a\\u003e,Zeyuan Zhu,\\\"Dedicate to my great beloved mother.\\\"\\u003c/div\\u003e\"],\"UVA-11294\":[\"Wedding\",862,null],\"POJ-2533\":[\"Longest Ordered Subsequence\",24783,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2002\\\"\\u003eNortheastern Europe 2002\\u003c/a\\u003e, Far-Eastern Subregion\\u003c/div\\u003e\"],\"POJ-3984\":[\"迷宫问题\",25673,\"\"],\"HDU-3045\":[\"Picnic Cows\",922,\"\\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+14+-+Host+by+ZJNU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 14 - Host by ZJNU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2778\":[\"DNA Sequence\",4536,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.03.26\\\"\\u003ePOJ Monthly--2006.03.26\\u003c/a\\u003e,dodo\\u003c/div\\u003e\"],\"POJ-3746\":[\"Teacher YYF\",405,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly+Contest+-+2009.08.23\\\"\\u003ePOJ Monthly Contest - 2009.08.23\\u003c/a\\u003e, Jason\\u003c/div\\u003e\"],\"FZU-1686\":[\"神龙的难题\",281,\"FOJ月赛-2009年2月- TimeLoop\"],\"CodeForces-617E\":[\"XOR and Favorite Number\",9496,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/617\\\"\\u003eCodeforces Round 340 (Div. 2)\\u003c/a\\u003e\"],\"黑暗爆炸-3669\":[\"魔法森林\",74,\"Noi2014\"],\"HDU-4010\":[\"Query on The Trees\",1047,\"\\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\"],\"HDU-4370\":[\"0 or 1\",925,\"\\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\"],\"UVA-11183\":[\"Teen Girl Squad\",999,null],\"UVA-1386\":[\"Cellular Automaton\",415,null],\"POJ-2421\":[\"Constructing Roads\",12127,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPKU+Monthly\\\"\\u003ePKU Monthly\\u003c/a\\u003e,kicc\\u003c/div\\u003e\"],\"POJ-2540\":[\"Hotter Colder\",1042,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2001.01.27\\\"\\u003eWaterloo local 2001.01.27\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1456\":[\"Supermarket\",9055,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2003\\\"\\u003eSoutheastern Europe 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVALive-5903\":[\"Piece it together\",245,\"Regionals 2011 \\u003e\\u003e Europe - Northwestern\"],\"POJ-1696\":[\"Space Ant\",3489,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+1999\\\"\\u003eTehran 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2087\":[\"剪花布条\",24087,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B6%AC%C1%B7%C8%FD%BE%C5%D6%AE%B6%FE\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 冬练三九之二 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1458\":[\"Common Subsequence\",27272,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2003\\\"\\u003eSoutheastern Europe 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2089\":[\"不要62\",26663,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D3%AD%BD%D3%D0%C2%D1%A7%C6%DA%A1%AA%A1%AA%B3%AC%BC%B6Easy%B0%E6%C8%C8%C9%ED%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 迎接新学期——超级Easy版热身赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1459\":[\"Power Network\",7520,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2003\\\"\\u003eSoutheastern Europe 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-5358\":[\"First One\",771,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+Multi-University+Training+Contest+6\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 6 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4027\":[\"Can you answer these queries?\",7112,\"\\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\"],\"UVA-1391\":[\"Astronauts\",466,null],\"HDU-3294\":[\"Girls\\u0027 research\",2417,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+%A1%B0HDU-Sailormoon%A1%B1+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 “HDU-Sailormoon” Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"黑暗爆炸-2440\":[\"完全平方数\",207,\"中山市选2011\"],\"POJ-1661\":[\"Help Jimmy\",4916,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2004.05.15+CEOI+2000\\\"\\u003ePOJ Monthly--2004.05.15 CEOI 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-11396\":[\"Claw Decomposition\",3546,null],\"POJ-2752\":[\"Seek the Name, Seek the Fame\",12891,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.01.22\\\"\\u003ePOJ Monthly--2006.01.22\\u003c/a\\u003e,Zeyuan Zhu\\u003c/div\\u003e\"],\"UVALive-2429\":[\"Puzzle\",40,\"Regionals 2001 \\u003e\\u003e Europe - Central\"],\"POJ-2516\":[\"Minimum Cost\",4323,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2005.07.31\\\"\\u003ePOJ Monthly--2005.07.31\\u003c/a\\u003e, Wang Yijie\\u003c/div\\u003e\"],\"POJ-2758\":[\"Checking the Text\",639,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.02.26\\\"\\u003ePOJ Monthly--2006.02.26\\u003c/a\\u003e,zgl \\u0026amp; twb\\u003c/div\\u003e\"],\"HDU-3068\":[\"最长回文\",10282,\"\\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+16+-+Host+by+NIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 16 - Host by NIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3065\":[\"病毒侵袭持续中\",5327,\"\\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+16+-+Host+by+NIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 16 - Host by NIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVALive-3514\":[\"Cactus\",125,\"Regionals 2005 \\u003e\\u003e Europe - Northeastern\"],\"POJ-1789\":[\"Truck History\",11968,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCTU+Open+2003\\\"\\u003eCTU Open 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1426\":[\"Find The Multiple\",19335,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dDhaka+2002\\\"\\u003eDhaka 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1308\":[\"Is It A Tree?\",11133,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNorth+Central+North+America+1997\\\"\\u003eNorth Central North America 1997\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3728\":[\"The merchant\",1562,\"\\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\"],\"HDU-3062\":[\"Party\",2500,\"\\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+16+-+Host+by+NIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 16 - Host by NIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3183\":[\"A Magic Lamp\",3053,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2009-11+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2009-11 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"黑暗爆炸-1269\":[\"文本编辑器editor\",8,\"AHOI2006 鸣谢seter重新制作数据\"],\"CodeForces-954I\":[\"Yet Another String Matching Problem\",1084,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/954\\\"\\u003eEducational Codeforces Round 40 (Rated for Div. 2)\\u003c/a\\u003e\"],\"SPOJ-OTOCI\":[\"OTOCI\",616,\"Croatian Olympiad in Informatics 28.03.2009.\"],\"POJ-2761\":[\"Feed the dogs\",3621,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.02.26\\\"\\u003ePOJ Monthly--2006.02.26\\u003c/a\\u003e,zgl \\u0026amp; twb\\u003c/div\\u003e\"],\"CodeForces-55D\":[\"Beautiful numbers\",6223,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/55\\\"\\u003eCodeforces Beta Round 51\\u003c/a\\u003e\"],\"POJ-2886\":[\"Who Gets the Most Candies?\",3445,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.07.30\\\"\\u003ePOJ Monthly--2006.07.30\\u003c/a\\u003e, Sempr\\u003c/div\\u003e\"],\"POJ-1797\":[\"Heavy Transportation\",12716,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTUD+Programming+Contest+2004\\\"\\u003eTUD Programming Contest 2004\\u003c/a\\u003e, Darmstadt, Germany\\u003c/div\\u003e\"],\"UVALive-4958\":[\"Palindromic DNA\",87,\"Regionals 2010 \\u003e\\u003e Europe - Southwestern\"],\"POJ-1556\":[\"The Doors\",3429,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dMid-Central+USA+1996\\\"\\u003eMid-Central USA 1996\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10054\":[\"The Necklace\",5560,null],\"UVA-12594\":[\"Naming Babies\",129,null],\"POJ-2400\":[\"Supervisor, Supervisee\",643,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+2003+Preliminary\\\"\\u003eTehran 2003 Preliminary\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2763\":[\"Housewife Wind\",2935,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.02.26\\\"\\u003ePOJ Monthly--2006.02.26\\u003c/a\\u003e,zgl \\u0026amp; twb\\u003c/div\\u003e\"],\"UVALive-4839\":[\"Traffic Real Time Query System\",77,\"Regionals 2010 \\u003e\\u003e Asia - Hangzhou\"],\"POJ-3974\":[\"Palindrome\",6578,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSeventh+ACM+Egyptian+National+Programming+Contest\\\"\\u003eSeventh ACM Egyptian National Programming Contest\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2406\":[\"Power Strings\",21622,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2002.07.01\\\"\\u003eWaterloo local 2002.07.01\\u003c/a\\u003e\\u003c/div\\u003e\"],\"URAL-1036\":[\"Lucky Tickets\",5320,\"\"],\"HDU-3078\":[\"Network\",962,\"\\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+17+-+Host+by+NUDT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 17 - Host by NUDT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5015\":[\"233 Matrix\",2498,\"\\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+Xi%26%23039%3Ban+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 ACM/ICPC Asia Regional Xi\\u0027an Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2528\":[\"Mayor\\u0027s posters\",14636,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dAlberta+Collegiate+Programming+Contest+2003.10.18\\\"\\u003eAlberta Collegiate Programming Contest 2003.10.18\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3616\":[\"Milking Time\",8962,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+November+Silver\\\"\\u003eUSACO 2007 November Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-4289\":[\"Control\",1670,\"\\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-5256\":[\"序列变换\",1141,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015%C4%EA%B0%D9%B6%C8%D6%AE%D0%C7%B3%CC%D0%F2%C9%E8%BC%C6%B4%F3%C8%FC+-+%B3%F5%C8%FC%282%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015年百度之星程序设计大赛 - 初赛(2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1679\":[\"The Unique MST\",10673,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2004.06.27+srbga%40POJ\\\"\\u003ePOJ Monthly--2004.06.27 srbga@POJ\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-11149\":[\"Power of Matrix\",1130,null],\"HDU-4280\":[\"Island Transport\",2311,\"\\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-4285\":[\"circuits\",247,\"\\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-3193\":[\"Find the hotel\",533,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2009-12+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2009-12 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5493\":[\"Queue\",756,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+ACM%2FICPC+Asia+Regional+Hefei+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 ACM/ICPC Asia Regional Hefei Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4283\":[\"You Are the One\",3636,\"\\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\"],\"POJ-2451\":[\"Uyuw\\u0027s Concert\",1809,\"\\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,Zeyuan Zhu\\u003c/div\\u003e\"],\"POJ-3667\":[\"Hotel\",6319,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2008+February+Gold\\\"\\u003eUSACO 2008 February Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3304\":[\"Segments\",5070,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dAmirkabir+University+of+Technology+Local+Contest+2006\\\"\\u003eAmirkabir University of Technology Local Contest 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3666\":[\"Making the Grade\",5081,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2008+February+Gold\\\"\\u003eUSACO 2008 February Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1487\":[\"Single-Player Games\",288,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouthwestern+European+Regional+Contest+1998\\\"\\u003eSouthwestern European Regional Contest 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-5029\":[\"Relief grain\",661,\"\\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+Guangzhou+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 ACM/ICPC Asia Regional Guangzhou Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3081\":[\"Marriage Match II\",1237,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2nd+%A1%B0Vegetable-Birds+Cup%A1%B1+Programming+Open+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2nd “Vegetable-Birds Cup” Programming Open Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4292\":[\"Food\",1912,\"\\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-3085\":[\"Nightmare Ⅱ\",1664,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2nd+%A1%B0Vegetable-Birds+Cup%A1%B1+Programming+Open+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2nd “Vegetable-Birds Cup” Programming Open Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1251\":[\"Jungle Roads\",15858,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dMid-Central+USA+2002\\\"\\u003eMid-Central USA 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2100\":[\"Graveyard Design\",2780,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2004\\\"\\u003eNortheastern Europe 2004\\u003c/a\\u003e, Northern Subregion\\u003c/div\\u003e\"],\"POJ-1258\":[\"Agri-Net\",24325,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+102\\\"\\u003eUSACO 102\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3678\":[\"Katu Puzzle\",3433,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.07.27\\\"\\u003ePOJ Founder Monthly Contest – 2008.07.27\\u003c/a\\u003e, Dagger\\u003c/div\\u003e\"],\"POJ-3436\":[\"ACM Computer Factory\",3023,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2005\\\"\\u003eNortheastern Europe 2005\\u003c/a\\u003e, Far-Eastern Subregion\\u003c/div\\u003e\"],\"POJ-1015\":[\"Jury Compromise\",7060,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouthwestern+European+Regional+Contest+1996\\\"\\u003eSouthwestern European Regional Contest 1996\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2104\":[\"K-th Number\",14110,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2004\\\"\\u003eNortheastern Europe 2004\\u003c/a\\u003e, Northern Subregion\\u003c/div\\u003e\"],\"UVALive-3523\":[\"Knights of the Round Table\",728,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"HDU-4069\":[\"Squiggly Sudoku\",522,\"\\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+Fuzhou+Site+%A1%AA%A1%AA+Online+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 36th ACM/ICPC Asia Regional Fuzhou Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2349\":[\"Arctic Network\",8105,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2002.09.28\\\"\\u003eWaterloo local 2002.09.28\\u003c/a\\u003e\\u003c/div\\u003e\"],\"SPOJ-MKTHNUM\":[\"K-th Number\",6206,\"Northeastern Europe 2004 Northern Subregion\"],\"HDU-4185\":[\"Oil Skimming\",1767,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+2011+South+Pacific+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 2011 South Pacific Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5274\":[\"Dylans loves tree\",393,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2345\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #45 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4183\":[\"Pahom on Water\",472,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+2011+South+Pacific+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 2011 South Pacific Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"黑暗爆炸-2005\":[\"能量采集\",131,\"Noi2010\"],\"黑暗爆炸-1036\":[\"树的统计Count\",294,\"ZJOI2008\"],\"黑暗爆炸-2243\":[\"染色\",210,\"SDOI2011 第一轮day1\"],\"黑暗爆炸-2002\":[\"Bounce 弹飞绵羊\",263,\"Hnoi2010\"],\"黑暗爆炸-2120\":[\"数颜色\",524,\"\"],\"POJ-1260\":[\"Pearls\",5049,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNorthwestern+Europe+2002\\\"\\u003eNorthwestern Europe 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1584\":[\"A Round Peg in a Ground Hole\",1897,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dMid-Atlantic+2003\\\"\\u003eMid-Atlantic 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-392C\":[\"Yet Another Number Sequence\",798,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/392\\\"\\u003eCodeforces Round 230 (Div. 1)\\u003c/a\\u003e\"],\"POJ-2553\":[\"The Bottom of a Graph\",3783,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+2003\\\"\\u003eUlm Local 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1222\":[\"EXTENDED LIGHTS OUT\",7799,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dGreater+New+York+2002\\\"\\u003eGreater New York 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3525\":[\"Most Distant Point from the Sea\",1899,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2007\\\"\\u003eJapan 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1226\":[\"Substrings\",4203,\"\\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\"],\"POJ-2318\":[\"TOYS\",8190,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dRocky+Mountain+2003\\\"\\u003eRocky Mountain 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3648\":[\"Wedding\",2125,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+Local+Contest\\\"\\u003eWaterloo Local Contest\\u003c/a\\u003e, 2007.9.29\\u003c/div\\u003e\"],\"HDU-5046\":[\"Airport\",477,\"\\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+Shanghai+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 ACM/ICPC Asia Regional Shanghai Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1228\":[\"Grandpa\\u0027s Estate\",3273,\"\\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\"],\"SPOJ-BALNUM\":[\"Balanced Numbers\",1500,\"Cuban Olympiad in Informatics 2012 - Day 2 Problem A\"],\"HDU-4190\":[\"Distributing Ballot Boxes\",1600,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSWERC+2011\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e SWERC 2011 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"黑暗爆炸-2038\":[\"小Z的袜子(hose)\",598,\"2009国家集训队\"],\"黑暗爆炸-1067\":[\"降雨量\",135,\"SCOI2007 POJ 2637 WorstWeather Ever\"],\"黑暗爆炸-2154\":[\"Crash的数字表格\",216,\"\"],\"POJ-1474\":[\"Video Surveillance\",1671,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouthwestern+European+Regional+Contest+1997\\\"\\u003eSouthwestern European Regional Contest 1997\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3415\":[\"Common Substrings\",3053,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.10.06\\\"\\u003ePOJ Monthly--2007.10.06\\u003c/a\\u003e, wintokk\\u003c/div\\u003e\"],\"POJ-1236\":[\"Network of Schools\",8523,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dIOI+1996\\\"\\u003eIOI 1996\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3414\":[\"Pots\",11348,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2002\\\"\\u003eNortheastern Europe 2002\\u003c/a\\u003e, Western Subregion\\u003c/div\\u003e\"],\"POJ-1113\":[\"Wall\",9262,\"\\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\\u003c/div\\u003e\"],\"HDU-1815\":[\"Building roads\",104,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dPOJ+Monthly+-+2006.01.22+-+zhucheng\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e POJ Monthly - 2006.01.22 - zhucheng \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1814\":[\"Peaceful Commission\",1547,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dPOI+2001\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e POI 2001 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2566\":[\"Bound Found\",2933,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+2001\\\"\\u003eUlm Local 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3417\":[\"Network\",2263,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.10.06\\\"\\u003ePOJ Monthly--2007.10.06\\u003c/a\\u003e, Yang Mu\\u003c/div\\u003e\"],\"HDU-5178\":[\"pairs\",2350,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2331\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #31 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVALive-3662\":[\"Another Minimum Spanning Tree\",185,\"Regionals 2006 \\u003e\\u003e Asia - Beijing\"],\"HDU-4081\":[\"Qin Shi Huang\\u0027s National Road System\",3052,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Asia+Beijing+Regional+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Asia Beijing Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5052\":[\"Yaoge’s maximum profit\",388,\"\\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+Shanghai+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 ACM/ICPC Asia Regional Shanghai Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3660\":[\"Cow Contest\",11814,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2008+January+Silver\\\"\\u003eUSACO 2008 January Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1287\":[\"Networking\",11525,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2002\\\"\\u003eSoutheastern Europe 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"Gym-100341C\":[\"AVL Trees\",82,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100341\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2007-2008 Summer Petrozavodsk Camp, Andrew Stankevich Contest 25 (ASC 25)\\u003c/a\\u003e\"],\"POJ-2253\":[\"Frogger\",17790,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+1997\\\"\\u003eUlm Local 1997\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1824\":[\"Let\\u0027s go home\",994,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+2007+Summer+Exercise%A3%A83%A3%A9-+Hold+by+Wiskey\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ 2007 Summer Exercise(3)- Hold by Wiskey \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3348\":[\"Cows\",4185,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCCC+2007\\\"\\u003eCCC 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2018\":[\"Best Cow Fences\",4439,\"\\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\"],\"POJ-3468\":[\"A Simple Problem with Integers\",30045,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.11.25\\\"\\u003ePOJ Monthly--2007.11.25\\u003c/a\\u003e, Yang Yi\\u003c/div\\u003e\"],\"POJ-3104\":[\"Drying\",6941,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2005\\\"\\u003eNortheastern Europe 2005\\u003c/a\\u003e, Northern Subregion\\u003c/div\\u003e\"],\"POJ-3347\":[\"Kadj Squares\",1486,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+2006\\\"\\u003eTehran 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2019\":[\"Cornfields\",3745,\"\\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\"],\"UVALive-3211\":[\"Now or later\",654,\"Regionals 2004 \\u003e\\u003e Europe - Southwestern\"],\"HDU-1816\":[\"Get Luffy Out *\",421,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBeijing+2005\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Beijing 2005 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1937\":[\"Finding Seats\",606,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM+South+American+Programming+Contest+2007+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM South American Programming Contest 2007 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3352\":[\"Road Construction\",5463,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCCC+2007\\\"\\u003eCCC 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1050\":[\"To the Max\",26096,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dGreater+New+York+2001\\\"\\u003eGreater New York 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1177\":[\"Picture\",5103,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dIOI+1998\\\"\\u003eIOI 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2387\":[\"Til the Cows Come Home\",23632,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+November\\\"\\u003eUSACO 2004 November\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-385E\":[\"Bear in the Field\",790,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/385\\\"\\u003eCodeforces Round 226 (Div. 2)\\u003c/a\\u003e\"],\"HDU-1711\":[\"Number Sequence\",16602,\"\\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\"],\"POJ-3237\":[\"Tree\",2104,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.06.03\\\"\\u003ePOJ Monthly--2007.06.03\\u003c/a\\u003e, Lei, Tao\\u003c/div\\u003e\"],\"SPOJ-HIGH\":[\"Highways\",1219,\"\"],\"POJ-1180\":[\"Batch Scheduling\",1825,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dIOI+2002\\\"\\u003eIOI 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"ZOJ-3122\":[\"Sudoku\",356,null],\"POJ-2031\":[\"Building a Space Station\",7397,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2003+Domestic\\\"\\u003eJapan 2003 Domestic\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3241\":[\"Object Clustering\",615,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.08.05\\\"\\u003ePOJ Monthly--2007.08.05\\u003c/a\\u003e, Li, Haoyuan\\u003c/div\\u003e\"],\"POJ-1061\":[\"青蛙的约会\",23366,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003d%E6%B5%99%E6%B1%9F\\\"\\u003e浙江\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1182\":[\"食物链\",25797,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNoi+01\\\"\\u003eNoi 01\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1062\":[\"昂贵的聘礼\",15091,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003d%E6%B5%99%E6%B1%9F\\\"\\u003e浙江\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3481\":[\"Double Queue\",5384,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2007\\\"\\u003eSoutheastern Europe 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2112\":[\"Optimal Milking\",4536,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2003+U+S+Open\\\"\\u003eUSACO 2003 U S Open\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3565\":[\"Ants\",1820,\"\\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\"],\"POJ-3686\":[\"The Windy\\u0027s\",1790,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.08.31\\\"\\u003ePOJ Founder Monthly Contest – 2008.08.31\\u003c/a\\u003e, windy7926778\\u003c/div\\u003e\"],\"POJ-3685\":[\"Matrix\",2806,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.08.31\\\"\\u003ePOJ Founder Monthly Contest – 2008.08.31\\u003c/a\\u003e, windy7926778\\r\\u003cbr\\u003e\\u003c/div\\u003e\"],\"POJ-2594\":[\"Treasure Exploration\",3656,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2005.08.28\\\"\\u003ePOJ Monthly--2005.08.28\\u003c/a\\u003e,Li Haoyuan\\u003c/div\\u003e\"],\"POJ-3683\":[\"Priest John\\u0027s Busiest Day\",2685,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.08.31\\\"\\u003ePOJ Founder Monthly Contest – 2008.08.31\\u003c/a\\u003e, Dagger and Facer\\u003c/div\\u003e\"],\"HDU-1964\":[\"Pipes\",410,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dNWERC2004\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e NWERC2004 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1269\":[\"Intersecting Lines\",7608,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dMid-Atlantic+1996\\\"\\u003eMid-Atlantic 1996\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1846\":[\"Brave Game\",12815,\"\\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\"],\"POJ-2116\":[\"Death to Binary?\",814,\"\\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\"],\"HDU-2813\":[\"One fihgt one\",622,\"\\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-1845\":[\"Jimmy’s Assignment\",724,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dPolitehnica+University+of+Bucharest+Local+Team+Contest+2007\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Politehnica University of Bucharest Local Team Contest 2007 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"FZU-2150\":[\"Fire Game\",3184,\"\"],\"POJ-2478\":[\"Farey Sequence\",7251,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Contest\\\"\\u003ePOJ Contest\\u003c/a\\u003e,Author:Mathematica@ZSU\\u003c/div\\u003e\"],\"POJ-2236\":[\"Wireless Network\",16856,\"\\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,HQM\\u003c/div\\u003e\"],\"HDU-1847\":[\"Good Luck in CET-4 Everybody!\",9859,\"\\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\"],\"POJ-2115\":[\"C Looooops\",8046,\"\\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\"],\"Kattis-kinversions\":[\"K-Inversions\",839,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/North%20American%20Invitational%20Programming%20Contest%20%28NAIPC%29%202016\\\"\\u003eNorth American Invitational Programming Contest (NAIPC) 2016\\u003c/a\\u003e\"],\"POJ-3207\":[\"Ikki\\u0027s Story IV - Panda\\u0027s Trick\",3171,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.03.04\\\"\\u003ePOJ Monthly--2007.03.04\\u003c/a\\u003e, Ikki\\u003c/div\\u003e\"],\"POJ-3449\":[\"Geometric Shapes\",782,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCTU+Open+2007\\\"\\u003eCTU Open 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"黑暗爆炸-2759\":[\"一个动态树好题\",39,\"\"],\"CodeForces-914G\":[\"Sum the Fibonacci\",992,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/914\\\"\\u003eCodecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"UVALive-4452\":[\"The Ministers\\u0027 Major Mess\",419,\"World Finals \\u003e\\u003e 2009 - Stockholm\"],\"ZOJ-3256\":[\"Tour in the Castle\",424,null],\"ZOJ-3494\":[\"BCD Code\",1334,null],\"POJ-2240\":[\"Arbitrage\",9945,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+1996\\\"\\u003eUlm Local 1996\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1151\":[\"Atlantis\",7187,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dMid-Central+European+Regional+Contest+2000\\\"\\u003eMid-Central European Regional Contest 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3693\":[\"Maximum repetition substring\",2237,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003d2008+Asia+Hefei+Regional+Contest+Online+by+USTC\\\"\\u003e2008 Asia Hefei Regional Contest Online by USTC\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3450\":[\"Corporate Identity\",2013,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCTU+Open+2007\\\"\\u003eCTU Open 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeChef-COUNTARI\":[\"Arithmetic Progressions\",888,\"imran_adm\"],\"SPOJ-REPEATS\":[\"Repeats\",1488,\"BOI 2004\"],\"POJ-1271\":[\"Nice Milk\",262,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dOIBH+Online+Programming+Contest%28OOPC%29%231\\\"\\u003eOIBH Online Programming Contest(OOPC)#1\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1853\":[\"Cyclic Tour\",1241,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007+Programming+Contest+-+Final\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007 Programming Contest - Final \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-371C\":[\"Hamburgers\",29143,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/371\\\"\\u003eCodeforces Round 218 (Div. 2)\\u003c/a\\u003e\"],\"POJ-3694\":[\"Network\",3049,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003d2008+Asia+Hefei+Regional+Contest+Online+by+USTC\\\"\\u003e2008 Asia Hefei Regional Contest Online by USTC\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2825\":[\"Wireless Password\",1855,\"\\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+1+-+Host+by+TJU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 1 - Host by TJU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1039\":[\"Pipe\",2846,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCentral+Europe+1995\\\"\\u003eCentral Europe 1995\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2007\":[\"Scrambled Polygon\",4257,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dRocky+Mountain+2004\\\"\\u003eRocky Mountain 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3579\":[\"Median\",5562,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.04.13\\\"\\u003ePOJ Founder Monthly Contest – 2008.04.13\\u003c/a\\u003e, Lei Tao\\u003c/div\\u003e\"],\"POJ-3335\":[\"Rotating Scoreboard\",2332,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+2006+Preliminary\\\"\\u003eTehran 2006 Preliminary\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1279\":[\"Art Gallery\",2367,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2002\\\"\\u003eSoutheastern Europe 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"URAL-1553\":[\"Caves and Tunnels\",1741,\"Novosibirsk SU Contest. Petrozavodsk training camp, September 2007\"],\"HDU-1850\":[\"Being a Good Boy in Spring Festival\",6283,\"\\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-2819\":[\"Swap\",2251,\"\\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+1+-+Host+by+TJU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 1 - Host by TJU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-3261\":[\"Connections in Galaxy War\",3257,null],\"POJ-2251\":[\"Dungeon Master\",22230,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+1997\\\"\\u003eUlm Local 1997\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1160\":[\"Post Office\",8311,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dIOI+2000\\\"\\u003eIOI 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3581\":[\"Sequence\",1350,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.04.13\\\"\\u003ePOJ Founder Monthly Contest – 2008.04.13\\u003c/a\\u003e, Yao Jinyu\\u003c/div\\u003e\"],\"NBUT-1457\":[\"Sona\",325,\"XadillaX\"],\"POJ-3580\":[\"SuperMemo\",2385,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.04.13\\\"\\u003ePOJ Founder Monthly Contest – 2008.04.13\\u003c/a\\u003e, Yao Jinyu\\u003c/div\\u003e\"],\"POJ-2492\":[\"A Bug\\u0027s Life\",12061,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTUD+Programming+Contest+2005\\\"\\u003eTUD Programming Contest 2005\\u003c/a\\u003e, Darmstadt, Germany\\u003c/div\\u003e\"],\"POJ-3268\":[\"Silver Cow Party\",15059,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+February+Silver\\\"\\u003eUSACO 2007 February Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3026\":[\"Borg Maze\",4961,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSvenskt+M%C3%A4sterskap+i+Programmering%2FNorgesmesterskapet+2001\\\"\\u003eSvenskt Mästerskap i Programmering/Norgesmesterskapet 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1087\":[\"A Plug for UNIX\",5173,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dEast+Central+North+America+1999\\\"\\u003eEast Central North America 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1507\":[\"Uncle Tom\\u0027s Inherited Land*\",1294,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSouth+America+2002+-++Practice\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e South America 2002 - Practice \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1506\":[\"Largest Rectangle in a Histogram\",7996,\"\\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+2003\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Ulm Local Contest 2003 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10600\":[\"ACM Contest and Blackout\",5797,null],\"黑暗爆炸-1208\":[\"宠物收养所\",98,\"HNOI2004\"],\"UVALive-6771\":[\"Buffed Buffet\",29,\"World Finals \\u003e\\u003e 2014 - Ekaterinburg\"],\"HDU-2829\":[\"Lawrence\",1998,\"\\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+2+-+Host+by+TJU+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 2 - Host by TJU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1091\":[\"跳蚤\",2941,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dHNOI+2001\\\"\\u003eHNOI 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2186\":[\"Popular Cows\",11774,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2003+Fall\\\"\\u003eUSACO 2003 Fall\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2065\":[\"SETI\",1114,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNorthwestern+Europe+2004\\\"\\u003eNorthwestern Europe 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1754\":[\"I Hate It\",29528,\"\\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%A86%A3%A9_linle%D7%A8%B3%A1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(6)_linle专场 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3278\":[\"Catch That Cow\",40579,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+Open+Silver\\\"\\u003eUSACO 2007 Open Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1875\":[\"畅通工程再续\",12408,\"\\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\"],\"POJ-3279\":[\"Fliptile\",8888,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+Open+Silver\\\"\\u003eUSACO 2007 Open Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"LightOJ-1090\":[\"Trailing Zeroes (II)\",2491,null],\"CodeForces-450B\":[\"Jzzhu and Sequences\",28467,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/450\\\"\\u003eCodeforces Round 257 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-220B\":[\"Little Elephant and Array\",10884,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/220\\\"\\u003eCodeforces Round 136 (Div. 1)\\u003c/a\\u003e\"],\"POJ-3159\":[\"Candies\",7666,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.12.31\\\"\\u003ePOJ Monthly--2006.12.31\\u003c/a\\u003e, Sempr\\u003c/div\\u003e\"],\"HDU-1517\":[\"A Multiplication Game\",4043,\"\\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+2001.09.22\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Waterloo Local Contest 2001.09.22 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1095\":[\"Arrange the Numbers\",1161,null],\"LightOJ-1098\":[\"A New Function\",1715,null],\"UVALive-3486\":[\"Cells\",137,\"Regionals 2005 \\u003e\\u003e Asia - Hangzhou\"],\"HDU-2841\":[\"Visible Trees\",1773,\"\\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+3+-+Host+by+WHU+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 3 - Host by WHU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-11806\":[\"Cheerleaders\",2465,null],\"POJ-3281\":[\"Dining\",8106,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+Open+Gold\\\"\\u003eUSACO 2007 Open Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3164\":[\"Command Network\",3069,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.12.31\\\"\\u003ePOJ Monthly--2006.12.31\\u003c/a\\u003e, galaxy\\u003c/div\\u003e\"],\"POJ-2195\":[\"Going Home\",8812,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPacific+Northwest+2004\\\"\\u003ePacific Northwest 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2074\":[\"Line of Sight\",1296,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dMid-Atlantic+2004\\\"\\u003eMid-Atlantic 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1402\":[\"A * B Problem Plus\",4666,\"\"],\"URAL-1627\":[\"Join\",554,\"SPbSU ITMO contest. Petrozavodsk training camp. Winter 2008.\"],\"HDU-2612\":[\"Find a way\",10330,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B7%DC%B6%B7%B5%C4%C4%EA%B4%FA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 奋斗的年代 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2398\":[\"Toy Storage\",4735,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+2003+Preliminary\\\"\\u003eTehran 2003 Preliminary\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2732\":[\"Leapin\\u0027 Lizards\",1394,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Central+USA+2005\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central USA 2005 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2853\":[\"Assignment\",795,\"\\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\"],\"HDU-1525\":[\"Euclid\\u0027s Game\",2845,\"\\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+2002.09.28\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Waterloo Local Contest 2002.09.28 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3122\":[\"Pie\",8152,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNorthwestern+Europe+2006\\\"\\u003eNorthwestern Europe 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1066\":[\"Treasure Hunt\",2985,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dEast+Central+North+America+1999\\\"\\u003eEast Central North America 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-86D\":[\"Powerful array\",15405,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/86\\\"\\u003eYandex.Algorithm 2011: Round 2\\u003c/a\\u003e\"],\"HDU-1527\":[\"取石子游戏\",6762,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dNOI\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e NOI \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3949\":[\"XOR\",2517,\"\\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+11+-+Host+by+UESTC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Multi-University Training Contest 11 - Host by UESTC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3126\":[\"Prime Path\",19734,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNorthwestern+Europe+2006\\\"\\u003eNorthwestern Europe 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3368\":[\"Frequent values\",6827,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+2007\\\"\\u003eUlm Local 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2859\":[\"Phalanx\",2394,\"\\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\"],\"HDU-1528\":[\"Card Game Cheater\",1300,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dNorthwestern+Europe+2004\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Northwestern Europe 2004 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1186\":[\"Incredible Chess\",2118,null],\"LightOJ-1067\":[\"Combinations\",4345,null],\"LightOJ-1188\":[\"Fast Queries\",1766,null],\"UVALive-7521\":[\"Kinfolk\",27,\"Regionals 2015 \\u003e\\u003e North America - Mid-Atlantic USA\"],\"黑暗爆炸-3529\":[\"数表\",113,\"Sdoi2014\"],\"SPOJ-LCS2\":[\"Longest Common Substring II\",2894,\"\"],\"UVA-11916\":[\"Emoogle Grid\",613,null],\"黑暗爆炸-1588\":[\"营业额统计\",243,\"HNOI2002\"],\"HDU-2609\":[\"How many\",2366,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B7%DC%B6%B7%B5%C4%C4%EA%B4%FA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 奋斗的年代 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3252\":[\"Round Numbers\",6849,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+November+Silver\\\"\\u003eUSACO 2006 November Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3130\":[\"How I Mathematician Wonder What You Are!\",1804,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2006\\\"\\u003eJapan 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"SPOJ-QTREE4\":[\"Query on a tree IV\",949,\"william\"],\"HDU-1533\":[\"Going Home\",2904,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dPacific+Northwest+2004\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Pacific Northwest 2004 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3133\":[\"Manhattan Wiring\",712,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2006\\\"\\u003eJapan 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3376\":[\"Finding Palindromes\",685,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.09.09\\\"\\u003ePOJ Monthly--2007.09.09\\u003c/a\\u003e, Zhou Gelin, modified from POI06\\u003c/div\\u003e\"],\"HDU-1538\":[\"A Puzzle for Pirates\",541,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dTJU+Contest+August+2006\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e TJU Contest August 2006 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3718\":[\"Similarity\",851,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Chengdu+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Chengdu Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1192\":[\"Left Right\",2041,null],\"URAL-1996\":[\"Cipher Message 3\",346,\"\"],\"POJ-3258\":[\"River Hopscotch\",9593,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+December+Silver\\\"\\u003eUSACO 2006 December Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-3715\":[\"Go Deeper\",809,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Chengdu+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Chengdu Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3259\":[\"Wormholes\",19748,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+December+Gold\\\"\\u003eUSACO 2006 December Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"LightOJ-1074\":[\"Extended Traffic\",2964,null],\"LightOJ-1197\":[\"Help Hanzo\",3017,null],\"HDU-1890\":[\"Robotic Sort\",1579,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+%A1%B0Shun+Yu+Cup%A1%B1+Zhejiang+Collegiate+Programming+Contest+-+Warm+Up%A3%A82%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 “Shun Yu Cup” Zhejiang Collegiate Programming Contest - Warm Up(2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1077\":[\"How Many Points?\",2691,null],\"HDU-3830\":[\"Checkers\",473,\"\\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+1+-+Host+by+HNU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Multi-University Training Contest 1 - Host by HNU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3951\":[\"Coin Game\",2342,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Alibaba+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Alibaba Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1078\":[\"Integer Divisibility\",3289,null],\"LightOJ-1199\":[\"Partitioning Game\",1066,null],\"HDU-3710\":[\"Battle over Cities\",99,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Chengdu+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Chengdu Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1079\":[\"Just another Robbery\",2096,null],\"HDU-1532\":[\"Drainage Ditches\",6540,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUSACO+93\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e USACO 93 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeChef-PRIMEDST\":[\"Prime Distance On Tree\",1431,\"chen_adm\"],\"黑暗爆炸-1213\":[\"高精度开根\",54,\"HNOI2004\"],\"SPOJ-QTREE\":[\"Query on a tree\",7803,\"\"],\"黑暗爆炸-2301\":[\"Problem b\",324,\"HAOI2011\"],\"HDU-4918\":[\"Query on the subtree\",411,\"\\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+5\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 Multi-University Training Contest 5 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3709\":[\"Balanced Number\",3638,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Chengdu+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Chengdu Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3264\":[\"Balanced Lineup\",23805,\"\\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\"],\"POJ-3384\":[\"Feng Shui\",1311,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2006\\\"\\u003eNortheastern Europe 2006\\u003c/a\\u003e, Northern Subregion\\u003c/div\\u003e\"],\"POJ-2296\":[\"Map Labeler\",580,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+2003\\\"\\u003eTehran 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-484E\":[\"Sign on Fence\",2457,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/484\\\"\\u003eCodeforces Round 276 (Div. 1)\\u003c/a\\u003e\"],\"POJ-3261\":[\"Milk Patterns\",5461,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+December+Gold\\\"\\u003eUSACO 2006 December Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"URAL-1519\":[\"Formula 1\",1556,\"Timus Top Coders: Third Challenge\"],\"POJ-1084\":[\"Square Destroyer\",2019,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTaejon+2001\\\"\\u003eTaejon 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3020\":[\"Antenna Placement\",4980,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSvenskt+M%C3%A4sterskap+i+Programmering%2FNorgesmesterskapet+2001\\\"\\u003eSvenskt Mästerskap i Programmering/Norgesmesterskapet 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-3966\":[\"Aragorn\\u0027s Story\",3387,\"\\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+13+-+Host+by+HIT+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Multi-University Training Contest 13 - Host by HIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3722\":[\"Card Game\",714,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Tianjin+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Tianjin Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3189\":[\"Steady Cow Assignment\",1782,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+February+Gold\\\"\\u003eUSACO 2006 February Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-3729\":[\"I\\u0027m Telling the Truth\",1392,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Tianjin+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Tianjin Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2516\":[\"取石子游戏\",6563,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dECJTU+2008+Autumn+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ECJTU 2008 Autumn Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1669\":[\"Jamie\\u0027s Contact Groups\",302,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2004+Asia+Regional+Shanghai+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2004 Asia Regional Shanghai \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3605\":[\"Escape\",2292,\"\\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%A817%A3%A9%A1%AA%A1%AAHost+by+ZSTU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(17)——Host by ZSTU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3726\":[\"Graph and Queries\",581,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Tianjin+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Tianjin Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1161\":[\"Extreme GCD\",691,null],\"LightOJ-1282\":[\"Leading and Trailing\",3677,null],\"CodeForces-958F3\":[\"Lightsabers (hard)\",760,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/958\\\"\\u003eHelvetic Coding Contest 2018 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"LightOJ-1163\":[\"Bank Robbery\",1297,null],\"LightOJ-1284\":[\"Lights inside 3D Grid\",465,null],\"LightOJ-1045\":[\"Digits of Factorial\",6717,null],\"LightOJ-1287\":[\"Where to Run?\",454,null],\"UVA-10765\":[\"Doves and bombs\",2538,null],\"HDU-1540\":[\"Tunnel Warfare\",5858,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dPOJ+Monthly\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e POJ Monthly \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10766\":[\"Organising the Organisation\",605,null],\"HDU-2874\":[\"Connections between cities\",2840,\"\\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+8+-+Host+by+BJNU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 8 - Host by BJNU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1289\":[\"LCM from 1 to n\",1374,null],\"HDU-1542\":[\"Atlantis\",6229,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Central+European+Regional+Contest+2000\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central European Regional Contest 2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2993\":[\"MAX Average Problem\",1012,\"\\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+19+-+Host+by+BNU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 19 - Host by BNU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1300\":[\"Pearls\",1733,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dNorthwestern+Europe+2002\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Northwestern Europe 2002 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1038\":[\"Race to 1 Again\",3257,null],\"POJ-3074\":[\"Sudoku\",2493,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dStanford+Local+2006\\\"\\u003eStanford Local 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2768\":[\"Cat vs. Dog\",974,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dNWERC+2008\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e NWERC 2008 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3613\":[\"Best Reward\",2114,\"\\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%A818%A3%A9%A1%AA%A1%AAHost+by+TJU+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(18)——Host by TJU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2888\":[\"Check Corners\",1089,\"\\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+9+-+Host+by+HIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 9 - Host by HIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10870\":[\"Recurrences\",2373,null],\"FZU-2082\":[\"过路费\",480,\"FOJ有奖月赛-2012年4月(校赛热身赛)\"],\"LightOJ-1170\":[\"Counting Perfect BST\",949,null],\"LightOJ-1173\":[\"The Vindictive Coach\",429,null],\"LightOJ-1294\":[\"Positive Negative Sign\",8231,null],\"LightOJ-1054\":[\"Efficient Pseudo Code\",2127,null],\"LightOJ-1296\":[\"Again Stone Game\",1008,null],\"LightOJ-1297\":[\"Largest Box\",1404,null],\"UVA-11604\":[\"General Sultan\",266,null],\"HDU-2883\":[\"kebab\",768,\"\\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+9+-+Host+by+HIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 9 - Host by HIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1298\":[\"One Theorem, One Year\",462,null],\"UVA-11722\":[\"Joining with Friend\",834,null],\"HDU-3974\":[\"Assign the task\",3145,\"\\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+14+-+Host+by+FZU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Multi-University Training Contest 14 - Host by FZU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1299\":[\"Fantasy Cricket\",215,null],\"HDU-4942\":[\"Game on S♂play\",164,\"\\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+7\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 Multi-University Training Contest 7 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1796\":[\"How many integers can you find\",3189,\"\\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%A84%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 “Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up(4) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1058\":[\"Parallelogram Counting\",1208,null],\"LightOJ-1179\":[\"Josephus Problem\",1420,null],\"SPOJ-VLATTICE\":[\"Visible Lattice Points\",1278,\"own problem used for Indian ICPC training camp\"],\"ZOJ-3522\":[\"Hide and seek\",44,null],\"POJ-3080\":[\"Blue Jeans\",8240,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouth+Central+USA+2006\\\"\\u003eSouth Central USA 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10518\":[\"How Many Calls?\",1769,null],\"ZOJ-1586\":[\"QS Network\",6293,null],\"SGU-106\":[\"The equation\",1327,\"\"],\"POJ-3087\":[\"Shuffle\\u0027m Up\",8836,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dGreater+New+York+2006\\\"\\u003eGreater New York 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-3746\":[\"Cyclic Nacklace\",8236,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+3rd+%A1%B0Vegetable-Birds+Cup%A1%B1+Programming+Open+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 3rd “Vegetable-Birds Cup” Programming Open Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3169\":[\"Layout\",7286,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+December+Gold\\\"\\u003eUSACO 2005 December Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2897\":[\"邂逅明下\",3479,\"\\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+10+-+Host+by+NIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 10 - Host by NIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1205\":[\"吃糖果\",12619,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dGardon-DYGG+Contest+2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Gardon-DYGG Contest 2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4718\":[\"The LCIS on the Tree\",358,\"\\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\"],\"SPOJ-NSUBSTR\":[\"Substrings\",2060,\"Immagination\"],\"CodeForces-235E\":[\"Number Challenge\",926,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/235\\\"\\u003eCodeforces Round 146 (Div. 1)\\u003c/a\\u003e\"],\"HDU-3507\":[\"Print Article\",4513,\"\\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%A87%A3%A9%A1%AA%A1%AAHost+by+HIT+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(7)——Host by HIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1140\":[\"How Many Zeroes?\",1769,null],\"LightOJ-1261\":[\"K-SAT Problem\",1554,null],\"LightOJ-1382\":[\"The Queue\",574,null],\"LightOJ-1020\":[\"A Childhood Game\",3271,null],\"HDU-1560\":[\"DNA sequence\",2049,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2006-12+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2006-12 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3863\":[\"No Gambling\",1522,\"\\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+3+-+Host+by+BIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Multi-University Training Contest 3 - Host by BIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1144\":[\"Ray Gun\",396,null],\"LightOJ-1265\":[\"Island of Survival\",1432,null],\"HDU-3622\":[\"Bomb Game\",1442,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Regional+Tianjin+Site+%A1%AA%A1%AA+Online+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Regional Tianjin Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1024\":[\"Eid\",1707,null],\"LightOJ-1387\":[\"Setu\",5610,null],\"HDU-2896\":[\"病毒侵袭\",6487,\"\\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+10+-+Host+by+NIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 10 - Host by NIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1686\":[\"Oulipo\",11269,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BB%AA%B6%AB%C7%F8%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%D1%FB%C7%EB%C8%FC_%C8%C8%C9%ED%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 华东区大学生程序设计邀请赛_热身赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1564\":[\"Play a game\",4051,\"\\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\"],\"ZOJ-3537\":[\"Cake\",1577,null],\"SPOJ-DISUBSTR\":[\"Distinct Substrings\",7770,\"ByteCode \\u002706\"],\"LightOJ-1138\":[\"Trailing Zeroes (III)\",7092,null],\"LightOJ-1259\":[\"Goldbach\\u0027s Conjecture\",6075,null],\"FZU-1901\":[\"Period II\",817,\"FOJ有奖月赛-2010年05月\"],\"POJ-3294\":[\"Life Forms\",3085,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+Local+Contest\\\"\\u003eWaterloo Local Contest\\u003c/a\\u003e, 2006.9.30\\u003c/div\\u003e\"],\"HDU-4725\":[\"The Shortest Path in Nya Graph\",2906,\"\\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-3516\":[\"Tree Construction\",1043,\"\\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\"],\"HDU-1698\":[\"Just a Hook\",18543,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+%A1%B0Sunline+Cup%A1%B1+National+Invitational+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 “Sunline Cup” National Invitational Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4847\":[\"Wow! Such Doge!\",2852,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014%CE%F7%B0%B2%C8%AB%B9%FA%D1%FB%C7%EB%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014西安全国邀请赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3177\":[\"Redundant Paths\",5927,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+January+Gold\\\"\\u003eUSACO 2006 January Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"SPOJ-SUBLEX\":[\"Lexicographical Substring Search\",2998,\"Own Problem\"],\"HDU-4965\":[\"Fast Matrix Calculation\",1126,\"\\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+9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 Multi-University Training Contest 9 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2426\":[\"Interesting Housing Problem\",898,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+Asia+Hangzhou+Regional+Contest+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 Asia Hangzhou Regional Contest Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3998\":[\"Sequence\",720,\"\\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+16+-+Host+by+TJU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Multi-University Training Contest 16 - Host by TJU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4729\":[\"An Easy Problem for Elfness\",224,\"\\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+Chengdu+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Chengdu Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4609\":[\"3-idiots\",2210,\"\\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+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3518\":[\"Boring counting\",1188,\"\\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%A89%A3%A9%A1%AA%A1%AAHost+by+HNU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(9)——Host by HNU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1030\":[\"Discovering Gold\",3579,null],\"CodeForces-149D\":[\"Coloring Brackets\",5076,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/149\\\"\\u003eCodeforces Round 106 (Div. 2)\\u003c/a\\u003e\"],\"LightOJ-1151\":[\"Snakes and Ladders\",720,null],\"LightOJ-1393\":[\"Crazy Calendar\",887,null],\"HDU-1693\":[\"Eat the Trees\",1866,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+%A1%B0Sunline+Cup%A1%B1+National+Invitational+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 “Sunline Cup” National Invitational Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1274\":[\"Beating the Dataset\",479,null],\"LightOJ-1395\":[\"A Dangerous Maze (II)\",282,null],\"LightOJ-1275\":[\"Internet Service Providers\",1251,null],\"SPOJ-PHRASES\":[\"Relevant Phrases of Annihilation\",1152,\"DASM Programming League 2004 (problemset 1)\"],\"HDU-1695\":[\"GCD\",4776,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+%A1%B0Sunline+Cup%A1%B1+National+Invitational+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 “Sunline Cup” National Invitational Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1035\":[\"Intelligent Factorial Factorization\",5089,null],\"HDU-1213\":[\"How Many Tables\",26793,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%D1%A1%B0%CE%C8%FC%D6%AE%C8%C8%C9%ED%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM省赛集训队选拔赛之热身赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2665\":[\"Kth number\",1422,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU%C4%D0%C9%FA%D7%A8%B3%A1%B9%AB%BF%AA%C8%FC%A1%AA%A1%AA%B8%CF%D4%DA%C5%AE%C9%FA%D6%AE%C7%B0%CF%C8%B9%FD%BD%DA%A3%A8From+WHU%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU男生专场公开赛——赶在女生之前先过节(From WHU) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1278\":[\"Sum of Consecutive Integers\",1159,null],\"LightOJ-1399\":[\"Politeness\",55,null],\"UVA-10972\":[\"RevolC FaeLoN\",524,null],\"LightOJ-1027\":[\"A Dangerous Maze\",4025,null],\"LightOJ-1148\":[\"Mad Counting\",1870,null],\"LightOJ-1028\":[\"Trailing Zeroes (I)\",4037,null],\"UVALive-5135\":[\"Mining Your Own Business\",849,\"World Finals \\u003e\\u003e 2011 - Orlando\"],\"UVALive-4287\":[\"Proving Equivalences\",1085,\"Regionals 2008 \\u003e\\u003e Europe - Northwestern\"],\"SPOJ-SUBST1\":[\"New Distinct Substrings\",5199,\"Base on a problem in ByteCode06\"],\"UVA-11827\":[\"Maximum GCD\",8967,null],\"POJ-3061\":[\"Subsequence\",14842,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2006\\\"\\u003eSoutheastern Europe 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-464E\":[\"The Classic Problem\",1595,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/464\\\"\\u003eCodeforces Round 265 (Div. 1)\\u003c/a\\u003e\"],\"POJ-3186\":[\"Treats for the Cows\",4925,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+February+Gold+%26+Silver\\\"\\u003eUSACO 2006 February Gold \\u0026amp; Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3185\":[\"The Water Bowls\",2683,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+January+Bronze\\\"\\u003eUSACO 2006 January Bronze\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10200\":[\"Prime Time\",4170,null],\"HDU-4979\":[\"A simple math problem.\",205,\"\\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+10\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 Multi-University Training Contest 10 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4734\":[\"F(x)\",4140,\"\\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+Chengdu+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Chengdu Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3404\":[\"Switch lights\",374,\"\\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.05.01\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.05.01 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-11651\":[\"Krypton Number System\",267,null],\"HDU-4614\":[\"Vases and Flowers\",2611,\"\\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+2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4738\":[\"Caocao\\u0027s Bridges\",2669,\"\\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+Hangzhou+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Hangzhou Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1364\":[\"Expected Cards\",417,null],\"UVA-10325\":[\"The Lottery\",2973,null],\"HDU-3523\":[\"Image copy detection\",278,\"\\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%A89%A3%A9%A1%AA%A1%AAHost+by+HNU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(9)——Host by HNU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1365\":[\"ICPC Guards\",63,null],\"UVA-10689\":[\"Yet another Number Sequence\",2492,null],\"HDU-4612\":[\"Warm up\",1572,\"\\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+2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1124\":[\"Cricket Ranking\",281,null],\"LightOJ-1245\":[\"Harmonic Number (II)\",2904,null],\"LightOJ-1366\":[\"Pair of Touching Circles\",155,null],\"HDU-3642\":[\"Get The Treasury\",921,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Regional+Hangzhou+Site+%A1%AA%A1%AA+Online+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Regional Hangzhou Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1246\":[\"Colorful Board\",290,null],\"LightOJ-1236\":[\"Pairs Forming LCM\",2668,null],\"LightOJ-1116\":[\"Ekka Dokka\",7992,null],\"UVALive-7346\":[\"Avoiding an Arrrgument\",29,\"Regionals 2015 \\u003e\\u003e North America - Mid-Atlantic USA\"],\"LightOJ-1117\":[\"Helping Cicada\",1256,null],\"ZOJ-3430\":[\"Detect the Virus\",2193,null],\"HDU-3416\":[\"Marriage Match IV\",1528,\"\\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.06.05\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.06.05 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3537\":[\"Daizhenyang\\u0027s Coin\",657,\"\\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%A811%A3%A9%A1%AA%A1%AAHost+by+BUPT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(11)——Host by BUPT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1358\":[\"Period\",7362,\"\"],\"HDU-2449\":[\"Gauss Elimination\",251,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+Asia+Regional+Harbin\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 Asia Regional Harbin \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2328\":[\"Corporate Identity\",1529,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dCTU+Open+Contest+2007\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e CTU Open Contest 2007 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3415\":[\"Max Sum of Max-K-sub-sequence\",2815,\"\\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.06.05\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.06.05 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2448\":[\"Mining Station on the Sea\",746,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+Asia+Regional+Harbin\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 Asia Regional Harbin \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1238\":[\"Substrings\",5732,\"\"],\"HDU-4746\":[\"Mophues\",895,\"\\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+Hangzhou+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Hangzhou Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4507\":[\"吉哥系列故事——恨7不成妻\",2429,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013%CC%DA%D1%B6%B1%E0%B3%CC%C2%ED%C0%AD%CB%C9%B3%F5%C8%FC%B5%DA%D2%BB%B3%A1%A3%A83%D4%C221%C8%D5%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013腾讯编程马拉松初赛第一场(3月21日) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1370\":[\"Bi-shoe and Phi-shoe\",4704,null],\"HDU-1350\":[\"Taxi Cab Scheme\",753,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dNorthwestern+Europe+2004\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Northwestern Europe 2004 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1371\":[\"Energetic Pandas\",477,null],\"LightOJ-1010\":[\"Knights on a Chessboard\",6912,null],\"LightOJ-1253\":[\"Misere Nim\",1964,null],\"HDU-3533\":[\"Escape\",919,\"\\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%A810%A3%A9%A1%AA%A1%AAHost+by+HEU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(10)——Host by HEU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1233\":[\"还是畅通工程\",22550,\"\\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\"],\"LightOJ-1375\":[\"LCM Extreme\",516,null],\"HDU-4622\":[\"Reincarnation\",1531,\"\\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\"],\"HDU-3652\":[\"B-number\",5523,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Regional+Chengdu+Site+%A1%AA%A1%AA+Online+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Regional Chengdu Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3410\":[\"Passing the Message\",1314,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+National+Programming+Invitational+Contest+Host+by+ZSTU+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 National Programming Invitational Contest Host by ZSTU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1114\":[\"Piggy-Bank\",18706,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dCentral+Europe+1999\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Central Europe 1999 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-11885\":[\"Number of Battlefields\",200,null],\"LightOJ-1014\":[\"Iftar Party\",4382,null],\"HDU-2444\":[\"The Accomodation of Students\",4129,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+Asia+Harbin+Regional+Contest+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 Asia Harbin Regional Contest Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1005\":[\"Rooks\",4917,null],\"LightOJ-1247\":[\"Matrix Game\",1928,null],\"LightOJ-1248\":[\"Dice (III)\",2091,null],\"LightOJ-1369\":[\"Answering Queries\",1199,null],\"LightOJ-1007\":[\"Mathematically Hard\",4566,null],\"LightOJ-1249\":[\"Chocolate Thief\",3624,null],\"LightOJ-1008\":[\"Fibsieve\\u0027s Fantabulous Birthday\",8619,null],\"ZOJ-2477\":[\"Magic Cube\",518,null],\"FZU-1911\":[\"Construct a Matrix\",186,\"2010年全国大学生程序设计邀请赛(福州)\"],\"ZOJ-2112\":[\"Dynamic Rankings\",5749,null],\"HDU-4758\":[\"Walk Through Squares\",509,\"\\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+Nanjing+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Nanjing Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3549\":[\"Flow Problem\",6556,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHyperHexagon%26%23039%3Bs+Summer+Gift+%28Original+tasks%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HyperHexagon\\u0027s Summer Gift (Original tasks) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2457\":[\"DNA repair\",1633,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+Asia+Hefei+Regional+Contest+Online+by+USTC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 Asia Hefei Regional Contest Online by USTC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-11752\":[\"The Super Powers\",2193,null],\"HDU-4635\":[\"Strongly connected\",1747,\"\\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+4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 4 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4871\":[\"Shortest-path tree\",492,\"\\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+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 Multi-University Training Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1340\":[\"Story of Tomisu Ghost\",620,null],\"HDU-4990\":[\"Reading comprehension\",1452,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%238\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #8 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1241\":[\"Oil Deposits\",26402,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Central+USA+1997\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central USA 1997 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1220\":[\"Mysterious Bacteria\",2693,null],\"LightOJ-1341\":[\"Aladdin and the Flying Carpet\",3218,null],\"HDU-3544\":[\"Alice\\u0027s Game\",588,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHyperHexagon%26%23039%3Bs+Summer+Gift+%28Original+tasks%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HyperHexagon\\u0027s Summer Gift (Original tasks) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1342\":[\"Aladdin and the Magical Sticks\",362,null],\"HDU-4513\":[\"吉哥系列故事——完美队形II\",3130,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013%CC%DA%D1%B6%B1%E0%B3%CC%C2%ED%C0%AD%CB%C9%B3%F5%C8%FC%B5%DA%B6%FE%B3%A1%A3%A83%D4%C222%C8%D5%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013腾讯编程马拉松初赛第二场(3月22日) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-3209\":[\"Treasure Map\",2485,null],\"LightOJ-1102\":[\"Problem Makes Problem\",1714,null],\"LightOJ-1344\":[\"Aladdin and the Game of Bracelets\",174,null],\"UVA-11754\":[\"Code Feat\",785,null],\"HDU-4511\":[\"小明系列故事——女友的考验\",599,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013%CC%DA%D1%B6%B1%E0%B3%CC%C2%ED%C0%AD%CB%C9%B3%F5%C8%FC%B5%DA%B6%FE%B3%A1%A3%A83%D4%C222%C8%D5%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013腾讯编程马拉松初赛第二场(3月22日) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1214\":[\"Large Division\",9578,null],\"UVA-315\":[\"Network\",9590,null],\"LightOJ-1215\":[\"Finding LCM\",2686,null],\"LightOJ-1336\":[\"Sigma Function\",2865,null],\"LightOJ-1338\":[\"Hidden Secret!\",4621,null],\"ZOJ-3213\":[\"Beautiful Meadow\",839,null],\"黑暗爆炸-1500\":[\"维修数列\",258,\"NOI2005\"],\"UVA-796\":[\"Critical Links\",6445,null],\"HDU-4407\":[\"Sum\",1053,\"\\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+Jinhua+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Jinhua Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4528\":[\"小明系列故事——捉迷藏\",656,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013%CC%DA%D1%B6%B1%E0%B3%CC%C2%ED%C0%AD%CB%C9%B3%F5%C8%FC%B5%DA%CE%E5%B3%A1%A3%A83%D4%C225%C8%D5%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013腾讯编程马拉松初赛第五场(3月25日) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3436\":[\"Queue-jumpers\",787,\"\\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%A81%A3%A9%A1%AA%A1%AAHost+by+FZU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(1)——Host by FZU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3315\":[\"My Brute\",439,\"\\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+2010-02-14+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU “Valentines Day” Open Programming Contest 2010-02-14 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4768\":[\"Flyer\",1134,\"\\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+Changchun+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Changchun Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4408\":[\"Minimum Spanning Tree\",576,\"\\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+Jinhua+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Jinhua Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1495\":[\"非常可乐\",11352,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%A1%B02006%D0%A3%D4%B0%CE%C4%BB%AF%BB%EE%B6%AF%D4%C2%A1%B1%D6%AE%A1%B0%D0%A3%C7%EC%B1%AD%A1%B1%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC%F4%DF%BA%BC%D6%DD%B5%E7%D7%D3%BF%C6%BC%BC%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 “2006校园文化活动月”之“校庆杯”大学生程序设计竞赛暨杭州电子科技大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1352\":[\"Strange Summation\",112,null],\"HDU-3555\":[\"Bomb\",8265,\"\\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%A812%A3%A9%A1%AA%A1%AAHost+by+WHU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(12)——Host by WHU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1255\":[\"覆盖的面积\",3479,\"\"],\"HDU-2102\":[\"A计划\",7268,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-6+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-6 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2586\":[\"How far away ?\",9122,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dECJTU+2009+Spring+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ECJTU 2009 Spring Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10655\":[\"Contemplation! Algebra\",1502,null],\"UVALive-7349\":[\"The Scheming Gardener\",0,\"Regionals 2015 \\u003e\\u003e North America - Mid-Atlantic USA\"],\"黑暗爆炸-2818\":[\"Gcd\",348,\"湖北省队互测\"],\"HDU-3435\":[\"A new Graph Game\",876,\"\\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%A81%A3%A9%A1%AA%A1%AAHost+by+FZU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(1)——Host by FZU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2222\":[\"Keywords Search\",14103,\"\"],\"LightOJ-1354\":[\"IP Checking\",7337,null],\"UVA-11624\":[\"Fire!\",8908,null],\"HDU-1257\":[\"最少拦截系统\",26462,\"\\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\"],\"LightOJ-1234\":[\"Harmonic Number\",3641,null],\"LightOJ-1355\":[\"Game of CS\",215,null],\"HDU-4763\":[\"Theme Section\",2819,\"\\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+Changchun+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Changchun Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVALive-7347\":[\"Of the Children\",0,\"Regionals 2015 \\u003e\\u003e North America - Mid-Atlantic USA\"],\"HDU-1498\":[\"50 years, 50 colors\",1658,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%A1%B02006%D0%A3%D4%B0%CE%C4%BB%AF%BB%EE%B6%AF%D4%C2%A1%B1%D6%AE%A1%B0%D0%A3%C7%EC%B1%AD%A1%B1%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC%F4%DF%BA%BC%D6%DD%B5%E7%D7%D3%BF%C6%BC%BC%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 “2006校园文化活动月”之“校庆杯”大学生程序设计竞赛暨杭州电子科技大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1356\":[\"Prime Independence\",933,null],\"UVALive-7348\":[\"Talking About Numbers\",60,\"Regionals 2015 \\u003e\\u003e North America - Mid-Atlantic USA\"],\"LightOJ-1104\":[\"Birthday Paradox\",2520,null],\"LightOJ-1226\":[\"One Unit Machine\",591,null],\"ZOJ-3469\":[\"Food Delivery\",2196,null],\"LightOJ-1348\":[\"Aladdin and the Return Journey\",1573,null],\"ZOJ-3228\":[\"Searching the String\",2544,null],\"LightOJ-1349\":[\"Aladdin and the Optimal Invitation\",573,null],\"LightOJ-1229\":[\"Treblecross\",310,null],\"LightOJ-1109\":[\"False Ordering\",6194,null],\"ZOJ-3466\":[\"The Hive II\",295,null],\"CodeForces-553E\":[\"Kyoya and Train\",604,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/553\\\"\\u003eCodeforces Round 309 (Div. 1)\\u003c/a\\u003e\"],\"HDU-1028\":[\"Ignatius and the Princess III\",16521,\"\"],\"HDU-4417\":[\"Super Mario\",3708,\"\\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+Hangzhou+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Hangzhou Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2119\":[\"Matrix\",1533,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-10++Programming+Contest_WarmUp\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-10 Programming Contest_WarmUp \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1029\":[\"Ignatius and the Princess IV\",21758,\"\"],\"HDU-4416\":[\"Good Article Good sentence\",868,\"\\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+Hangzhou+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Hangzhou Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"SPOJ-COT2\":[\"Count on a tree II\",3872,\"Just for fun...\"],\"UVA-1423\":[\"Guess\",516,null],\"UVA-10480\":[\"Sabotage\",2557,null],\"HDU-2594\":[\"Simpsons’ Hidden Talents\",6623,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2010-05+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2010-05 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2476\":[\"String painter\",3792,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+Asia+Regional+Chengdu\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 Asia Regional Chengdu \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1024\":[\"Max Sum Plus Plus\",13665,\"\"],\"SPOJ-DETER3\":[\"Find The Determinant III\",572,\"own problem\"],\"HDU-3567\":[\"Eight II\",1183,\"\\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%A813%A3%A9%A1%AA%A1%AAHost+by+UESTC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(13)——Host by UESTC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2475\":[\"Box\",618,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+Asia+Regional+Chengdu\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 Asia Regional Chengdu \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1321\":[\"Sending Packets\",575,null],\"HDU-4656\":[\"Evaluation\",196,\"\\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+6\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 6 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1847\":[\"Tram\",6466,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCroatia+OI+2002+Regional+-+Juniors\\\"\\u003eCroatia OI 2002 Regional - Juniors\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3905\":[\"Perfect Election\",505,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+European+Regional+Programming+Contest+2008\\\"\\u003eSoutheastern European Regional Programming Contest 2008\\u003c/a\\u003e\\u003c/div\\u003e\"],\"LightOJ-1322\":[\"Worst Case Trie\",236,null],\"LightOJ-1323\":[\"Billiard Balls\",229,null],\"ZOJ-1610\":[\"Count the Colors\",13118,null],\"LightOJ-1315\":[\"Game of Hyper Knights\",867,null],\"LightOJ-1317\":[\"Throwing Balls into the Baskets\",1149,null],\"LightOJ-1318\":[\"Strange Game\",176,null],\"HDU-1260\":[\"Tickets\",6413,\"\\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\"],\"LightOJ-1319\":[\"Monkey Tradition\",1108,null],\"CodeForces-754E\":[\"Dasha and cyclic table\",527,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/754\\\"\\u003eCodeforces Round 390 (Div. 2)\\u003c/a\\u003e\"],\"HDU-4549\":[\"M斐波那契数列\",1931,\"\\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%B3%F5%C8%FC%A3%A82%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013金山西山居创意游戏程序挑战赛——初赛(2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4305\":[\"Lightning\",679,\"\\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-3338\":[\"Kakuro Extension\",698,\"\\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.03.06\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.03.06 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1611\":[\"The Suspects\",24416,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dAsia+Kaohsiung+2003\\\"\\u003eAsia Kaohsiung 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2942\":[\"Knights of the Round Table\",2923,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCentral+Europe+2005\\\"\\u003eCentral Europe 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-4309\":[\"Seikimatsu Occult Tonneru\",482,\"\\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-1272\":[\"小希的迷宫\",17344,\"\\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\"],\"HDU-1151\":[\"Air Raid\",4341,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+2002%2C+Dhaka+%28Bengal%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 2002, Dhaka (Bengal) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4300\":[\"Clairewd’s message\",3094,\"\\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-4421\":[\"Bit Magic\",739,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+Asia+ChangChun+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Asia ChangChun Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2485\":[\"Destroying the bus stations\",802,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+Asia+Regional+Beijing\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 Asia Regional Beijing \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2243\":[\"考研路茫茫——单词情结\",2012,\"\"],\"POJ-1733\":[\"Parity game\",4859,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCEOI+1999\\\"\\u003eCEOI 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-3572\":[\"Task Schedule\",2110,\"\\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%A813%A3%A9%A1%AA%A1%AAHost+by+UESTC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(13)——Host by UESTC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"URAL-1099\":[\"Work Scheduling\",1351,\"\"],\"HDU-2121\":[\"Ice_cream’s world II\",1443,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-10++Programming+Contest_WarmUp\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-10 Programming Contest_WarmUp \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2828\":[\"Buy Tickets\",8830,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.05.28\\\"\\u003ePOJ Monthly--2006.05.28\\u003c/a\\u003e, Zhu, Zeyuan\\u003c/div\\u003e\"],\"HDU-3335\":[\"Divisibility\",765,\"\\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.03.06\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.03.06 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1398\":[\"Square Coins\",7779,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+1999%2C+Kyoto+%28Japan%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 1999, Kyoto (Japan) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1739\":[\"Tony\\u0027s Tour\",1068,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dLouTiancheng%40POJ\\\"\\u003eLouTiancheng@POJ\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HUST-1010\":[\"The Minimum Length\",811,\"\"],\"HDU-2486\":[\"A simple stone game\",548,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+Asia+Regional+Beijing\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 Asia Regional Beijing \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3336\":[\"Count the string\",7376,\"\\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.03.06\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.03.06 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2947\":[\"Widget Factory\",1638,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCentral+Europe+2005\\\"\\u003eCentral Europe 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2826\":[\"An Easy Problem?!\",1933,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.04.28\\\"\\u003ePOJ Monthly--2006.04.28\\u003c/a\\u003e, Dagger@PKU_RPWT\\u003c/div\\u003e\"],\"LightOJ-1333\":[\"Grid Coloring\",380,null],\"UVA-11324\":[\"The Largest Clique\",2108,null],\"LightOJ-1213\":[\"Fantasy of a Summation\",2138,null],\"LightOJ-1326\":[\"Race\",1276,null],\"SPOJ-FTOUR2\":[\"Free tour II\",809,\"Adapted from Preslav Le\\u0027s problem, first used in Bulgarian OI 07\"],\"HDU-1150\":[\"Machine Schedule\",4403,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+2002%2C+Beijing+%28Mainland+China%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 2002, Beijing (Mainland China) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"黑暗爆炸-2049\":[\"Cave 洞穴勘测\",190,\"Sdoi2008\"],\"UVA-1310\":[\"One-way traffic\",112,null],\"UVA-11551\":[\"Experienced Endeavour\",504,null],\"UVA-10462\":[\"Is There A Second Way Left?\",2769,null],\"POJ-2912\":[\"Rochambeau\",2121,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBaidu+Star+2006+Preliminary\\\"\\u003eBaidu Star 2006 Preliminary\\u003c/a\\u003e\\r\\u003cbr\\u003eChen, Shixi (xreborner) living in http://fairyair.yeah.net/\\u003c/div\\u003e\"],\"HDU-4553\":[\"约会安排\",1166,\"\\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%B3%F5%C8%FC%A3%A83%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013金山西山居创意游戏程序挑战赛——初赛(3) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3341\":[\"Lost\\u0027s revenge\",972,\"\\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.03.06\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.03.06 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1043\":[\"Eight\",5283,\"\\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\"],\"HDU-5646\":[\"DZY Loves Partition\",685,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2376+%28div.2%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #76 (div.2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3468\":[\"Treasure Hunting\",106,\"\\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%A83%A3%A9%A1%AA%A1%AAHost+by+WHU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(3)——Host by WHU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1166\":[\"敌兵布阵\",39125,\"\"],\"HDU-1045\":[\"Fire Net\",9490,\"\\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-4315\":[\"Climbing the Hill\",791,\"\\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+2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2255\":[\"奔小康赚大钱\",4941,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+2008+Summer+Exercise%A3%A84%A3%A9-+Buffet+Dinner\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ 2008 Summer Exercise(4)- Buffet Dinner \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4436\":[\"str2int\",800,\"\\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\"],\"HDU-4675\":[\"GCD of Sequence\",589,\"\\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+7\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 7 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1422\":[\"Halloween Costumes\",3136,null],\"LightOJ-1414\":[\"February 29\",3493,null],\"HUST-1017\":[\"Exact cover\",418,\"dupeng\"],\"LightOJ-1419\":[\"Necklace\",589,null],\"HDU-1160\":[\"FatMouse\\u0027s Speed\",9596,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZhejiang+University+Training+Contest+2001\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Zhejiang University Training Contest 2001 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1281\":[\"棋盘游戏\",4305,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VI%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VI) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2149\":[\"Public Sale\",7376,\"\\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%A1%AA%A1%AA2008-01-02%A3%A83+%BD%CC417%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM程序设计期末考试——2008-01-02(3 教417) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3359\":[\"Kind of a Blur\",640,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+ANARC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 ANARC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3118\":[\"Arbiter\",662,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Asia+Wuhan+Regional+Contest+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Asia Wuhan Regional Contest Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1830\":[\"开关问题\",3689,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dLIANGLIANG%40POJ\\\"\\u003eLIANGLIANG@POJ\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-4685\":[\"Prince and Princess\",532,\"\\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+8\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 8 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1176\":[\"免费馅饼\",21573,\"\"],\"HDU-3472\":[\"HS BDC\",417,\"\\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%A84%A3%A9%A1%AA%A1%AAHost+by+UESTC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(4)——Host by UESTC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1054\":[\"Strategic Game\",4161,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSoutheastern+Europe+2000\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Southeastern Europe 2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3473\":[\"Minimum Sum\",727,\"\\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%A84%A3%A9%A1%AA%A1%AAHost+by+UESTC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(4)——Host by UESTC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1430\":[\"A Question of Time\",72,null],\"UVA-11426\":[\"GCD - Extreme (II)\",4398,null],\"LightOJ-1311\":[\"Unlucky Bird\",3697,null],\"HDU-4565\":[\"So Easy!\",1788,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+ACM-ICPC%B3%A4%C9%B3%C8%FC%C7%F8%C8%AB%B9%FA%D1%FB%C7%EB%C8%FC%A1%AA%A1%AA%CC%E2%C4%BF%D6%D8%CF%D6\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM-ICPC长沙赛区全国邀请赛——题目重现 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4686\":[\"Arc of Dream\",1479,\"\\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+9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 9 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2389\":[\"Rain on your Parade\",1511,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2008-10+Public+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2008-10 Public Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1433\":[\"Minimum Arc Distance\",5328,null],\"HDU-1179\":[\"Ollivanders: Makers of Fine Wands since 382 BC.\",1410,\"\\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-4687\":[\"Boke and Tsukkomi\",447,\"\\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+9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 9 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1306\":[\"Solutions to an Equation\",790,null],\"FZU-1977\":[\"Pandora adventure\",103,\"The 35th ACM/ICPC Asia Regional Fuzhou Site —— Online Contest\"],\"HDU-1171\":[\"Big Event in HDU\",11737,\"\"],\"UVALive-5097\":[\"Cross the Wall\",189,\"Regionals 2010 \\u003e\\u003e Asia - Harbin\"],\"CodeForces-993E\":[\"Nikita and Order Statistics\",1527,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/993\\\"\\u003eCodeforces Round 488 by NEAR (Div. 1)\\u003c/a\\u003e\"],\"黑暗爆炸-3153\":[\"Sone1\",109,\"Sone提供\"],\"黑暗爆炸-1095\":[\"Hide 捉迷藏\",235,\"ZJOI2007\"],\"UVA-10047\":[\"The Monocycle\",3139,null],\"UVA-12345\":[\"Dynamic len(set(a[L:R]))\",1122,null],\"HDU-5307\":[\"He is Flying\",409,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+Multi-University+Training+Contest+2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3001\":[\"Travelling\",2973,\"\\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+11+-+Host+by+HRBEU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 11 - Host by HRBEU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3486\":[\"Interviewe\",1873,\"\\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%A85%A3%A9%A1%AA%A1%AAHost+by+BJTU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(5)——Host by BJTU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3244\":[\"Inviting Friends\",196,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+%A1%B0NIT+Cup%A1%B1+National+Invitational+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 “NIT Cup” National Invitational Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3709\":[\"K-Anonymous Sequence\",1541,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.12.28\\\"\\u003ePOJ Founder Monthly Contest – 2008.12.28\\u003c/a\\u003e, Rainer\\u003c/div\\u003e\"],\"HDU-3247\":[\"Resource Archiver\",833,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+%A1%B0NIT+Cup%A1%B1+National+Invitational+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 “NIT Cup” National Invitational Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1068\":[\"Girls and Boys\",5378,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSoutheastern+Europe+2000\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Southeastern Europe 2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"SPOJ-LCS\":[\"Longest Common Substring\",4542,\"\"],\"HDU-4578\":[\"Transformation\",2610,\"\\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-1067\":[\"Gap\",1033,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+2003%A3%A8Aizu+Japan%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 2003(Aizu Japan) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3487\":[\"Play with Chain\",1665,\"\\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%A85%A3%A9%A1%AA%A1%AAHost+by+BJTU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(5)——Host by BJTU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3488\":[\"Tour\",1758,\"\\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%A86%A3%A9%A1%AA%A1%AAHost+by+BIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(6)——Host by BIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2739\":[\"Sum of Consecutive Prime Numbers\",15357,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2005\\\"\\u003eJapan 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1069\":[\"Monkey and Banana\",12349,\"\\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+1996\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Ulm Local Contest 1996 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3360\":[\"National Treasures\",417,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+ANARC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 ANARC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3480\":[\"Division\",1648,\"\\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%A85%A3%A9%A1%AA%A1%AAHost+by+BJTU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(5)——Host by BJTU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"SPOJ-GSS7\":[\"Can you answer these queries VII\",1475,\"my own problems\"],\"CodeForces-940F\":[\"Machine Learning\",2787,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/940\\\"\\u003eCodeforces Round 466 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-GSS2\":[\"Can you answer these queries II\",1983,\"Description, standard program and test data by Yang Zhe\"],\"POJ-1651\":[\"Multiplication Puzzle\",9175,\"\\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, Far-Eastern Subregion\\u003c/div\\u003e\"],\"POJ-2502\":[\"Subway\",4024,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2001.09.22\\\"\\u003eWaterloo local 2001.09.22\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1410\":[\"Intersection\",4029,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouthwestern+European+Regional+Contest+1995\\\"\\u003eSouthwestern European Regional Contest 1995\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1417\":[\"True Liars\",2130,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2002+Kanazawa\\\"\\u003eJapan 2002 Kanazawa\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1074\":[\"Doing Homework\",6557,\"\"],\"HDU-3374\":[\"String Problem\",2072,\"\\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\"],\"HDU-5672\":[\"String\",1335,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2381+%28div.2%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #81 (div.2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1079\":[\"Calendar Game\",3681,\"\\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-2289\":[\"Cup\",3210,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+4th+Baidu+Cup+final\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 4th Baidu Cup final \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1078\":[\"FatMouse and Cheese\",7300,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZhejiang+University+Training+Contest+2001\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Zhejiang University Training Contest 2001 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4348\":[\"To the moon\",1913,\"\\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+5\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 5 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2749\":[\"Building roads\",1677,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.01.22\\\"\\u003ePOJ Monthly--2006.01.22\\u003c/a\\u003e,zhucheng\\u003c/div\\u003e\"],\"HDU-3377\":[\"Plan\",355,\"\\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\"],\"LightOJ-1410\":[\"Consistent Verdicts\",471,null],\"LightOJ-1401\":[\"No More Tic-tac-toe\",237,null],\"UVALive-7297\":[\"Hounded by Indecision\",37,\"Regionals 2015 \\u003e\\u003e North America - Mid-Atlantic USA\"],\"UVALive-7295\":[\"Positive Con Sequences\",159,\"Regionals 2015 \\u003e\\u003e North America - Mid-Atlantic USA\"],\"LightOJ-1408\":[\"Batting Practice\",420,null],\"HDU-2282\":[\"Chocolate\",474,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+8th+Programming+Contest+Site%A3%A82%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 8th Programming Contest Site(2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2161\":[\"Primes\",8466,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+%A1%B0Sunline+Cup%A1%B1+National+Invitational+Contest+-+Warm+Up\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 “Sunline Cup” National Invitational Contest - Warm Up \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVALive-7292\":[\"Refract Facts\",114,\"Regionals 2015 \\u003e\\u003e North America - Mid-Atlantic USA\"],\"SPOJ-SQFREE\":[\"Square-free integers\",913,\"classic, own input\"],\"POJ-1860\":[\"Currency Exchange\",13238,\"\\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-11475\":[\"Extend to Palindrome\",5781,null],\"POJ-1984\":[\"Navigation Nightmare\",2668,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+February\\\"\\u003eUSACO 2004 February\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2831\":[\"Can We Build This One?\",556,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.05.28\\\"\\u003ePOJ Monthly--2006.05.28\\u003c/a\\u003e, zhucheng\\u003c/div\\u003e\"],\"POJ-1743\":[\"Musical Theme\",6280,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dLouTiancheng%40POJ\\\"\\u003eLouTiancheng@POJ\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1625\":[\"Censored!\",1813,\"\\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\"],\"HDU-2296\":[\"Ring\",1309,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+4th+Baidu+Cup+final\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 4th Baidu Cup final \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5323\":[\"Solve this interesting problem\",778,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+Multi-University+Training+Contest+3\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 3 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2295\":[\"Radar\",971,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+4th+Baidu+Cup+final\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 4th Baidu Cup final \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1085\":[\"Holding Bin-Laden Captive!\",8915,\"\"],\"HDU-5322\":[\"Hope\",390,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+Multi-University+Training+Contest+3\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 3 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1986\":[\"Distance Queries\",4406,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+February\\\"\\u003eUSACO 2004 February\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1502\":[\"MPI Maelstrom\",8752,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dEast+Central+North+America+1996\\\"\\u003eEast Central North America 1996\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-4352\":[\"XHXJ\\u0027s LIS\",2019,\"\\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+6\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 6 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2177\":[\"取(2堆)石子游戏\",2599,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dECJTU+2008+Summer+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ECJTU 2008 Summer Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1087\":[\"Super Jumping! Jumping! Jumping!\",24665,\"\"],\"HDU-2176\":[\"取(m堆)石子游戏\",3318,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dECJTU+2008+Summer+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ECJTU 2008 Summer Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2955\":[\"Brackets\",8688,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dStanford+Local+2004\\\"\\u003eStanford Local 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-3389\":[\"Game\",1156,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+5th+Guangting+Cup+Central+China+Invitational+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 5th Guangting Cup Central China Invitational Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4115\":[\"Eliminate the Conflict\",954,\"\\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\"],\"HDU-1083\":[\"Courses\",5622,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSoutheastern+Europe+2000\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Southeastern Europe 2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-986D\":[\"Perfect Encoding\",345,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/986\\\"\\u003eCodeforces Round 485 (Div. 1)\\u003c/a\\u003e\"],\"HDU-4008\":[\"Parent and son\",447,\"\\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\"],\"HDU-4009\":[\"Transfer water\",1243,\"\\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\"],\"POJ-1753\":[\"Flip Game\",18918,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2000\\\"\\u003eNortheastern Europe 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1511\":[\"Invitation Cards\",7955,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCentral+Europe+1998\\\"\\u003eCentral Europe 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1751\":[\"Highways\",6402,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+1999\\\"\\u003eNortheastern Europe 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1873\":[\"The Fortified Forest\",1675,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWorld+Finals+1999\\\"\\u003eWorld Finals 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2841\":[\"Navigation Game\",76,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.06.25\\\"\\u003ePOJ Monthly--2006.06.25\\u003c/a\\u003e, Yang Yi\\u003c/div\\u003e\"],\"HDU-3277\":[\"Marriage Match III\",487,\"\\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.01.02\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.01.02 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1755\":[\"Triathlon\",1107,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2000\\\"\\u003eNortheastern Europe 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2723\":[\"Get Luffy Out\",2388,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBeijing+2005\\\"\\u003eBeijing 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-3395\":[\"Special Fish\",732,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+5th+Guangting+Cup+Central+China+Invitational+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 5th Guangting Cup Central China Invitational Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3032\":[\"Nim or not Nim?\",2095,\"\\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+13+-+Host+by+HIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 13 - Host by HIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2188\":[\"悼念512汶川大地震遇难同胞——选拔志愿者\",8722,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008-06-18%A1%B6+ACM%B3%CC%D0%F2%C9%E8%BC%C6%A1%B7%C6%DA%C4%A9%BF%BC%CA%D4%A1%AA%A1%AA%CB%C4%B4%A8%BC%D3%D3%CD%A3%A1%D6%D0%B9%FA%BC%D3%D3%CD%A3%A1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008-06-18《 ACM程序设计》期末考试——四川加油!中国加油! \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4122\":[\"Alice\\u0027s mooncake shop\",883,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Asia+Fuzhou+Regional+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Asia Fuzhou Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3038\":[\"How Many Answers Are Wrong\",7299,\"\\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+13+-+Host+by+HIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 13 - Host by HIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4240\":[\"Route Redundancy\",392,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Greater+New+York+Regional+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Greater New York Regional \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2181\":[\"哈密顿绕行世界问题\",5747,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dECJTU+2008+Summer+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ECJTU 2008 Summer Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2063\":[\"过山车\",12880,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dRPG%D7%A8%B3%A1%C1%B7%CF%B0%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e RPG专场练习赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"SPOJ-COT\":[\"Count on a tree\",3674,\"Just for fun...\"],\"SPOJ-COT4\":[\"Count on a trie\",83,\"\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"Von","updateTime":1714231878000,"title":"[kuangbin]各种各样的题单(去重后)","dislikeCnt":12,"content":"##### 专题1 简单搜索 \n[problem:POJ-1321] [problem:POJ-2251] [problem:POJ-3278] [problem:POJ-3279] [problem:POJ-1426] [problem:POJ-3126] [problem:POJ-3087] [problem:POJ-3414] [problem:FZU-2150] [problem:UVA-11624] [problem:POJ-3984] [problem:HDU-1241] [problem:HDU-1495] [problem:HDU-2612] \n##### 专题2 搜索进阶 \n[problem:HDU-1043] [problem:HDU-3567] [problem:HDU-2181] [problem:HDU-3533] [problem:HDU-1560] [problem:ZOJ-2477] [problem:HDU-3085] [problem:HDU-1067] [problem:HDU-2102] [problem:HDU-3001]\n##### 专题3 Dancing Links\n[problem:HUST-1017] [problem:ZOJ-3209] [problem:HDU-2295] [problem:FZU-1686] [problem:POJ-1084] [problem:POJ-3074] [problem:ZOJ-3122] [problem:HDU-4069] [problem:HDU-3335] [problem:HDU-4979] [problem:HDU-5046] \n##### 专题4 最短路练习 \n[problem:POJ-2387] [problem:POJ-2253] [problem:POJ-1797] [problem:POJ-3268] [problem:POJ-1860] [problem:POJ-3259] [problem:POJ-1502] [problem:POJ-3660] [problem:POJ-2240] [problem:POJ-1511] [problem:POJ-3159] [problem:POJ-2502] [problem:POJ-1062] [problem:POJ-1847] [problem:LightOJ-1074] [problem:HDU-4725] [problem:HDU-3416] [problem:HDU-4370] [problem:POJ-3169] \n##### 专题5 并查集 \n[problem:POJ-2236] [problem:POJ-1611] [problem:HDU-1213] [problem:HDU-3038] [problem:POJ-1182] [problem:POJ-1417] [problem:POJ-1456] [problem:POJ-1733] [problem:POJ-1984] [problem:POJ-2492] [problem:POJ-2912] [problem:ZOJ-3261] [problem:HDU-1272] [problem:POJ-1308] \n##### 专题6 最小生成树 \n[problem:POJ-1251] [problem:POJ-1287] [problem:POJ-2031] [problem:POJ-2421] [problem:ZOJ-1586] [problem:POJ-1789] [problem:POJ-2349] [problem:POJ-1751] [problem:POJ-1258] [problem:POJ-3026] [problem:POJ-1679] [problem:HDU-1233] [problem:HDU-1875] \n##### 专题7 线段树 \n[problem:HDU-1166] [problem:HDU-1754] [problem:POJ-3468] [problem:POJ-2528] [problem:HDU-1698] [problem:ZOJ-1610] [problem:POJ-3264] [problem:HDU-4027] [problem:HDU-1540] [problem:HDU-3974] [problem:HDU-4578] [problem:HDU-4614] [problem:HDU-4553] [problem:POJ-1177] [problem:HDU-1255] [problem:HDU-1542] [problem:HDU-3642] \n##### 专题8 生成树 \n[problem:HDU-4081] [problem:UVA-10600] [problem:UVA-10462] [problem:POJ-3164] [problem:UVA-11183] [problem:HDU-2121] [problem:HDU-4009] [problem:UVA-10766] [problem:SPOJ-DETER3] [problem:URAL-1627] [problem:HDU-4305] [problem:HDU-4408] [problem:SPOJ-HIGH] \n##### 专题9 连通图 \n[problem:POJ-1236] [problem:UVA-315] [problem:UVA-796] [problem:POJ-3694] [problem:POJ-3177] [problem:HDU-4612] [problem:HDU-4635] [problem:HDU-4685] [problem:HDU-4738] \n##### 专题10 匹配问题 \n[problem:HDU-1045] [problem:HDU-2444] [problem:HDU-1083] [problem:HDU-1281] [problem:HDU-2819] [problem:HDU-2389] [problem:HDU-4185] [problem:POJ-3020] [problem:HDU-1054] [problem:HDU-1151] [problem:POJ-2594] [problem:HDU-2768] [problem:HDU-1669] [problem:POJ-2112] [problem:POJ-3189] [problem:HDU-2255] [problem:HDU-3488] [problem:URAL-1099] [problem:HDU-4687] \n##### 专题11 网络流 \n[problem:POJ-3436] [problem:POJ-3281] [problem:POJ-1087] [problem:POJ-2195] [problem:POJ-2516] [problem:POJ-1459] [problem:HDU-4280] [problem:HDU-4292] [problem:HDU-4289] [problem:UVA-10480] [problem:HDU-2732] [problem:HDU-3338] [problem:HDU-3605] [problem:HDU-3081] [problem:HDU-1532] [problem:HDU-3549] [problem:HDU-3572] [problem:HDU-2883] [problem:HDU-4183] [problem:HDU-4240] [problem:HDU-3277] [problem:HDU-2485] [problem:HDU-3998] [problem:HDU-4309] [problem:HDU-3472] \n##### 专题12 基础DP\n[problem:HDU-1024] [problem:HDU-1029] [problem:HDU-1069] [problem:HDU-1074] [problem:HDU-1087] [problem:HDU-1114] [problem:HDU-1176] [problem:HDU-1260] [problem:HDU-1257] [problem:HDU-1160] [problem:POJ-1015] [problem:POJ-1458] [problem:POJ-1661] [problem:POJ-2533] [problem:POJ-3186] [problem:HDU-1078] [problem:HDU-2859] [problem:POJ-3616] [problem:POJ-3666] \n##### 专题13 基础计算几何\n[problem:POJ-2318] [problem:POJ-2398] [problem:POJ-3304] [problem:POJ-1269] [problem:POJ-1556] [problem:POJ-2653] [problem:POJ-1066] [problem:POJ-1410] [problem:POJ-1696] [problem:POJ-3347] [problem:POJ-2826] [problem:POJ-1039] [problem:POJ-3449] [problem:POJ-1584] [problem:POJ-2074] \n##### 专题14 数论基础\n[problem:LightOJ-1370] [problem:LightOJ-1356] [problem:LightOJ-1341] [problem:LightOJ-1336] [problem:LightOJ-1282] [problem:LightOJ-1259] [problem:LightOJ-1245] [problem:LightOJ-1236] [problem:LightOJ-1234] [problem:LightOJ-1220] [problem:LightOJ-1214] [problem:LightOJ-1213] [problem:LightOJ-1197] [problem:LightOJ-1138] [problem:UVA-11426] [problem:UVA-11754] [problem:UVA-11916] [problem:POJ-1061] [problem:POJ-2115] [problem:POJ-2116] [problem:HDU-2161] [problem:UVA-11827] [problem:UVA-10200] [problem:SGU-106] [problem:POJ-2478] [problem:UVA-11752] \n##### 专题15 数位DP \n[problem:CodeForces-55D] [problem:HDU-4352] [problem:HDU-2089] [problem:HDU-3555] [problem:POJ-3252] [problem:HDU-3709] [problem:HDU-3652] [problem:HDU-4734] [problem:ZOJ-3494] [problem:HDU-4507] [problem:SPOJ-BALNUM] \n##### 专题16 KMP \u0026 扩展KMP Manacher \n[problem:HDU-1711] [problem:HDU-1686] [problem:HDU-2087] [problem:HDU-3746] [problem:HDU-1358] [problem:HUST-1010] [problem:POJ-2406] [problem:POJ-2752] [problem:POJ-3080] [problem:HDU-2594] [problem:HDU-3336] [problem:HDU-4300] [problem:HDU-1238] [problem:HDU-2328] [problem:HDU-3374] [problem:HDU-2609] [problem:FZU-1901] [problem:POJ-3746] [problem:HDU-3613] [problem:POJ-3376] [problem:POJ-3974] [problem:HDU-4513] [problem:HDU-3294] [problem:HDU-3068] [problem:HDU-4847] [problem:HDU-4763] \n##### 专题17 AC自动机 \n[problem:HDU-2222] [problem:HDU-2896] [problem:HDU-3065] [problem:ZOJ-3430] [problem:POJ-2778] [problem:HDU-2243] [problem:POJ-1625] [problem:HDU-2825] [problem:HDU-2296] [problem:HDU-2457] [problem:ZOJ-3228] [problem:HDU-3341] [problem:HDU-3247] [problem:HDU-4758] [problem:HDU-4511] \n##### 专题18 后缀数组 \n[problem:POJ-1743] [problem:POJ-3261] [problem:SPOJ-DISUBSTR] [problem:SPOJ-SUBST1] [problem:SPOJ-REPEATS] [problem:POJ-3693] [problem:POJ-2774] [problem:POJ-3415] [problem:POJ-3294] [problem:SPOJ-PHRASES] [problem:POJ-1226] [problem:UVA-11475] [problem:POJ-3581] [problem:POJ-3450] [problem:POJ-2758] \n##### 专题19 矩阵 \n[problem:CodeForces-450B] [problem:HDU-5015] [problem:HDU-4990] [problem:UVA-11651] [problem:HDU-4965] [problem:UVA-11551] [problem:UVA-10689] [problem:UVA-11149] [problem:UVA-10655] [problem:UVA-1386] [problem:UVA-10870] [problem:UVA-11885] [problem:HDU-4565] [problem:CodeForces-392C] [problem:CodeForces-385E] [problem:FZU-1911] [problem:UVA-10518] [problem:HDU-4549] [problem:HDU-4686] \n##### 专题20 斜率DP \n[problem:HDU-3507] [problem:HDU-2829] [problem:HDU-4528] [problem:HDU-1300] [problem:HDU-2993] [problem:UVALive-5097] [problem:HDU-3045] [problem:HDU-3516] [problem:POJ-1160] [problem:POJ-1180] [problem:POJ-2018] [problem:POJ-3709] [problem:POJ-2841] [problem:POJ-1260] [problem:UVA-12594] [problem:HDU-3480] [problem:UVALive-6771]\n##### 专题21 区间DP \n[problem:ZOJ-3537] [problem:LightOJ-1422] [problem:POJ-2955] [problem:CodeForces-149D] [problem:POJ-1651] [problem:ZOJ-3469] [problem:HDU-4283] [problem:HDU-2476] \n##### 专题22 计算几何之半平面交 \n[problem:POJ-3335] [problem:POJ-3130] [problem:POJ-1474] [problem:POJ-1279] [problem:POJ-3525] [problem:POJ-3384] [problem:POJ-1755] [problem:POJ-2540] [problem:POJ-2451] [problem:POJ-1271] [problem:UVA-11722] [problem:UVALive-7295] [problem:UVALive-7292] [problem:UVALive-7297] [problem:UVALive-7346] [problem:UVALive-7521] [problem:UVALive-7347] [problem:UVALive-7348] [problem:UVALive-7349] [problem:LightOJ-1433] [problem:LightOJ-1387] [problem:LightOJ-1338] [problem:LightOJ-1261] [problem:LightOJ-1249] \n##### 专题23 二分 尺取 单调栈队列 \n[problem:CodeForces-371C] [problem:POJ-3685] [problem:POJ-3104] [problem:POJ-3579] [problem:POJ-3258] [problem:POJ-3122] [problem:HDU-4768] [problem:HDU-2289] [problem:HDU-5493] [problem:HDU-4190] [problem:HDU-5646] [problem:HDU-5256] [problem:HDU-3244] [problem:POJ-2566] [problem:POJ-3061] [problem:POJ-2100] [problem:POJ-2739] [problem:HDU-5672] [problem:HDU-5178] [problem:HDU-5358] [problem:HDU-1937] [problem:HDU-3415] [problem:HDU-3410] [problem:HDU-4122] [problem:HDU-1506] \n##### 专题24 容斥原理 Mobius 反演 \n[problem:SPOJ-VLATTICE] [problem:HDU-1695] [problem:HDU-4746] [problem:HDU-4675] [problem:黑暗爆炸-2818] [problem:黑暗爆炸-2005] [problem:黑暗爆炸-2301] [problem:UVA-10325] [problem:UVA-11806] [problem:SPOJ-SQFREE] [problem:HDU-1205] [problem:HDU-4407] [problem:POJ-1091] [problem:HDU-1796] [problem:HDU-2841] [problem:URAL-1036] [problem:CodeForces-235E] [problem:黑暗爆炸-2440] [problem:黑暗爆炸-3529] [problem:黑暗爆炸-2154] \n##### 专题25 快速 Founier 变换·数论变换·FFT·NTT \n[problem:HDU-4609] [problem:HDU-1402] [problem:URAL-1996] [problem:CodeChef-PRIMEDST] [problem:CodeChef-COUNTARI] [problem:HDU-5322] [problem:HDU-5323] [problem:Gym-100341C] [problem:HDU-4656] [problem:HDU-5307] [problem:黑暗爆炸-1213] [problem:CodeForces-553E] [problem:CodeForces-754E] [problem:CodeForces-914G] [problem:CodeForces-954I] [problem:CodeForces-958F3] [problem:CodeForces-986D] [problem:CodeForces-993E] [problem:Kattis-kinversions] \n##### 专题26 伸展树(splay tree)练习 \n[problem:POJ-3481] [problem:POJ-2828] [problem:HDU-3468] [problem:HDU-1890] [problem:HDU-3436] [problem:HDU-3487] [problem:黑暗爆炸-1588] [problem:黑暗爆炸-1208] [problem:黑暗爆炸-1269] [problem:黑暗爆炸-1500] [problem:POJ-3580] [problem:HDU-2475] [problem:HDU-3726] \n##### 专题27 后缀自动机 \n[problem:SPOJ-LCS] [problem:SPOJ-LCS2] [problem:SPOJ-NSUBSTR] [problem:SPOJ-SUBLEX] [problem:SPOJ-COT4] [problem:HDU-4416] [problem:HDU-3518] [problem:HDU-4622] [problem:HDU-4436] \n##### 专题28 动态树LCT \n[problem:HDU-4010] [problem:黑暗爆炸-1036] [problem:黑暗爆炸-1095] [problem:黑暗爆炸-2002] [problem:黑暗爆炸-2049] [problem:黑暗爆炸-2243] [problem:黑暗爆炸-2759] [problem:黑暗爆炸-3153] [problem:黑暗爆炸-3669] [problem:SPOJ-GSS7] [problem:SPOJ-OTOCI] [problem:SPOJ-QTREE] [problem:URAL-1553] [problem:ZOJ-3522] \n##### 专题29 主席树 \n[problem:POJ-2104] [problem:SPOJ-COT] [problem:SPOJ-COT2] [problem:HDU-4417] [problem:HDU-4348] [problem:ZOJ-2112] [problem:CodeForces-464E] [problem:CodeForces-484E] [problem:SPOJ-MKTHNUM] \n##### 专题30 2-SAT \n[problem:HDU-3062] [problem:HDU-1824] [problem:HDU-3622] [problem:HDU-3715] [problem:HDU-1815] [problem:HDU-1816] [problem:HDU-1814] [problem:HDU-4115] [problem:HDU-4421] [problem:POJ-2296] [problem:POJ-2723] [problem:POJ-2749] [problem:POJ-3207] [problem:POJ-3648] [problem:POJ-3678] [problem:POJ-3683] [problem:POJ-3905] \n##### 专题31 树链剖分 \n[problem:FZU-2082] [problem:HDU-3966] [problem:LightOJ-1348] [problem:POJ-2763] [problem:POJ-3237] [problem:SPOJ-QTREE4] \n##### 专题32 插头DP \n[problem:HDU-1693] [problem:URAL-1519] [problem:FZU-1977] [problem:HDU-1964] [problem:HDU-3377] [problem:POJ-1739] [problem:POJ-3133] [problem:ZOJ-3466] [problem:ZOJ-3256] [problem:ZOJ-3213] [problem:HDU-4285] \n##### 专题33 划分树 \n[problem:HDU-2665] [problem:HDU-3473]\n##### 专题34 RMQ \n[problem:POJ-3368] [problem:黑暗爆炸-1067] [problem:POJ-1050] [problem:POJ-2019] [problem:HDU-3486] [problem:HDU-3193] [problem:HDU-2888] [problem:HDU-3183] \n##### 专题35 博弈论(I)\n[problem:HDU-1079] [problem:HDU-1525] [problem:HDU-1564] [problem:HDU-1846] [problem:HDU-1847] [problem:HDU-2516] [problem:HDU-2897] [problem:HDU-3032] [problem:HDU-3389] [problem:HDU-3537] [problem:HDU-3544] [problem:HDU-3863] [problem:HDU-3951] [problem:HDU-2188] [problem:HDU-2149] [problem:HDU-1850] [problem:HDU-2176] [problem:HDU-1527] [problem:HDU-2177] [problem:HDU-1517] [problem:HDU-2486] [problem:HDU-4315] [problem:HDU-1538] [problem:HDU-3404] \n##### 专题36 博弈论(II) \n[problem:LightOJ-1355] [problem:LightOJ-1186] [problem:LightOJ-1192] [problem:LightOJ-1247] [problem:LightOJ-1253] [problem:LightOJ-1393] [problem:LightOJ-1199] [problem:LightOJ-1229] [problem:LightOJ-1296] [problem:LightOJ-1315] [problem:LightOJ-1344] [problem:LightOJ-1401] \n##### 专题37 莫队算法 \n[problem:黑暗爆炸-2038] [problem:NBUT-1457] [problem:POJ-3241] [problem:UVALive-3662] [problem:CodeForces-220B] [problem:CodeForces-940F] [problem:CodeForces-617E] [problem:SPOJ-GSS2] [problem:CodeForces-86D] [problem:LightOJ-1188] [problem:UVA-12345] [problem:黑暗爆炸-2120] \n##### 专题38 树分治 \n[problem:HDU-4871] [problem:HDU-4918] [problem:SPOJ-FTOUR2] \n##### 专题39 KM匹配 \n[problem:HDU-1533] [problem:HDU-2426] [problem:HDU-3395] [problem:HDU-2282] [problem:HDU-2813] [problem:HDU-1853] [problem:HDU-3435] [problem:HDU-3722] [problem:HDU-3718] [problem:HDU-2448] [problem:HDU-2853] [problem:HDU-3315] [problem:HDU-3523] [problem:POJ-2400] [problem:POJ-3565] [problem:POJ-3686] \n##### 专题40 母函数 \n[problem:HDU-1028] [problem:HDU-1085] [problem:HDU-1171] [problem:HDU-1398] \n##### 数学训练一 \n[problem:LightOJ-1008] [problem:LightOJ-1010] [problem:LightOJ-1020] [problem:LightOJ-1078] [problem:LightOJ-1116] [problem:LightOJ-1148] [problem:LightOJ-1179] [problem:LightOJ-1275] [problem:LightOJ-1294] [problem:LightOJ-1297] [problem:LightOJ-1311] [problem:LightOJ-1323] [problem:LightOJ-1349] [problem:LightOJ-1354] [problem:LightOJ-1369] [problem:LightOJ-1410] [problem:LightOJ-1414] [problem:LightOJ-1430] [problem:LightOJ-1024] [problem:LightOJ-1319] \n##### 数学训练二 \n[problem:LightOJ-1005] [problem:LightOJ-1058] [problem:LightOJ-1067] [problem:LightOJ-1095] [problem:LightOJ-1102] [problem:LightOJ-1140] [problem:LightOJ-1170] [problem:LightOJ-1173] [problem:LightOJ-1226] [problem:LightOJ-1246] [problem:LightOJ-1299] [problem:LightOJ-1318] [problem:LightOJ-1322] [problem:LightOJ-1326] [problem:LightOJ-1333] [problem:LightOJ-1352] [problem:LightOJ-1365] [problem:LightOJ-1366] [problem:LightOJ-1371] [problem:LightOJ-1382] [problem:LightOJ-1419] \n##### 数学训练三\n[problem:LightOJ-1306] [problem:LightOJ-1117] [problem:LightOJ-1124] [problem:LightOJ-1144] [problem:LightOJ-1161] [problem:LightOJ-1054] \n##### 数学训练四、五 数论 \n[problem:LightOJ-1007] [problem:LightOJ-1014] [problem:LightOJ-1028] [problem:LightOJ-1035] [problem:LightOJ-1045] [problem:LightOJ-1077] [problem:LightOJ-1090] [problem:LightOJ-1098] [problem:LightOJ-1109] [problem:LightOJ-1163] [problem:LightOJ-1215] [problem:LightOJ-1278] [problem:LightOJ-1289] [problem:LightOJ-1298] [problem:LightOJ-1340] [problem:LightOJ-1375] [problem:LightOJ-1399] \n##### 数学训练六 概率\u0026期望 \n[problem:LightOJ-1027] [problem:LightOJ-1030] [problem:LightOJ-1038] [problem:LightOJ-1079] [problem:LightOJ-1104] [problem:LightOJ-1151] [problem:LightOJ-1248] [problem:LightOJ-1265] [problem:LightOJ-1274] [problem:LightOJ-1284] [problem:LightOJ-1287] [problem:LightOJ-1317] [problem:LightOJ-1321] [problem:LightOJ-1342] [problem:LightOJ-1364] [problem:LightOJ-1395] [problem:LightOJ-1408] \n##### Gaussian Elimination \n[problem:POJ-1222] [problem:POJ-1830] [problem:POJ-2947] [problem:POJ-1681] [problem:POJ-2065] [problem:POJ-1753] [problem:POJ-3185] [problem:POJ-1487] [problem:HDU-3359] [problem:HDU-3949] [problem:HDU-2449] \n##### 训练指南——图论 \n[problem:UVA-10047] [problem:UVA-10054] [problem:UVA-1423] [problem:UVALive-3523] [problem:UVALive-5135] [problem:UVALive-4287] [problem:UVA-11324] [problem:UVALive-3211] [problem:UVA-1391] [problem:UVA-11396] [problem:UVALive-3486] [problem:UVA-10765] [problem:UVA-11294] [problem:UVALive-4452] [problem:UVALive-3514] [problem:UVA-10972] [problem:UVALive-5903] [problem:UVA-11604] [problem:UVALive-4839] [problem:UVALive-4958] [problem:UVA-1310] [problem:UVALive-2429] \n##### 线段树LCA树链剖分 \n[problem:POJ-3667] [problem:POJ-1151] [problem:POJ-2761] [problem:POJ-2886] [problem:HDU-4942] [problem:HDU-2586] [problem:POJ-1986] [problem:HDU-2874] [problem:HDU-3078] [problem:POJ-3417] [problem:POJ-3728] [problem:HDU-3830] [problem:HDU-4008] [problem:HDU-5274] [problem:HDU-4729] [problem:HDU-3710] [problem:POJ-2831] [problem:HDU-4718] [problem:HDU-5029] [problem:HDU-5052] \n##### 二分匹配 \n[problem:HDU-1068] [problem:HDU-1150] [problem:HDU-1179] [problem:HDU-1498] [problem:HDU-1507] [problem:HDU-1528] [problem:HDU-1845] [problem:HDU-2063] [problem:HDU-2119] [problem:HDU-3360] [problem:HDU-1350] [problem:HDU-3118] [problem:HDU-3729] \n##### 图论练习-图的割点、桥与双连通分支 \n[problem:POJ-3352] [problem:POJ-2186] [problem:POJ-2553] [problem:POJ-2942] \n##### 计算几何之凸包问题 \n[problem:POJ-1113] [problem:POJ-2007] [problem:POJ-1873] [problem:POJ-1228] [problem:POJ-3348] ","threadId":40011,"likeCnt":1146,"createTime":1543425751000,"isWorkbook":true,"viewCnt":178372,"openness":2,"fav":false,"id":752,"trustable":false}