Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"POJ-1321\":[\"棋盘问题\",36021,\"\\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\"],\"HYSBZ-2049\":[\"Cave 洞穴勘测\",423,\"Sdoi2008\"],\"POJ-3624\":[\"Charm Bracelet\",21361,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+December+Silver\\\"\\u003eUSACO 2007 December Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HYSBZ-2286\":[\"消耗战\",212,\"Sdoi2011\"],\"POJ-1204\":[\"Word Puzzles\",2743,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouthwestern+Europe+2002\\\"\\u003eSouthwestern Europe 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-11297\":[\"Census\",1557,null],\"POJ-2411\":[\"Mondriaan\\u0027s Dream\",9548,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+2000\\\"\\u003eUlm Local 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2774\":[\"Long Long Message\",7466,\"\\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\"],\"POJ-2533\":[\"Longest Ordered Subsequence\",24533,\"\\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\":[\"迷宫问题\",25544,\"\"],\"HDU-3045\":[\"Picnic Cows\",921,\"\\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-3628\":[\"Bookshelf 2\",4207,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+December+Bronze\\\"\\u003eUSACO 2007 December Bronze\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2196\":[\"Computer\",6799,\"\"],\"POJ-2778\":[\"DNA Sequence\",4530,\"\\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\"],\"CodeForces-617E\":[\"XOR and Favorite Number\",9026,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/617\\\"\\u003eCodeforces Round 340 (Div. 2)\\u003c/a\\u003e\"],\"HDU-2191\":[\"悼念512汶川大地震遇难同胞——珍惜现在,感恩生活\",14107,\"\\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-4010\":[\"Query on The Trees\",1045,\"\\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\",1503,\"\\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\"],\"HYSBZ-2160\":[\"拉拉队排练\",177,\"\"],\"HYSBZ-3489\":[\"maxsum\",60,\"\"],\"POJ-2421\":[\"Constructing Roads\",12048,\"\\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\"],\"HYSBZ-2038\":[\"小Z的袜子(hose)\",1680,\"2009国家集训队\"],\"POJ-1330\":[\"Nearest Common Ancestors\",13346,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTaejon+2002\\\"\\u003eTaejon 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1456\":[\"Supermarket\",8804,\"\\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\"],\"POJ-1699\":[\"Best Sequence\",3238,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2004.07.18\\\"\\u003ePOJ Monthly--2004.07.18\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HYSBZ-1067\":[\"降雨量\",227,\"SCOI2007\"],\"HYSBZ-3123\":[\"森林\",112,\"Sdoi2013\"],\"HDU-2087\":[\"剪花布条\",23940,\"\\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\",26888,\"\\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\",26534,\"\\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\"],\"HDU-4026\":[\"Unlock the Cell Phone\",276,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+36th+ACM%2FICPC+Asia+Regional+Shanghai+Site+%A1%AA%A1%AA+Online+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 36th ACM/ICPC Asia Regional Shanghai Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5358\":[\"First One\",751,\"\\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?\",7018,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+36th+ACM%2FICPC+Asia+Regional+Shanghai+Site+%A1%AA%A1%AA+Online+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 36th ACM/ICPC Asia Regional Shanghai Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3294\":[\"Girls\\u0027 research\",2414,\"\\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\"],\"HDU-5592\":[\"ZYB\\u0027s Premutation\",633,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2365\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #65 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2084\":[\"数塔\",35491,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2006%2F1%2F15+ACM%B3%CC%D0%F2%C9%E8%BC%C6%C6%DA%C4%A9%BF%BC%CA%D4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2006/1/15 ACM程序设计期末考试 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1661\":[\"Help Jimmy\",4907,\"\\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\"],\"POJ-1787\":[\"Charlie\\u0027s Change\",1488,\"\\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-2752\":[\"Seek the Name, Seek the Fame\",12883,\"\\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\"],\"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-4398\":[\"Template Library Management\",248,\"\\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+10\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 10 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5367\":[\"digger\",125,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2350+%28div.2%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #50 (div.2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3068\":[\"最长回文\",10273,\"\\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\":[\"病毒侵袭持续中\",5322,\"\\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\"],\"POJ-1789\":[\"Truck History\",11873,\"\\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\",19232,\"\\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?\",11126,\"\\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\",1558,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly+Contest+%E2%80%93+2009.04.05\\\"\\u003ePOJ Monthly Contest – 2009.04.05\\u003c/a\\u003e, GaoYihan\\u003c/div\\u003e\"],\"HDU-4270\":[\"Dynamic Lover\",232,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+ACM%2FICPC+Asia+Regional+Changchun+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Changchun Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3183\":[\"A Magic Lamp\",3043,\"\\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\"],\"SPOJ-OTOCI\":[\"OTOCI\",600,\"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\",6029,\"\\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?\",3443,\"\\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\",12618,\"\\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\"],\"UVA-12594\":[\"Naming Babies\",129,null],\"POJ-2763\":[\"Housewife Wind\",2928,\"\\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\"],\"POJ-3974\":[\"Palindrome\",6542,\"\\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\",21534,\"\\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\"],\"HDU-3078\":[\"Network\",960,\"\\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\"],\"POJ-2528\":[\"Mayor\\u0027s posters\",14601,\"\\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\",8722,\"\\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-5256\":[\"序列变换\",1127,\"\\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\"],\"HDU-4044\":[\"GeoDefense\",559,\"\\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+Beijing+Site+%A1%AA%A1%AA+Online+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 36th ACM/ICPC Asia Regional Beijing Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1679\":[\"The Unique MST\",10638,\"\\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\"],\"HDU-4281\":[\"Judges\\u0027 response\",365,\"\\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\",245,\"\\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\",514,\"\\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\",3611,\"\\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\"],\"HYSBZ-1036\":[\"树的统计Count\",1293,\"ZJOI2008\"],\"HYSBZ-4546\":[\"codechef XRQRS\",0,\"\"],\"POJ-3667\":[\"Hotel\",6309,\"\\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\"],\"HYSBZ-3572\":[\"九连环\",100,\"\"],\"POJ-3666\":[\"Making the Grade\",5065,\"\\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\"],\"HYSBZ-2002\":[\"No Linear Sequences\",1019,\"Usaco2005 Feb\"],\"HYSBZ-2243\":[\"染色\",711,\"SDOI2011\"],\"HDU-5029\":[\"Relief grain\",658,\"\\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\"],\"CodeForces-707D\":[\"Persistent Bookcase\",2873,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/707\\\"\\u003eCodeforces Round 368 (Div. 2)\\u003c/a\\u003e\"],\"HDU-3085\":[\"Nightmare Ⅱ\",1652,\"\\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-4054\":[\"Hexadecimal View\",1198,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Asia+Dalian+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Asia Dalian Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1251\":[\"Jungle Roads\",15792,\"\\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-3311\":[\"Hie with the Pie\",5367,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dEast+Central+North+America+2006\\\"\\u003eEast Central North America 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HYSBZ-1146\":[\"网络管理Network\",70,\"CTSC2008\"],\"HYSBZ-1269\":[\"文本编辑器editor\",234,\"AHOI2006\"],\"POJ-2100\":[\"Graveyard Design\",2770,\"\\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\",24156,\"\\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\"],\"HYSBZ-3685\":[\"普通van Emde Boas树\",20,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003dBy Zky\\\"\\u003eBy Zky\\u003c/a\\u003e\\u003c/p\\u003e\"],\"POJ-1015\":[\"Jury Compromise\",7046,\"\\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\",14079,\"\\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\"],\"HDU-5157\":[\"Harry and magic string\",356,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2325\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #25 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2349\":[\"Arctic Network\",8062,\"\\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\"],\"HYSBZ-3207\":[\"花神的嘲讽计划Ⅰ\",63,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003d原创 Memphis\\\"\\u003e原创 Memphis\\u003cbr\\u003e \\u003c/a\\u003e\\u003c/p\\u003e\"],\"HDU-3092\":[\"Least common multiple\",660,\"\\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+18+-+Host+by+ECNU+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 18 - Host by ECNU \\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\"],\"POJ-1141\":[\"Brackets Sequence\",7331,\"\\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\"],\"POJ-1260\":[\"Pearls\",5028,\"\\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\"],\"HYSBZ-3676\":[\"回文串\",271,\"Apio2014\"],\"HYSBZ-1499\":[\"REKLAME\",121,\"\"],\"HYSBZ-2588\":[\"Spoj 10628. Count on a tree\",209,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003d鸣谢seter\\\"\\u003e鸣谢seter\\u003c/a\\u003e\\u003c/p\\u003e\"],\"POJ-2677\":[\"Tour\",1591,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2005\\\"\\u003eSoutheastern Europe 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HYSBZ-1010\":[\"玩具装箱toy\",466,\"HNOI2008\"],\"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\"],\"UVA-1127\":[\"Word Puzzles\",105,null],\"HYSBZ-3674\":[\"可持久化并查集加强版\",172,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003d出题人大SB++\\\"\\u003e出题人大SB++\\u003c/a\\u003e\\u003c/p\\u003e\"],\"HYSBZ-3673\":[\"可持久化并查集 by zky\",150,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003d出题人大SB\\\"\\u003e出题人大SB\\u003cbr\\u003e \\u003c/a\\u003e\\u003c/p\\u003e\"],\"HYSBZ-4520\":[\"K远点对\",62,\"Cqoi2016\"],\"SPOJ-BALNUM\":[\"Balanced Numbers\",1447,\"Cuban Olympiad in Informatics 2012 - Day 2 Problem A\"],\"HDU-4190\":[\"Distributing Ballot Boxes\",1593,\"\\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\"],\"CodeForces-946D\":[\"Timetable\",4685,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/946\\\"\\u003eEducational Codeforces Round 39 (Rated for Div. 2)\\u003c/a\\u003e\"],\"POJ-1470\":[\"Closest Common Ancestors\",4455,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2000\\\"\\u003eSoutheastern Europe 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3415\":[\"Common Substrings\",3051,\"\\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-2688\":[\"Cleaning Robot\",1431,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2005+Domestic\\\"\\u003eJapan 2005 Domestic\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3414\":[\"Pots\",11295,\"\\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-2566\":[\"Bound Found\",2904,\"\\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\"],\"UVALive-2335\":[\"T9\",63,\"Regionals 2001 \\u003e\\u003e Europe - Northwestern\"],\"POJ-3417\":[\"Network\",2247,\"\\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\",2340,\"\\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\"],\"POJ-1239\":[\"Increasing Sequences\",1435,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dEast+Central+North+America+2002\\\"\\u003eEast Central North America 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVALive-3662\":[\"Another Minimum Spanning Tree\",185,\"Regionals 2006 \\u003e\\u003e Asia - Beijing\"],\"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\",11501,\"\\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-3345\":[\"Bribing FIPA\",1341,\"\\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-1287\":[\"Networking\",11470,\"\\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\"],\"HYSBZ-2565\":[\"最长双回文串\",369,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003d2012国家集训队Round 1 day2\\\"\\u003e2012国家集训队Round 1 day2\\u003c/a\\u003e\\u003c/p\\u003e\"],\"POJ-2253\":[\"Frogger\",17729,\"\\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-1823\":[\"Luck and Love\",1348,\"\\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-2018\":[\"Best Cow Fences\",4404,\"\\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-3107\":[\"Godfather\",3633,\"\\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-2378\":[\"Tree Cutting\",3275,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+December+Silver\\\"\\u003eUSACO 2004 December Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3468\":[\"A Simple Problem with Integers\",29974,\"\\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\",6863,\"\\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-1048\":[\"Follow My Logic\",588,\"\\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-2019\":[\"Cornfields\",3740,\"\\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\"],\"HDU-6278\":[\"Just $h$-index\",782,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dCCPC2018-%BA%FE%C4%CF%C8%AB%B9%FA%D1%FB%C7%EB%C8%FC-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%CF%E6%CC%B6%B4%F3%D1%A7%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e CCPC2018-湖南全国邀请赛-重现赛(感谢湘潭大学) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3109\":[\"Inner Vertices\",670,\"\\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\"],\"HDU-5067\":[\"Harry And Dig Machine\",716,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2314\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #14 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1170\":[\"Shopping Offers\",1881,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dIOI+1995\\\"\\u003eIOI 1995\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1937\":[\"Finding Seats\",605,\"\\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-1050\":[\"To the Max\",26028,\"\\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-3470\":[\"Walls\",283,\"\\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, Zhou Dong\\u003c/div\\u003e\"],\"POJ-1177\":[\"Picture\",5092,\"\\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\",23275,\"\\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\"],\"HDU-1712\":[\"ACboy needs your help\",5357,\"\\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\"],\"HDU-1711\":[\"Number Sequence\",16579,\"\\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\"],\"HYSBZ-1588\":[\"营业额统计\",1270,\"HNOI2002\"],\"UVA-12099\":[\"The Bookcase\",483,null],\"POJ-3237\":[\"Tree\",2099,\"\\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\"],\"CodeForces-915E\":[\"Physical Education Lessons\",4308,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"POJ-1180\":[\"Batch Scheduling\",1816,\"\\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\"],\"HDU-1828\":[\"Picture\",2304,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dIOI+1998\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e IOI 1998 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2031\":[\"Building a Space Station\",7342,\"\\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\",613,\"\\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-1185\":[\"炮兵阵地\",10139,\"\\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-1182\":[\"食物链\",25685,\"\\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-2392\":[\"Space Elevator\",5592,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+March+Gold\\\"\\u003eUSACO 2005 March Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1062\":[\"昂贵的聘礼\",15015,\"\\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\",5349,\"\\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\"],\"CodeForces-240F\":[\"TorCoder\",1940,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/240\\\"\\u003eCodeforces Round 145 (Div. 1, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"POJ-3685\":[\"Matrix\",2795,\"\\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\"],\"HDU-1964\":[\"Pipes\",409,\"\\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\"],\"HYSBZ-3991\":[\"寻宝游戏\",71,\"SDOI2015\"],\"FZU-2150\":[\"Fire Game\",3184,\"\"],\"POJ-2236\":[\"Wireless Network\",16775,\"\\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\"],\"HYSBZ-1452\":[\"Count\",141,\"JSOI2009\"],\"HDU-6059\":[\"Kanade\\u0027s trio\",425,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2017+Multi-University+Training+Contest+-+Team+3\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2017 Multi-University Training Contest - Team 3 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3208\":[\"Apocalypse Someday\",1349,\"\\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, adapted from TCHS SRM 2 ApocalypseSomeday\\u003c/div\\u003e\"],\"CodeForces-817F\":[\"MEX Queries\",2585,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"ZOJ-3256\":[\"Tour in the Castle\",424,null],\"ZOJ-3494\":[\"BCD Code\",1334,null],\"POJ-2240\":[\"Arbitrage\",9918,\"\\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\",7176,\"\\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-2482\":[\"Stars in Your Window\",2525,\"\\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:kinfkong@ZSU\\u003c/div\\u003e\"],\"POJ-3693\":[\"Maximum repetition substring\",2235,\"\\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\",2012,\"\\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\"],\"POJ-3691\":[\"DNA repair\",2266,\"\\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\"],\"SPOJ-REPEATS\":[\"Repeats\",1457,\"BOI 2004\"],\"POJ-1276\":[\"Cash Machine\",12383,\"\\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\"],\"POJ-1155\":[\"TELE\",2497,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCroatia+OI+2002+Final+Exam+-+Second+Day\\\"\\u003eCroatia OI 2002 Final Exam - Second Day\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2486\":[\"Apple Tree\",3563,\"\\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:magicpig@ZSU\\u003c/div\\u003e\"],\"HYSBZ-2653\":[\"middle\",200,\"\"],\"CodeForces-371C\":[\"Hamburgers\",27551,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/371\\\"\\u003eCodeforces Round 218 (Div. 2)\\u003c/a\\u003e\"],\"POJ-3211\":[\"Washing Clothes\",2684,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.04.01\\\"\\u003ePOJ Monthly--2007.04.01\\u003c/a\\u003e, dearboy\\u003c/div\\u003e\"],\"POJ-1038\":[\"Bugs Integrated, Inc.\",2575,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCEOI+2002\\\"\\u003eCEOI 2002\\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-3579\":[\"Median\",5505,\"\\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\"],\"URAL-1553\":[\"Caves and Tunnels\",1731,\"Novosibirsk SU Contest. Petrozavodsk training camp, September 2007\"],\"HYSBZ-1208\":[\"宠物收养所\",733,\"HNOI2004\"],\"CodeForces-817E\":[\"Choosing The Commander\",2948,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"HDU-6183\":[\"Color it\",588,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2017ACM%2FICPC%B9%E3%CE%F7%D1%FB%C7%EB%C8%FC-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%B9%E3%CE%F7%B4%F3%D1%A7%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2017ACM/ICPC广西邀请赛-重现赛(感谢广西大学) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-644\":[\"Immediate Decodability\",5313,null],\"ZOJ-3261\":[\"Connections in Galaxy War\",3208,null],\"POJ-2251\":[\"Dungeon Master\",22065,\"\\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\",8299,\"\\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\",1349,\"\\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\",2377,\"\\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\",12035,\"\\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\"],\"HDU-1864\":[\"最大报销额\",8698,\"\\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-2007%C4%EA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙大计算机研究生复试上机考试-2007年 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3268\":[\"Silver Cow Party\",14885,\"\\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\"],\"HDU-2955\":[\"Robberies\",10654,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dIDI+Open+2009\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e IDI Open 2009 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3026\":[\"Borg Maze\",4950,\"\\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-2952\":[\"Counting Sheep\",2539,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dIDI+Open+2009\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e IDI Open 2009 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1503\":[\"Advanced Fruits\",3278,\"\\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+1999\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Ulm Local Contest 1999 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1506\":[\"Largest Rectangle in a Histogram\",7902,\"\\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\"],\"CodeForces-366C\":[\"Dima and Salad\",5838,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/366\\\"\\u003eCodeforces Round 214 (Div. 2)\\u003c/a\\u003e\"],\"URAL-1960\":[\"Palindromes and Super Abilities\",1024,\"Ural FU contest. Kontur Cup. Petrozavodsk training camp. Winter 2013\"],\"LightOJ-1089\":[\"Points in Segments (II)\",2046,null],\"HYSBZ-2648\":[\"奇怪的游戏\",160,\"SCOI2012\"],\"UVALive-6771\":[\"Buffed Buffet\",29,\"World Finals \\u003e\\u003e 2014 - Ekaterinburg\"],\"HDU-2829\":[\"Lawrence\",1993,\"\\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\"],\"HDU-6191\":[\"Query on A Tree\",814,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2017ACM%2FICPC%B9%E3%CE%F7%D1%FB%C7%EB%C8%FC-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%B9%E3%CE%F7%B4%F3%D1%A7%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2017ACM/ICPC广西邀请赛-重现赛(感谢广西大学) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2063\":[\"Investment\",3619,\"\\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\",29408,\"\\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\",40166,\"\\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\":[\"畅通工程再续\",12120,\"\\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\",8858,\"\\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-3810\":[\"Magina\",242,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+6th+Central+China+Invitational+Programming+Contest+and+9th+Wuhan+University+Programming+Contest+Preliminary\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 6th Central China Invitational Programming Contest and 9th Wuhan University Programming Contest Preliminary \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3277\":[\"City Horizon\",3439,\"\\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-2602\":[\"Bone Collector\",33161,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+1st+%A1%B0Vegetable-Birds+Cup%A1%B1+Programming+Open+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 1st “Vegetable-Birds Cup” Programming Open Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2844\":[\"Coins\",7236,\"\\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\"],\"HDU-3811\":[\"Permutation\",245,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+6th+Central+China+Invitational+Programming+Contest+and+9th+Wuhan+University+Programming+Contest+Preliminary\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 6th Central China Invitational Programming Contest and 9th Wuhan University Programming Contest Preliminary \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2846\":[\"Repository\",1766,\"\\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+4+-+Host+by+HDU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 4 - Host by HDU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-220B\":[\"Little Elephant and Array\",10426,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/220\\\"\\u003eCodeforces Round 136 (Div. 1)\\u003c/a\\u003e\"],\"POJ-3159\":[\"Candies\",7649,\"\\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\"],\"HYSBZ-2759\":[\"repeats\",70,\"Baltic2004\"],\"UVA-624\":[\"CD\",15023,null],\"HDU-2612\":[\"Find a way\",9999,\"\\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-3245\":[\"Sequence Partitioning\",234,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.07.08\\\"\\u003ePOJ Monthly--2007.07.08\\u003c/a\\u003e, Chen, Danqi\\u003c/div\\u003e\"],\"HYSBZ-2741\":[\"【FOTILE模拟赛】L\",91,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003dBy seter\\\"\\u003eBy seter\\u003c/a\\u003e\\u003c/p\\u003e\"],\"POJ-3122\":[\"Pie\",8035,\"\\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-2155\":[\"Matrix\",8926,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly\\\"\\u003ePOJ Monthly\\u003c/a\\u003e,Lou Tiancheng\\u003c/div\\u003e\"],\"POJ-3123\":[\"Ticket to Ride\",281,\"\\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\"],\"CodeForces-86D\":[\"Powerful array\",14567,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/86\\\"\\u003eYandex.Algorithm 2011: Round 2\\u003c/a\\u003e\"],\"POJ-3126\":[\"Prime Path\",19552,\"\\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\",6803,\"\\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\",2382,\"\\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\"],\"LightOJ-1188\":[\"Fast Queries\",1761,null],\"HYSBZ-2626\":[\"JZPFAR(顾昱洲)\",2,\"\"],\"HDU-6096\":[\"String\",509,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2017+Multi-University+Training+Contest+-+Team+6\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2017 Multi-University Training Contest - Team 6 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"SPOJ-LCS2\":[\"Longest Common Substring II\",2826,\"\"],\"HDU-2609\":[\"How many\",2357,\"\\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-1195\":[\"Mobile phones\",8492,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dIOI+2001\\\"\\u003eIOI 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3252\":[\"Round Numbers\",6808,\"\\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-3133\":[\"Manhattan Wiring\",709,\"\\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\"],\"POJ-3258\":[\"River Hopscotch\",9542,\"\\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\"],\"POJ-3259\":[\"Wormholes\",19364,\"\\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\",2938,null],\"HDU-1890\":[\"Robotic Sort\",1565,\"\\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\"],\"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-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\",2068,null],\"SPOJ-QTREE\":[\"Query on a tree\",7727,\"\"],\"POJ-3260\":[\"The Fewest Coins\",2002,\"\\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\"],\"POJ-1080\":[\"Human Gene Functions\",10224,\"\\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\"],\"HDU-3709\":[\"Balanced Number\",3634,\"\\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\",23677,\"\\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\"],\"CodeForces-484E\":[\"Sign on Fence\",2386,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/484\\\"\\u003eCodeforces Round 276 (Div. 1)\\u003c/a\\u003e\"],\"POJ-3261\":[\"Milk Patterns\",5452,\"\\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\"],\"POJ-3140\":[\"Contestants Division\",2583,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dShanghai+2006\\\"\\u003eShanghai 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"URAL-1519\":[\"Formula 1\",1546,\"Timus Top Coders: Third Challenge\"],\"HDU-3966\":[\"Aragorn\\u0027s Story\",3384,\"\\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-3726\":[\"Graph and Queries\",573,\"\\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-3727\":[\"Jewel\",397,\"\\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-2639\":[\"Bone Collector II\",3082,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B0%D9%CD%F2%C7%D8%B9%D8%D6%D5%CA%F4%B3%FE\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 百万秦关终属楚 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1284\":[\"Lights inside 3D Grid\",465,null],\"LightOJ-1287\":[\"Where to Run?\",452,null],\"HDU-1540\":[\"Tunnel Warfare\",5832,\"\\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\"],\"HYSBZ-3932\":[\"任务查询系统\",200,\"CQOI2015\"],\"HDU-2874\":[\"Connections between cities\",2835,\"\\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\"],\"HDU-1301\":[\"Jungle Roads\",7940,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Central+USA+2002\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central USA 2002 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-3627\":[\"Treasure Hunt II\",442,null],\"HDU-1542\":[\"Atlantis\",6193,\"\\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\",1730,\"\\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\",3225,null],\"HDU-3613\":[\"Best Reward\",2113,\"\\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\"],\"HYSBZ-1500\":[\"Islands and Bridges\",406,\"\"],\"HDU-2888\":[\"Check Corners\",1071,\"\\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\"],\"FZU-2082\":[\"过路费\",480,\"FOJ有奖月赛-2012年4月(校赛热身赛)\"],\"HYSBZ-2716\":[\"天使玩偶\",0,\"Violet 3\"],\"UVA-10635\":[\"Prince and Princess\",4676,null],\"UVALive-3046\":[\"Shortest Prefixes\",141,\"Regionals 2004 \\u003e\\u003e North America - Rocky Mountain\"],\"HDU-3974\":[\"Assign the task\",3133,\"\\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\"],\"HDU-3732\":[\"Ahui Writes Word\",947,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACMDIY%B5%DA%B6%FE%BD%EC%C8%BA%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACMDIY第二届群赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"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\"],\"ZOJ-3638\":[\"Fruit Ninja\",304,null],\"ZOJ-3769\":[\"Diablo III\",519,null],\"ZOJ-3524\":[\"Crazy Shopping\",385,null],\"ZOJ-3522\":[\"Hide and seek\",44,null],\"POJ-3080\":[\"Blue Jeans\",8233,\"\\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\"],\"ZOJ-1586\":[\"QS Network\",6276,null],\"POJ-4052\":[\"Hrinity\",308,\"\"],\"HDU-4819\":[\"Mosaic\",891,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+Asia+Regional+Changchun+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Asia Regional Changchun \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3087\":[\"Shuffle\\u0027m Up\",8775,\"\\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\"],\"UVA-147\":[\"Dollars\",12223,null],\"HDU-3746\":[\"Cyclic Nacklace\",8206,\"\\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\"],\"HDU-4714\":[\"Tree2cycle\",865,\"\\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+Warmup\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Online —— Warmup \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3169\":[\"Layout\",7271,\"\\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-1203\":[\"I NEED A OFFER!\",12010,\"\\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-5801\":[\"Up Sky,Mr.Zhu\",87,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016+Multi-University+Training+Contest+6\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016 Multi-University Training Contest 6 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4718\":[\"The LCIS on the Tree\",357,\"\\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\",2041,\"Immagination\"],\"HDU-3507\":[\"Print Article\",4492,\"\\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\"],\"HDU-1561\":[\"The more, The Better\",4507,\"\\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-1560\":[\"DNA sequence\",2042,\"\\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\"],\"LightOJ-1265\":[\"Island of Survival\",1409,null],\"HDU-2896\":[\"病毒侵袭\",6476,\"\\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-1565\":[\"方格取数(1)\",3257,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHappy+2007\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Happy 2007 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1686\":[\"Oulipo\",11226,\"\\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\"],\"ZOJ-3537\":[\"Cake\",1577,null],\"SPOJ-DISUBSTR\":[\"Distinct Substrings\",7699,\"ByteCode \\u002706\"],\"FZU-1901\":[\"Period II\",817,\"FOJ有奖月赛-2010年05月\"],\"HDU-5919\":[\"Sequence II\",997,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC%A3%A8%B3%A4%B4%BA%A3%A9-%D6%D8%CF%D6%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016中国大学生程序设计竞赛(长春)-重现赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3294\":[\"Life Forms\",3081,\"\\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\"],\"UVA-111\":[\"History Grading\",12019,null],\"HDU-2546\":[\"饭卡\",15416,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUESTC+6th+Programming+Contest+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e UESTC 6th Programming Contest Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4725\":[\"The Shortest Path in Nya Graph\",2867,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+ACM%2FICPC+Asia+Regional+Online+%A1%AA%A1%AA+Warmup2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Online —— Warmup2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3516\":[\"Tree Construction\",1039,\"\\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\",18473,\"\\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-4605\":[\"Magic Ball Game\",575,\"\\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-4847\":[\"Wow! Such Doge!\",2851,\"\\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\"],\"SPOJ-SUBLEX\":[\"Lexicographical Substring Search\",2953,\"Own Problem\"],\"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\"],\"LightOJ-1030\":[\"Discovering Gold\",3543,null],\"CodeForces-149D\":[\"Coloring Brackets\",4940,\"\\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\",711,null],\"HDU-1693\":[\"Eat the Trees\",1864,\"\\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\",478,null],\"LightOJ-1395\":[\"A Dangerous Maze (II)\",282,null],\"CodeForces-258B\":[\"Little Elephant and Elections\",1656,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/258\\\"\\u003eCodeforces Round 157 (Div. 1)\\u003c/a\\u003e\"],\"SPOJ-PHRASES\":[\"Relevant Phrases of Annihilation\",1145,\"DASM Programming League 2004 (problemset 1)\"],\"HDU-1213\":[\"How Many Tables\",26645,\"\\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\",4002,\"\\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-1027\":[\"A Dangerous Maze\",3984,null],\"SPOJ-SUBST1\":[\"New Distinct Substrings\",5158,\"Base on a problem in ByteCode06\"],\"HYSBZ-2809\":[\"dispatching\",319,\"Apio2012\"],\"POJ-3061\":[\"Subsequence\",14588,\"\\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\"],\"ZOJ-3541\":[\"The Last Puzzle\",881,null],\"ZOJ-3662\":[\"Math Magic\",1180,null],\"POJ-3181\":[\"Dollar Dayz\",3777,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+January+Silver\\\"\\u003eUSACO 2006 January Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3186\":[\"Treats for the Cows\",4864,\"\\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\"],\"HDU-4616\":[\"Game\",595,\"\\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-4734\":[\"F(x)\",4113,\"\\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-4614\":[\"Vases and Flowers\",2566,\"\\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-5828\":[\"Rikka with Sequence\",473,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016+Multi-University+Training+Contest+8\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016 Multi-University Training Contest 8 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10328\":[\"Coin Toss\",850,null],\"HDU-3401\":[\"Trade\",1353,\"\\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\"],\"LightOJ-1364\":[\"Expected Cards\",417,null],\"HDU-3642\":[\"Get The Treasury\",917,\"\\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\"],\"CodeForces-786C\":[\"Till I Collapse\",2736,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/786\\\"\\u003eCodeforces Round 406 (Div. 1)\\u003c/a\\u003e\"],\"ZOJ-3430\":[\"Detect the Virus\",2193,null],\"HDU-3416\":[\"Marriage Match IV\",1526,\"\\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-1358\":[\"Period\",7347,\"\"],\"HDU-4747\":[\"Mex\",1092,\"\\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-3535\":[\"AreYouBusy\",1613,\"\\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-2328\":[\"Corporate Identity\",1527,\"\\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-4745\":[\"Two Rabbits\",1669,\"\\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-4866\":[\"Shooting\",404,\"\\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\"],\"HDU-3415\":[\"Max Sum of Max-K-sub-sequence\",2796,\"\\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-1238\":[\"Substrings\",5692,\"\"],\"HDU-4507\":[\"吉哥系列故事——恨7不成妻\",2421,\"\\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\"],\"HDU-2441\":[\"ACM(Array Complicated Manipulation)\",137,\"\\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\"],\"CodeForces-337D\":[\"Book of Evil\",6417,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/337\\\"\\u003eCodeforces Round 196 (Div. 2)\\u003c/a\\u003e\"],\"HDU-3533\":[\"Escape\",912,\"\\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\"],\"POJ-1816\":[\"Wild Words\",1156,\"\\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\\u003c/div\\u003e\"],\"HDU-1233\":[\"还是畅通工程\",22243,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%B4%F3%BC%C6%CB%E3%BB%FA%D1%D0%BE%BF%C9%FA%B8%B4%CA%D4%C9%CF%BB%FA%BF%BC%CA%D4-2006%C4%EA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙大计算机研究生复试上机考试-2006年 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3652\":[\"B-number\",5512,\"\\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\",1309,\"\\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\",18601,\"\\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\"],\"HDU-4742\":[\"Pinball Game 3D\",396,\"\\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-1248\":[\"Dice (III)\",2071,null],\"ZOJ-2477\":[\"Magic Cube\",518,null],\"ZOJ-2112\":[\"Dynamic Rankings\",5748,null],\"HDU-1248\":[\"寒冰王座\",11958,\"\"],\"HDU-4758\":[\"Walk Through Squares\",508,\"\\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-2457\":[\"DNA repair\",1632,\"\\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\"],\"HDU-4756\":[\"Install Air Conditioning\",387,\"\\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-4757\":[\"Tree\",943,\"\\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\"],\"UVA-11990\":[\"``Dynamic\\u0027\\u0027 Inversion\",887,null],\"HDU-1000\":[\"A + B Problem\",204432,\"\"],\"HDU-1241\":[\"Oil Deposits\",26336,\"\\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\"],\"HDU-3660\":[\"Alice and Bob\\u0027s Trip\",483,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Regional+Harbin\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Regional Harbin \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1342\":[\"Aladdin and the Magical Sticks\",362,null],\"HDU-4513\":[\"吉哥系列故事——完美队形II\",3129,\"\\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\"],\"HDU-5722\":[\"Jewelry\",107,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+2nd+Anniversary\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder 2nd Anniversary \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10664\":[\"Luggage\",6367,null],\"HDU-1003\":[\"Max Sum\",61423,\"\"],\"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\"],\"UVALive-5066\":[\"Fire Drill\",315,\"Regionals 2010 \\u003e\\u003e Asia - Jakarta\"],\"ZOJ-3213\":[\"Beautiful Meadow\",834,null],\"UVA-674\":[\"Coin Change\",18673,null],\"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-4768\":[\"Flyer\",1128,\"\\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-4529\":[\"郑厂长系列故事——N骑士问题\",326,\"\\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-5618\":[\"Jam\\u0027s problem again\",488,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2370\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #70 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1251\":[\"统计难题\",18044,\"\"],\"HDU-1011\":[\"Starship Troopers\",4988,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZJCPC2004\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ZJCPC2004 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1495\":[\"非常可乐\",11322,\"\\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\"],\"HYSBZ-1926\":[\"粟粟的书架\",41,\"Sdoi2010\"],\"HDU-3555\":[\"Bomb\",8221,\"\\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\":[\"覆盖的面积\",3467,\"\"],\"HDU-2102\":[\"A计划\",7237,\"\\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 ?\",9069,\"\\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\"],\"HDU-2222\":[\"Keywords Search\",14073,\"\"],\"UVA-11624\":[\"Fire!\",8864,null],\"HDU-1257\":[\"最少拦截系统\",26046,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙江工业大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4763\":[\"Theme Section\",2809,\"\\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\"],\"LightOJ-1104\":[\"Birthday Paradox\",2490,null],\"ZOJ-3469\":[\"Food Delivery\",2195,null],\"LightOJ-1348\":[\"Aladdin and the Return Journey\",1561,null],\"ZOJ-3228\":[\"Searching the String\",2544,null],\"ZOJ-3466\":[\"The Hive II\",292,null],\"UVA-562\":[\"Dividing coins\",13838,null],\"HDU-4417\":[\"Super Mario\",3671,\"\\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-4418\":[\"Time travel\",610,\"\\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-4539\":[\"郑厂长系列故事——排兵布阵\",956,\"\\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%B8%B4%C8%FC%B5%DA%B6%FE%B3%A1%A3%A83%D4%C230%C8%D5%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013腾讯编程马拉松复赛第二场(3月30日) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1029\":[\"Ignatius and the Princess IV\",21642,\"\"],\"HDU-4416\":[\"Good Article Good sentence\",866,\"\\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\",3706,\"Just for fun...\"],\"HDU-4419\":[\"Colourful Rectangle\",501,\"\\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-5862\":[\"Counting Intersections\",419,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016+Multi-University+Training+Contest+10\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016 Multi-University Training Contest 10 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2594\":[\"Simpsons’ Hidden Talents\",6608,\"\\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\",3762,\"\\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\",13557,\"\"],\"HDU-3567\":[\"Eight II\",1181,\"\\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\",617,\"\\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\",574,null],\"POJ-1847\":[\"Tram\",6432,\"\\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\"],\"HDU-3565\":[\"Bi-peak Number\",282,\"\\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\"],\"HYSBZ-1911\":[\"Race Results\",244,\"Usaco2010 Nov\"],\"ZOJ-1610\":[\"Count the Colors\",13034,null],\"LightOJ-1317\":[\"Throwing Balls into the Baskets\",1128,null],\"HDU-1260\":[\"Tickets\",6369,\"\\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\"],\"UVALive-7141\":[\"BombX\",100,\"Regionals 2014 \\u003e\\u003e Asia - Shanghai\"],\"HDU-1159\":[\"Common Subsequence\",22980,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSoutheastern+Europe+2003\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Southeastern Europe 2003 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5517\":[\"Triple\",466,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015ACM%2FICPC%D1%C7%D6%DE%C7%F8%C9%F2%D1%F4%D5%BE-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%B6%AB%B1%B1%B4%F3%D1%A7%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1611\":[\"The Suspects\",24301,\"\\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\"],\"HYSBZ-1901\":[\"Zju2112 Dynamic Rankings\",17,\"\"],\"HDU-1272\":[\"小希的迷宫\",17307,\"\\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-4300\":[\"Clairewd’s message\",3093,\"\\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-2243\":[\"考研路茫茫——单词情结\",2010,\"\"],\"POJ-1733\":[\"Parity game\",4849,\"\\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\"],\"CodeForces-17E\":[\"Palisection\",1727,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/17\\\"\\u003eCodeforces Beta Round 17\\u003c/a\\u003e\"],\"POJ-1976\":[\"A Mini Locomotive\",2104,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+Sharif+2004+Preliminary\\\"\\u003eTehran Sharif 2004 Preliminary\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-3693\":[\"Math teacher\\u0027s homework\",205,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Fuzhou+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Fuzhou Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-12538\":[\"Version Controlled IDE\",607,null],\"POJ-2828\":[\"Buy Tickets\",8815,\"\\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\"],\"POJ-1739\":[\"Tony\\u0027s Tour\",1066,\"\\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-3336\":[\"Count the string\",7367,\"\\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-3333\":[\"Turing Tree\",2286,\"\\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\"],\"SPOJ-DQUERY\":[\"D-query\",15736,\"Minesweeper\"],\"CodeForces-547E\":[\"Mike and Friends\",2157,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/547\\\"\\u003eCodeforces Round 305 (Div. 1)\\u003c/a\\u003e\"],\"HDU-2018\":[\"母牛的故事\",69289,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dC%D3%EF%D1%D4%B3%CC%D0%F2%C9%E8%BC%C6%C1%B7%CF%B0%A3%A8%C8%FD%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e C语言程序设计练习(三) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2912\":[\"Rochambeau\",2112,\"\\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\"],\"CodeForces-401D\":[\"Roman and Numbers\",4470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/401\\\"\\u003eCodeforces Round 235 (Div. 2)\\u003c/a\\u003e\"],\"HDU-4553\":[\"约会安排\",1162,\"\\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\",5255,\"\\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\"],\"POJ-1948\":[\"Triangular Pastures\",2042,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2002+February\\\"\\u003eUSACO 2002 February\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-5646\":[\"DZY Loves Partition\",681,\"\\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-1166\":[\"敌兵布阵\",38939,\"\"],\"HDU-3586\":[\"Information Disturbing\",1399,\"\\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%A815%A3%A9%A1%AA%A1%AAHost+by+NUDT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(15)——Host by NUDT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1947\":[\"Rebuilding Roads\",4683,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2002+February\\\"\\u003eUSACO 2002 February\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-3466\":[\"Proud Merchants\",3962,\"\\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\"],\"LightOJ-1422\":[\"Halloween Costumes\",3116,null],\"HDU-1160\":[\"FatMouse\\u0027s Speed\",9502,\"\\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-5658\":[\"CA Loves Palindromic\",327,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2378+%28div.2%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #78 (div.2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1176\":[\"免费馅饼\",21467,\"\"],\"HDU-3473\":[\"Minimum Sum\",726,\"\\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-4325\":[\"Flowers\",1187,\"\\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+3\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 3 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4568\":[\"Hunter\",601,\"\\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-1059\":[\"Dividing\",6920,\"\\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+1999\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central European Regional Contest 1999 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5534\":[\"Partial Tree\",1323,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015ACM%2FICPC%D1%C7%D6%DE%C7%F8%B3%A4%B4%BA%D5%BE-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%B6%AB%B1%B1%CA%A6%B4%F3%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015ACM/ICPC亚洲区长春站-重现赛(感谢东北师大) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1837\":[\"Balance\",9003,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dRomania+OI+2002\\\"\\u003eRomania OI 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"FZU-1977\":[\"Pandora adventure\",103,\"The 35th ACM/ICPC Asia Regional Fuzhou Site —— Online Contest\"],\"HDU-1171\":[\"Big Event in HDU\",11724,\"\"],\"UVALive-5097\":[\"Cross the Wall\",189,\"Regionals 2010 \\u003e\\u003e Asia - Harbin\"],\"UVA-12345\":[\"Dynamic len(set(a[L:R]))\",1095,null],\"HDU-5306\":[\"Gorgeous Sequence\",2088,\"\\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\"],\"UVA-10282\":[\"Babelfish\",11091,null],\"HDU-3001\":[\"Travelling\",2964,\"\\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\",1846,\"\\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\"],\"HDU-5421\":[\"Victor and String\",529,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2352+%28div.1%29+%28%24%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #52 (div.1) ($) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3709\":[\"K-Anonymous Sequence\",1540,\"\\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\"],\"SPOJ-LCS\":[\"Longest Common Substring\",4448,\"\"],\"HDU-4578\":[\"Transformation\",2573,\"\\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\",1022,\"\\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\",1663,\"\\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-2159\":[\"FATE\",9012,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008%D0%C5%CF%A2%B9%A4%B3%CC%D1%A7%D4%BA%BC%AF%D1%B5%B6%D3%A1%AA%A1%AA%D1%A1%B0%CE%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008信息工程学院集训队——选拔赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2739\":[\"Sum of Consecutive Prime Numbers\",15324,\"\\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\",12269,\"\\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\"],\"UVA-1627\":[\"Team them up!\",694,null],\"HDU-3480\":[\"Division\",1647,\"\\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\",1430,\"my own problems\"],\"CodeForces-940F\":[\"Machine Learning\",2663,\"\\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\",1934,\"Description, standard program and test data by Yang Zhe\"],\"POJ-1651\":[\"Multiplication Puzzle\",9053,\"\\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\"],\"UVA-11362\":[\"Phone List\",5936,null],\"POJ-2502\":[\"Subway\",4012,\"\\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\"],\"HDU-3496\":[\"Watch The Movie\",1830,\"\\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-1417\":[\"True Liars\",2107,\"\\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\",6529,\"\"],\"POJ-1656\":[\"Counting Black\",6750,\"\\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+Liu+Rujia%40POJ\\\"\\u003ePOJ Monthly--2004.05.15 Liu Rujia@POJ\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-3374\":[\"String Problem\",2070,\"\\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-2044\":[\"一只小蜜蜂...\",41357,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B5%DD%CD%C6%C7%F3%BD%E2%D7%A8%CC%E2%C1%B7%CF%B0%A3%A8For+Beginner%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 递推求解专题练习(For Beginner) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5672\":[\"String\",1291,\"\\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-2289\":[\"Cup\",3192,\"\\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-5316\":[\"Magician\",709,\"\\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-1078\":[\"FatMouse and Cheese\",7260,\"\\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\",1895,\"\\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\"],\"HDU-2167\":[\"Pebbles\",904,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2007+ACM-ICPC+Pacific+Northwest+Region\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007 ACM-ICPC Pacific Northwest Region \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5678\":[\"ztr loves trees\",116,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2382+%28div.2%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #82 (div.2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3377\":[\"Plan\",354,\"\\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-2041\":[\"超级楼梯\",48766,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2005%CA%B5%D1%E9%B0%E0%B6%CC%D1%A7%C6%DA%BF%BC%CA%D4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2005实验班短学期考试 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1408\":[\"Batting Practice\",420,null],\"POJ-1860\":[\"Currency Exchange\",13135,\"\\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\",5664,null],\"UVA-12563\":[\"Jin Ge Jin Qu hao\",4055,null],\"POJ-1984\":[\"Navigation Nightmare\",2666,\"\\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?\",555,\"\\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\",6271,\"\\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\"],\"POJ-1986\":[\"Distance Queries\",4399,\"\\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\",8698,\"\\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\",2014,\"\\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-1087\":[\"Super Jumping! Jumping! Jumping!\",24531,\"\"],\"POJ-1745\":[\"Divisibility\",3587,\"\\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-2955\":[\"Brackets\",8654,\"\\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\"],\"URAL-2040\":[\"Palindromes and Super Abilities\\u0026nbsp;2\",385,\"Ural FU Dandelion contest. Petrozavodsk training camp. Summer 2014\"],\"HDU-5687\":[\"Problem C\",889,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016%26quot%3B%B0%D9%B6%C8%D6%AE%D0%C7%26quot%3B+-+%D7%CA%B8%F1%C8%FC%A3%A8Astar+Round1%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016\\\"百度之星\\\" - 资格赛(Astar Round1) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-3612\":[\"Median\",1054,null],\"HDU-2050\":[\"折线分割平面\",30578,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B5%DD%CD%C6%C7%F3%BD%E2%D7%A8%CC%E2%C1%B7%CF%B0%A3%A8For+Beginner%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 递推求解专题练习(For Beginner) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-538F\":[\"A Heap of Heaps\",1650,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/538\\\"\\u003eCodeforces Round 300\\u003c/a\\u003e\"],\"CodeForces-853C\":[\"Boredom\",1466,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/853\\\"\\u003eCodeforces Round 433 (Div. 1, based on Olympiad of Metropolises)\\u003c/a\\u003e\"],\"HYSBZ-1095\":[\"Hide 捉迷藏\",105,\"ZJOI2007\"],\"HYSBZ-3153\":[\"Sone1\",18,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003dSone提供\\\"\\u003eSone提供\\u003c/a\\u003e\\u003c/p\\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\"],\"POJ-1511\":[\"Invitation Cards\",7949,\"\\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\"],\"UVA-10130\":[\"SuperSale\",13811,null],\"POJ-1751\":[\"Highways\",6371,\"\\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-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-4003\":[\"Find Metal Mineral\",1690,\"\\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-3033\":[\"I love sneakers!\",2245,\"\\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-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\",7210,\"\\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-4126\":[\"Genghis Khan the Conqueror\",717,\"\\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-4489\":[\"The King’s Ups and Downs\",1012,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dGreater+New+York+2012\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Greater New York 2012 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-429B\":[\"Working out\",9834,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/429\\\"\\u003eCodeforces Round 245 (Div. 1)\\u003c/a\\u003e\"],\"ZOJ-3747\":[\"Attack on Titans\",1249,null],\"ZOJ-3623\":[\"Battle Ships\",1433,null],\"HDU-2181\":[\"哈密顿绕行世界问题\",5725,\"\\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\"],\"SPOJ-COT\":[\"Count on a tree\",3565,\"Just for fun...\"],\"HYSBZ-3261\":[\"最大异或和\",131,\"\"],\"CodeForces-840D\":[\"Destiny\",3043,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/840\\\"\\u003eCodeforces Round 429 (Div. 1)\\u003c/a\\u003e\"],\"SPOJ-COT4\":[\"Count on a trie\",69,\"\"],\"HYSBZ-3262\":[\"陌上花开\",300,\"\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ACMWGR","updateTime":1563886146000,"title":"专题训练","dislikeCnt":0,"content":"简单搜索\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\n搜索进阶\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]\n\n最短路练习\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\n并查集\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\n最小生成树\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-1301][problem:HDU-1875]\n\n\nLCA\n[problem:HDU-2586][problem:HDU-2874][problem:HDU-3078][problem:HDU-3830][problem:POJ-1330][problem:POJ-1470][problem:POJ-1986][problem:POJ-3417][problem:POJ-3728][problem:POJ-2763]\n\n\nKMP扩展KMPManacher\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\n字典树\n[problem:UVA-644][problem:UVA-1127][problem:UVA-10282][problem:UVA-11362][problem:UVALive-2335][problem:UVALive-3046][problem:POJ-1816][problem:HDU-1251][problem:HDU-2846][problem:HDU-4757][problem:HDU-5687][problem:HDU-6059][problem:HDU-6096][problem:HDU-6191][problem:CodeForces-817E]\n\nAC自动机\n[problem:HDU-2222][problem:HDU-2896][problem:HDU-3065][problem:POJ-1204][problem:POJ-3208][problem:POJ-3691][problem:POJ-1699][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][problem:POJ-4052]\n\n后缀数组\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\n后缀自动机\n[problem:SPOJ-LCS][problem:SPOJ-LCS2][problem:SPOJ-NSUBSTR][problem:SPOJ-SUBLEX][problem:HDU-4270][problem:HDU-4416]\n\n回文树回文自动机\n[problem:URAL-1960][problem:URAL-2040][problem:HYSBZ-2565][problem:HYSBZ-3676][problem:HYSBZ-2160][problem:CodeForces-17E][problem:HDU-5658][problem:HDU-5157][problem:HDU-5421]\n\n基础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][problem:HDU-2084][problem:HDU-2018][problem:HDU-2044][problem:HDU-2041][problem:HDU-2050][problem:HDU-4054][problem:HDU-4489][problem:HDU-4747][problem:CodeForces-429B][problem:ZOJ-3747][problem:UVA-10328]\n\n背包九讲\n[problem:HDU-2602][problem:HDU-2955][problem:CodeForces-366C][problem:HDU-5534][problem:HDU-2844][problem:HDU-3033][problem:HDU-3535][problem:CodeForces-946D][problem:UVA-12099][problem:HDU-2159][problem:HDU-2639][problem:HDU-1171][problem:HDU-1059][problem:HDU-2191][problem:HDU-3732][problem:HDU-1712][problem:HDU-3496][problem:HDU-2546][problem:HDU-1203][problem:HDU-3466][problem:HDU-1864][problem:POJ-1170][problem:ZOJ-3769][problem:ZOJ-3638][problem:HDU-3092][problem:HDU-1248][problem:UVALive-5066][problem:UVA-10130][problem:UVA-10664][problem:UVA-12563][problem:UVA-147][problem:UVA-1627][problem:UVA-562][problem:UVA-674][problem:UVA-624][problem:POJ-3628][problem:POJ-3624][problem:POJ-1745][problem:POJ-1976][problem:POJ-1837][problem:POJ-1948][problem:POJ-3181][problem:POJ-1787][problem:POJ-3260][problem:POJ-2063][problem:ZOJ-3623][problem:ZOJ-3524][problem:ZOJ-3662][problem:POJ-1276][problem:POJ-2392][problem:POJ-3211][problem:HDU-3810]\n\n树形背包问题\n[problem:POJ-1155][problem:HDU-1011][problem:POJ-1947][problem:HDU-1561][problem:HDU-4003][problem:POJ-2486][problem:POJ-3345][problem:HDU-4044][problem:ZOJ-3627]\n\n树形DP\n[problem:POJ-3107][problem:HDU-4714][problem:HDU-4616][problem:HDU-4126][problem:HDU-4756][problem:HDU-3660][problem:CodeForces-337D][problem:HDU-2196]\n\n删点或者删边类树形DP\n[problem:HDU-3586][problem:POJ-3107][problem:POJ-2378][problem:POJ-3140]\n\nLIS与LCS\n[problem:HDU-1003][problem:UVA-10635][problem:HDU-4352][problem:POJ-1239][problem:HDU-1503][problem:HDU-1159][problem:UVA-111][problem:POJ-1080]\n\n数位DP\n[problem:CodeForces-55D][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][problem:CodeForces-401D][problem:HDU-4398][problem:HDU-3693][problem:HDU-3565][problem:CodeForces-258B]\n\n插头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][problem:POJ-2411][problem:HDU-1565][problem:HDU-2167]\n\n斜率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][problem:HYSBZ-1499][problem:HYSBZ-1911][problem:HYSBZ-1010]\n\n区间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][problem:POJ-1141][problem:HDU-4745][problem:ZOJ-3541]\n\n状压DP\n[problem:HDU-4568][problem:HDU-4539][problem:HDU-4529][problem:POJ-1185][problem:HDU-3811][problem:POJ-1038][problem:HDU-2441][problem:HDU-4026][problem:HDU-4281]TSP[problem:HDU-5067][problem:POJ-2688][problem:POJ-3311][problem:HDU-3001][problem:POJ-2677]\n\n高斯消元求DP\n[problem:HDU-4418]\n\n数据结构优化DP\n[problem:POJ-1048]\n\n单调队列优化\n[problem:HDU-3401][problem:POJ-3245]\n\n四边形不等式优化\n[problem:HDU-2952]\n\n二分尺取单调栈队列\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\n线段树\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\n二维线段树树状数组\n[problem:CodeForces-240F][problem:HDU-1823][problem:HDU-4819][problem:HDU-5517][problem:HYSBZ-1452][problem:POJ-1195][problem:POJ-1656][problem:POJ-2155][problem:UVA-11297]\n\n线段树进阶\n[problem:HDU-5306][problem:HDU-5316][problem:HDU-5367][problem:HDU-5592][problem:HDU-5722][problem:HDU-5828][problem:HDU-5862][problem:HYSBZ-1858HYSBZ][problem:2957-HYSBZ][problem:1858-HYSBZ][problem:2957-CodeForces][problem:500E-CodeForces][problem:515E-CodeForces][problem:558E-CodeForces][problem:594D-CodeForces][problem:609F-CodeForces][problem:620E-CodeForces][problem:626G-CodeForces][problem:629-DCodeForces][problem:635D-CodeForces][problem:719-ECodeForces][problem:777E-CodeForces][problem:786B-HDU][problem:5238-HDU][problem:5239-HDU][problem:5289-HDU][problem:5324-HDU][problem:5372-HDU][problem:5412-HDU][problem:5475-HDU][problem:5493-HDU][problem:5634-HDU][problem:5700-HDU][problem:5726-HDU][problem:5877-HDU][problem:6070-HYSBZ][problem:1103-HYSBZ][problem:3295-HYSBZ]\n\n动态开点线段树\n[problem:HDU-6183][problem:CodeForces-915E]\n\n线段树离散化\n[problem:HDU-4325][problem:UVALive-7141][problem:POJ-3277][problem:HDU-3333][problem:LightOJ-1089][problem:POJ-3368][problem:ZOJ-3612]\n\n扫描线\n[problem:POJ-3470][problem:POJ-3109][problem:UVA-11990][problem:HDU-1828][problem:HDU-4419][problem:POJ-2482][problem:CodeForces-817F]\n\nRMQ\n[problem:HYSBZ-1067][problem:POJ-1050][problem:POJ-2019][problem:HDU-3486][problem:HDU-3193][problem:HDU-2888][problem:HDU-3183]\n\n线段树LCA树链剖分\n[problem:POJ-2828][problem:POJ-3667][problem:POJ-1151][problem:POJ-2761][problem:POJ-2886][problem:HDU-4942][problem:HDU-4008][problem:HDU-5274][problem:HDU-3966][problem:HDU-4729][problem:HDU-3710][problem:POJ-2831][problem:HDU-4718][problem:HDU-5029][problem:HDU-5052][problem:POJ-3237][problem:FZU-2082][problem:LightOJ-1348]\n\n伸展树(splaytree)\n[problem:POJ-3481][problem:HDU-1890][problem:HDU-3436][problem:HDU-3487][problem:HYSBZ-1588][problem:HYSBZ-1208][problem:HYSBZ-1269][problem:HYSBZ-1500][problem:POJ-3580][problem:HDU-2475][problem:HDU-3726]\n\n主席树\n[problem:POJ-2104][problem:SPOJ-COT][problem:SPOJ-COT2][problem:SPOJ-COT4][problem:ZOJ-2112][problem:CodeForces-484E][problem:CodeForces-538F][problem:CodeForces-547E][problem:CodeForces-707D][problem:CodeForces-786C][problem:CodeForces-840D][problem:CodeForces-853C][problem:HDU-2665][problem:HDU-3727][problem:HDU-4348][problem:HDU-4417][problem:HDU-4605][problem:HDU-4866][problem:HDU-5678][problem:HDU-5919][problem:HDU-6278][problem:HYSBZ-1926][problem:HYSBZ-2588][problem:HYSBZ-2653][problem:HYSBZ-2809][problem:HYSBZ-3123][problem:HYSBZ-3207][problem:HYSBZ-3673][problem:HYSBZ-3674][problem:HYSBZ-3932][problem:POJ-2104POJ][problem:2761-UVA]\n\n莫队算法\n[problem:HYSBZ-2038][problem:NBUT-1457][problem:POJ-3241][problem:UVALive-3662][problem:CodeForces-220B][problem:CodeForces-940F][problem:CodeForces-617E][problem:SPOJ-GSS2][problem:SPOJ-DQUERY][problem:CodeForces-86D][problem:LightOJ-1188][problem:UVA-12345]\n\n划分树\n[problem:HDU-3473]\n\nK-DTree[problem:HYSBZ-2648][problem:HYSBZ-2716][problem:HYSBZ-2626][problem:HYSBZ-4520]\n\n斯坦纳树\n[problem:POJ-3123]\n\n虚树\n[problem:HYSBZ-3991][problem:HYSBZ-2286][problem:HYSBZ-3572]\n\n点分治\n[problem:POJ1741-HYSBZ][problem:2152-HYSBZ]\n\nCDQ分治\n[problem:HYSBZ-3262][problem:HDU-4742][problem:HDU-5618]\n\n动态树LCT\n[problem:SPOJ-QTREE][problem:HYSBZ-2759][problem:HYSBZ-3153][problem:HYSBZ-2049][problem:HDU-4010][problem:HYSBZ-2002][problem:URAL-1553][problem:SPOJ-OTOCI][problem:HYSBZ-1095][problem:HYSBZ-1036][problem:HDU-1000][problem:HYSBZ-2243][problem:ZOJ-3522][problem:SPOJ-GSS7]\n\n可持久化结构\n[problem:HYSBZ-2741][problem:HDU-5801][problem:HYSBZ-3685][problem:HYSBZ-3489][problem:HYSBZ-1901][problem:HYSBZ-1146][problem:HYSBZ-3261][problem:HYSBZ-4546][problem:UVA-12538]\n\n\n概率期望\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","threadId":41412,"likeCnt":18,"createTime":1546683094000,"isWorkbook":true,"viewCnt":6672,"openness":2,"fav":false,"id":826,"trustable":false}