Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"HDU-1545\":[\"01-K Code\",263,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZhejiang+Provincial+Programming+Contest+2006\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Zhejiang Provincial Programming Contest 2006 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-3070\":[\"Colored stones\",118,null],\"HDU-1423\":[\"Greatest Common Increasing Subsequence\",2650,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d+ACM%CA%EE%C6%DA%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A8%B6%FE%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM暑期集训队练习赛(二) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10641\":[\"Barisal Stadium\",277,null],\"HDU-1428\":[\"漫步校园\",1284,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d+ACM%CA%EE%C6%DA%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A8%C8%FD%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM暑期集训队练习赛(三) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"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-2533\":[\"Longest Ordered Subsequence\",24509,\"\\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\"],\"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\"],\"UVA-10648\":[\"Chocolate Box\",423,null],\"UVA-10405\":[\"Longest Common Subsequence\",16364,null],\"HDU-1422\":[\"重温世界杯\",2200,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d+ACM%CA%EE%C6%DA%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A8%B6%FE%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM暑期集训队练习赛(二) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1421\":[\"搬寝室\",7994,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d+ACM%CA%EE%C6%DA%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A8%B6%FE%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM暑期集训队练习赛(二) \\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\",1729,\"\\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\"],\"HDU-4258\":[\"Covered Walkway\",456,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+University+of+Chicago+Invitational+Programming+Contest+2012\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The University of Chicago Invitational Programming Contest 2012 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-1380\":[\"A Scheduling Problem\",198,null],\"SPOJ-COINS\":[\"Bytelandian gold coins\",26860,\"Purdue Programming Contest Training\"],\"UVA-1025\":[\"A Spy in the Metro\",4322,null],\"POJ-3071\":[\"Football\",3481,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dStanford+Local+2006\\\"\\u003eStanford Local 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-136\":[\"Ugly Numbers\",31805,null],\"SPOJ-ACODE\":[\"Alphacode\",22861,\"ACM East Central North America Regional Programming Contest 2004\"],\"URAL-1018\":[\"Binary Apple Tree\",6245,\"Ural State University Internal Contest \\u002799 #2\"],\"HDU-4949\":[\"Light\",89,\"\\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+8\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 Multi-University Training Contest 8 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1559\":[\"最大子矩阵\",4724,\"\\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\"],\"UVALive-2759\":[\"Common Subsequence\",255,\"Regionals 2003 \\u003e\\u003e Europe - Southeastern\"],\"UVA-10074\":[\"Take the Land\",4991,null],\"TopCoder-7332\":[\"FairTournament\",3,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10668\\u0026amp;pm\\u003d7332\\\"\\u003eSingle Round Match 344 Round 1 - Division I, Level Three\\u003c/a\\u003e\"],\"POJ-1579\":[\"Function Run Fun\",10661,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPacific+Northwest+1999\\\"\\u003ePacific Northwest 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1458\":[\"Common Subsequence\",26861,\"\\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\"],\"UVA-10635\":[\"Prince and Princess\",4671,null],\"UVA-707\":[\"Robbery\",560,null],\"HDU-2089\":[\"不要62\",26527,\"\\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\"],\"SPOJ-MAIN72\":[\"Subset sum\",2069,\"Own problem used for NSIT-IIITA main contest #7\"],\"ZOJ-1107\":[\"FatMouse and Cheese\",2366,null],\"ZOJ-1227\":[\"Free Candies\",910,null],\"ZOJ-1100\":[\"Mondriaan\\u0027s Dream\",1770,null],\"ZOJ-1102\":[\"Phylogenetic Trees Inherited\",264,null],\"UVA-147\":[\"Dollars\",12207,null],\"SPOJ-PARTY\":[\"Party Schedule\",9066,\"Swiss Olympiad in Informatics 2004\"],\"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\"],\"UVA-10068\":[\"The Treasure Hunt\",158,null],\"UVA-10860\":[\"Many a Little makes a Mickle\",379,null],\"UVA-10981\":[\"String Morphing\",186,null],\"UVA-10069\":[\"Distinct Subsequences\",3732,null],\"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-1206\":[\"劲乐团\",6,\"\\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\"],\"POJ-3046\":[\"Ant Counting\",2803,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+November+Silver\\\"\\u003eUSACO 2005 November Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1208\":[\"Pascal\\u0027s Travels\",1291,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Central+USA+2005\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central USA 2005 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"URAL-1148\":[\"Building Towers\",287,\"\"],\"HDU-3507\":[\"Print Article\",4483,\"\\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\"],\"POJ-2759\":[\"Distributing tasks\",155,\"\\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-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\"],\"ZOJ-1108\":[\"FatMouse\\u0027s Speed\",3001,null],\"UVA-10502\":[\"Counting Rectangles\",2066,null],\"HDU-1565\":[\"方格取数(1)\",3256,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHappy+2007\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Happy 2007 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-3537\":[\"Cake\",1577,null],\"UVA-116\":[\"Unidirectional TSP\",12055,null],\"ZOJ-1234\":[\"Chopsticks\",1812,null],\"HDU-3183\":[\"A Magic Lamp\",3042,\"\\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\"],\"POJ-3171\":[\"Cleaning Shifts\",1402,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+December+Silver\\\"\\u003eUSACO 2005 December Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10192\":[\"Vacation\",9085,null],\"UVA-231\":[\"Testing the CATCHER\",7055,null],\"UVA-1289\":[\"Stacking Plates\",324,null],\"POJ-3176\":[\"Cow Bowling\",14865,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+December+Bronze\\\"\\u003eUSACO 2005 December Bronze\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-111\":[\"History Grading\",12017,null],\"UVA-10970\":[\"Big Chocolate\",18978,null],\"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\"],\"CodeForces-55D\":[\"Beautiful numbers\",6010,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/55\\\"\\u003eCodeforces Beta Round 51\\u003c/a\\u003e\"],\"POJ-2520\":[\"DNA Sequence Alignment\",77,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2005.07.31\\\"\\u003ePOJ Monthly--2005.07.31\\u003c/a\\u003e, CHEN Shixi\\u003c/div\\u003e\"],\"HDU-4844\":[\"公路巡逻\",57,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dCTSC2000+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e CTSC2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1337\":[\"The Drunk Jailer\",1738,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dGreater+New+York+2002\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Greater New York 2002 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1579\":[\"Function Run Fun\",1589,\"\\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%D2%BB\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 冬练三九之一 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-12594\":[\"Naming Babies\",129,null],\"POJ-1795\":[\"DNA Laboratory\",495,\"\\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-11825\":[\"Hackers\\u0027 Crackdown\",1797,null],\"CodeForces-149D\":[\"Coloring Brackets\",4928,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/149\\\"\\u003eCodeforces Round 106 (Div. 2)\\u003c/a\\u003e\"],\"POJ-3616\":[\"Milking Time\",8710,\"\\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\"],\"UVA-10616\":[\"Divisible Group Sums\",4124,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\"],\"POJ-3735\":[\"Training little cats\",2542,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPKU+Campus+2009+%28POJ+Monthly+Contest+%E2%80%93+2009.05.17%29\\\"\\u003ePKU Campus 2009 (POJ Monthly Contest – 2009.05.17)\\u003c/a\\u003e, Facer\\u003c/div\\u003e\"],\"HDU-1692\":[\"Destroy the Well of Life\",417,\"\\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-1574\":[\"RP问题\",448,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-1+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-1 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4842\":[\"过河\",107,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dNOIP2005\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e NOIP2005 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1331\":[\"Function Run Fun\",3566,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dPacific+Northwest+1999\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Pacific Northwest 1999 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4843\":[\"古城之谜\",20,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dNOI2000\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e NOI2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVALive-3983\":[\"Robotruck\",862,\"Regionals 2007 \\u003e\\u003e Europe - Southwestern\"],\"UVA-10859\":[\"Placing Lampposts\",1593,null],\"UVA-10739\":[\"String to Palindrome\",3929,null],\"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\"],\"UVA-10618\":[\"Tango Tango Insurrection\",578,null],\"UVA-242\":[\"Stamps and Envelope Size\",1203,null],\"ZOJ-3541\":[\"The Last Puzzle\",881,null],\"POJ-3181\":[\"Dollar Dayz\",3776,\"\\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\"],\"UVA-10201\":[\"Adventures in Moving - Part IV\",1440,null],\"POJ-3420\":[\"Quad Tiling\",1938,\"\\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, Dagger\\u003c/div\\u003e\"],\"HDU-4734\":[\"F(x)\",4110,\"\\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-1227\":[\"Fast Food\",1205,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSouthwestern+Europe+1998\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Southwestern Europe 1998 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-1228\":[\"Integer Transmission\",241,null],\"UVA-1347\":[\"Tour\",3369,null],\"POJ-3666\":[\"Making the Grade\",5064,\"\\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\"],\"UVA-12186\":[\"Another Crisis\",3107,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\"],\"UVALive-3530\":[\"Martian Mining\",380,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"HDU-1224\":[\"Free DIY Tour\",2325,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%D6%DD%B5%E7%D7%D3%BF%C6%BC%BC%B4%F3%D1%A7%B5%DA%C8%FD%BD%EC%B3%CC%D0%F2%C9%E8%BC%C6%B4%F3%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭州电子科技大学第三届程序设计大赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1466\":[\"计算直线的交点数\",4101,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM%CA%EE%C6%DA%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A8%BE%C5%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM暑期集训队练习赛(九) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1013\":[\"Great Equipment\",1894,null],\"UVA-1344\":[\"Tian Ji -- The Horse Racing\",632,null],\"ZOJ-1132\":[\"Railroad\",292,null],\"UVA-1220\":[\"Party at Hali-Bula\",2329,null],\"UVA-11400\":[\"Lighting System Design\",2936,null],\"TopCoder-7415\":[\"ReverseResources\",0,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10666\\u0026amp;pm\\u003d7415\\\"\\u003eSingle Round Match 342 Round 1 - Division I, Level Two\\u003c/a\\u003e\"],\"POJ-2342\":[\"Anniversary party\",6920,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUral+State+University+Internal+Contest+October%272000+Students+Session\\\"\\u003eUral State University Internal Contest October\\u00272000 Students Session\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-590\":[\"Always on the run\",1626,null],\"SPOJ-EDIST\":[\"Edit distance\",14892,\"Internet\"],\"UVA-11088\":[\"End up with More Teams\",785,null],\"POJ-1014\":[\"Dividing\",13869,\"\\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+1999\\\"\\u003eMid-Central European Regional Contest 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-4507\":[\"吉哥系列故事——恨7不成妻\",2416,\"\\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\"],\"POJ-1015\":[\"Jury Compromise\",7045,\"\\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\"],\"UVA-10559\":[\"Blocks\",1844,null],\"POJ-2229\":[\"Sumsets\",8991,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+January+Silver\\\"\\u003eUSACO 2005 January Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVALive-3882\":[\"And Then There Was One\",1383,\"Regionals 2007 \\u003e\\u003e Asia - Tokyo\"],\"UVA-10798\":[\"Be wary of Roses\",188,null],\"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-1114\":[\"Piggy-Bank\",18597,\"\\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-1355\":[\"The Peanuts\",504,\"\"],\"UVA-107\":[\"The Cat in the Hat\",6577,null],\"ZOJ-1149\":[\"Dividing\",2447,null],\"UVA-348\":[\"Optimal Array Multiplication Sequence\",5260,null],\"ZOJ-1027\":[\"Human Gene Functions\",3304,null],\"UVA-104\":[\"Arbitrage\",5138,null],\"ZOJ-1147\":[\"Formatting Text\",166,null],\"UVA-108\":[\"Maximum Sum\",22190,null],\"UVA-900\":[\"Brick Wall Patterns\",11803,null],\"UVA-103\":[\"Stacking Boxes\",8040,null],\"POJ-1260\":[\"Pearls\",5026,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNorthwestern+Europe+2002\\\"\\u003eNorthwestern Europe 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1463\":[\"Strategic game\",4543,\"\\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\"],\"HYSBZ-1499\":[\"REKLAME\",121,\"\"],\"POJ-2430\":[\"Lazy Cows\",829,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+U+S+Open+Gold\\\"\\u003eUSACO 2005 U S Open Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HYSBZ-1010\":[\"玩具装箱toy\",466,\"HNOI2008\"],\"HDU-1121\":[\"Complete the Sequence\",720,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dCentral+Europe+2000\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Central Europe 2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1244\":[\"Max Sum Plus Plus Plus\",903,\"\"],\"HDU-1243\":[\"反恐训练营\",1494,\"\"],\"HDU-1003\":[\"Max Sum\",61422,\"\"],\"HYSBZ-1812\":[\"riv\",16,\"Ioi2005\"],\"UVA-437\":[\"The Tower of Babylon\",8998,null],\"SPOJ-BALNUM\":[\"Balanced Numbers\",1440,\"Cuban Olympiad in Informatics 2012 - Day 2 Problem A\"],\"ZOJ-2125\":[\"Rocket Mania\",164,null],\"ZOJ-2366\":[\"Weird Dissimilarity\",234,null],\"UVA-1366\":[\"Martian Mining\",468,null],\"UVA-12170\":[\"Easy Climb\",416,null],\"UVA-674\":[\"Coin Change\",18671,null],\"POJ-3411\":[\"Paid Roads\",2422,\"\\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\"],\"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\"],\"UVA-10891\":[\"Game of Sum\",4539,null],\"UVA-10099\":[\"The Tourist Guide\",7582,null],\"POJ-2441\":[\"Arrange the Bulls\",1697,\"\\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,TN\\u003c/div\\u003e\"],\"UVA-1379\":[\"Pitcher Rotation\",207,null],\"HDU-1493\":[\"QQpet exploratory park\",456,\"\\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\"],\"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-1494\":[\"跑跑卡丁车\",1208,\"\\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\"],\"HDU-3555\":[\"Bomb\",8218,\"\\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\"],\"UVA-10534\":[\"Wavio Sequence\",5483,null],\"UVA-10898\":[\"Combo Deal\",761,null],\"HDU-1257\":[\"最少拦截系统\",26040,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙江工业大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-3469\":[\"Food Delivery\",2195,null],\"ZOJ-1163\":[\"The Staircases\",2793,null],\"UVA-1375\":[\"The Best Name for Your Baby\",160,null],\"UVA-1252\":[\"Twenty Questions\",1345,null],\"UVA-443\":[\"Humble Numbers\",6239,null],\"UVA-1371\":[\"Period\",193,null],\"TopCoder-7505\":[\"CsCourses\",10,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10664\\u0026amp;pm\\u003d7505\\\"\\u003eSingle Round Match 340 Round 1 - Division I, Level Two\\u003c/a\\u003e\\n\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10664\\u0026amp;pm\\u003d7505\\\"\\u003eSingle Round Match 340 Round 1 - Division II, Level Three\\u003c/a\\u003e\"],\"HDU-3449\":[\"Consumer\",1385,\"\\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%A82%A3%A9%A1%AA%A1%AAHost+by+BUPT+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(2)——Host by BUPT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"TopCoder-6876\":[\"ValidPlates\",5,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10665\\u0026amp;pm\\u003d6876\\\"\\u003eSingle Round Match 341 Round 1 - Division I, Level Three\\u003c/a\\u003e\"],\"UVA-10003\":[\"Cutting Sticks\",17456,null],\"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\"],\"UVA-10000\":[\"Longest Paths\",5790,null],\"HDU-1029\":[\"Ignatius and the Princess IV\",21640,\"\"],\"UVA-11450\":[\"Wedding shopping\",6956,null],\"POJ-2018\":[\"Best Cow Fences\",4402,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2003+March+Green\\\"\\u003eUSACO 2003 March Green\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-1543\":[\"Telescope\",303,null],\"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\",13554,\"\"],\"HDU-1025\":[\"Constructing Roads In JGShining\\u0027s Kingdom\",6816,\"\"],\"UVALive-4794\":[\"Sharing Chocolate\",857,\"World Finals \\u003e\\u003e 2010 - Harbin\"],\"ZOJ-1733\":[\"Common Subsequence\",4002,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\"],\"HDU-1159\":[\"Common Subsequence\",22975,\"\\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\"],\"UVA-1439\":[\"Exclusive Access 2\",214,null],\"HDU-1712\":[\"ACboy needs your help\",5353,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-Spring+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-Spring Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2385\":[\"Apple Catching\",7310,\"\\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\"],\"UVA-12099\":[\"The Bookcase\",483,null],\"HDU-3450\":[\"Counting Sequences\",800,\"\\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%A82%A3%A9%A1%AA%A1%AAHost+by+BUPT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(2)——Host by BUPT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10118\":[\"Free Candies\",1943,null],\"UVA-10910\":[\"Marks Distribution\",2626,null],\"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\"],\"HDU-1158\":[\"Employment Planning\",2481,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+1997%2C+Shanghai+%28Mainland+China%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 1997, Shanghai (Mainland China) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1738\":[\"An old Stone Game\",831,\"\\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\"],\"UVA-10918\":[\"Tri Tiling\",2732,null],\"UVA-10917\":[\"Walk Through the Forest\",2019,null],\"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\"],\"POJ-2152\":[\"Fire\",1055,\"\\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-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-2392\":[\"Space Elevator\",5591,\"\\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\"],\"ZOJ-1183\":[\"Scheduling Lectures\",460,null],\"HDU-1723\":[\"Distribute Message\",1105,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHZIEE+2007+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HZIEE 2007 Programming Contest \\u003c/a\\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\"],\"UVA-10100\":[\"Longest Match\",3131,null],\"POJ-2479\":[\"Maximum sum\",11181,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Contest\\\"\\u003ePOJ Contest\\u003c/a\\u003e,Author:Mathematica@ZSU\\u003c/div\\u003e\"],\"UVA-1204\":[\"Fun Game\",326,null],\"POJ-1821\":[\"Fence\",2021,\"\\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\"],\"HDU-1165\":[\"Eddy\\u0027s research II\",2085,\"\"],\"LightOJ-1422\":[\"Halloween Costumes\",3116,null],\"ZOJ-2845\":[\"The Best Travel Design\",116,null],\"HDU-1160\":[\"FatMouse\\u0027s Speed\",9501,\"\\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\"],\"UVA-1322\":[\"Minimizing Maximizer\",245,null],\"UVA-1443\":[\"Garlands\",201,null],\"ZOJ-1196\":[\"Fast Food\",1451,null],\"ZOJ-1074\":[\"To the Max\",5304,null],\"ZOJ-3494\":[\"BCD Code\",1334,null],\"UVA-12093\":[\"Protecting Zonk\",382,null],\"UVA-10453\":[\"Make Palindrome\",2527,null],\"UVA-10572\":[\"Black \\u0026amp; White\",256,null],\"UVA-1218\":[\"Perfect Service\",2061,null],\"UVA-11420\":[\"Chest of Drawers\",2220,null],\"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\"],\"POJ-1159\":[\"Palindrome\",16366,\"\\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\"],\"UVA-1336\":[\"Fixing the Great Wall\",909,null],\"HDU-1176\":[\"免费馅饼\",21465,\"\"],\"UVA-1579\":[\"Matryoshka\",272,null],\"UVA-10337\":[\"Flight Planner\",2746,null],\"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-1058\":[\"Humble Numbers\",11631,\"\\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\"],\"SPOJ-PIGBANK\":[\"Piggy-Bank\",8358,\"ACM Central European Programming Contest, Prague 1999\"],\"UVA-526\":[\"String Distance and Transform Process\",2227,null],\"UVALive-5097\":[\"Cross the Wall\",189,\"Regionals 2010 \\u003e\\u003e Asia - Harbin\"],\"ZOJ-1880\":[\"Tug of War\",1072,null],\"UVA-1331\":[\"Minimax Triangulation\",775,null],\"POJ-2373\":[\"Dividing the Path\",1531,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+December+Gold\\\"\\u003eUSACO 2004 December Gold\\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-2057\":[\"The Lost House\",985,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBeijing+2004\\\"\\u003eBeijing 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1501\":[\"Zipper\",3442,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dPacific+Northwest+2004\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Pacific Northwest 2004 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-1628\":[\"Pizza Delivery\",246,null],\"HDU-1500\":[\"Chopsticks\",883,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dOIBH+Reminiscence+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e OIBH Reminiscence Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-1629\":[\"Cake slicing\",1164,null],\"POJ-1088\":[\"滑雪\",34476,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSHTSC+2002\\\"\\u003eSHTSC 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1502\":[\"Regular Words\",895,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAndrew+Stankevich%26%23039%3Bs+Contest+%2310\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Andrew Stankevich\\u0027s Contest #10 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-12222\":[\"Mountain Road\",233,null],\"HDU-1505\":[\"City Game\",2847,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSoutheastern+Europe+2004\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Southeastern Europe 2004 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10163\":[\"Storage Keepers\",1119,null],\"UVA-10285\":[\"Longest Run on a Snowboard\",6916,null],\"HDU-1506\":[\"Largest Rectangle in a Histogram\",7891,\"\\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\"],\"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\"],\"UVA-10723\":[\"Cyborg Genes\",1315,null],\"POJ-3709\":[\"K-Anonymous Sequence\",1539,\"\\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\"],\"UVALive-2288\":[\"To The Max\",288,\"Regionals 2001 \\u003e\\u003e North America - Greater NY\"],\"UVA-1625\":[\"Color Length\",1709,null],\"UVA-1626\":[\"Brackets sequence\",1871,null],\"HDU-1069\":[\"Monkey and Banana\",12267,\"\\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-12589\":[\"Learning Vector\",550,null],\"UVA-12105\":[\"Bigger is Better\",618,null],\"UVA-1627\":[\"Team them up!\",693,null],\"UVA-612\":[\"DNA Sorting\",7102,null],\"UVALive-6771\":[\"Buffed Buffet\",29,\"World Finals \\u003e\\u003e 2014 - Ekaterinburg\"],\"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\"],\"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\"],\"ZOJ-1093\":[\"Monkey and Banana\",3071,null],\"POJ-2184\":[\"Cow Exhibition\",5308,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2003+Fall\\\"\\u003eUSACO 2003 Fall\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-11003\":[\"Boxes\",2214,null],\"UVA-10036\":[\"Divisibility\",6063,null],\"POJ-1651\":[\"Multiplication Puzzle\",9051,\"\\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-10154\":[\"Weights and Measures\",3246,null],\"HDU-2602\":[\"Bone Collector\",33152,\"\\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-1513\":[\"Palindrome\",1722,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dIOI+2000\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e IOI 2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1516\":[\"String Distance and Transform Process\",326,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+1996%2C+Shanghai+%28Mainland+China%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 1996, Shanghai (Mainland China) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-11000\":[\"Bee\",8853,null],\"UVA-10271\":[\"Chopsticks\",3010,null],\"UVA-1631\":[\"Locker\",503,null],\"HDU-1074\":[\"Doing Homework\",6529,\"\"],\"UVA-1632\":[\"Alibaba\",728,null],\"UVA-1633\":[\"Dyslexic Gollum\",351,null],\"UVA-1634\":[\"The Picnic\",90,null],\"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-4582\":[\"DFS spanning tree\",350,\"\\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\"],\"UVA-10838\":[\"The Pawn Chess\",189,null],\"UVA-1630\":[\"Folding\",898,null],\"ZOJ-3164\":[\"Cookie Choice\",581,null],\"POJ-3280\":[\"Cheapest Palindrome\",6640,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+Open+Gold\\\"\\u003eUSACO 2007 Open Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1065\":[\"Wooden Sticks\",10156,\"\\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\"],\"UVA-12563\":[\"Jin Ge Jin Qu hao\",4054,null],\"POJ-1742\":[\"Coins\",10401,\"\\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-3249\":[\"Test for Job\",2391,\"\\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, 落叶飞雪\\u003c/div\\u003e\"],\"UVA-10261\":[\"Ferry Loading\",2852,null],\"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\"],\"POJ-2836\":[\"Rectangular Covering\",790,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPKU+Local+2006\\\"\\u003ePKU Local 2006\\u003c/a\\u003e, kicc\\u003c/div\\u003e\"],\"HDU-4352\":[\"XHXJ\\u0027s LIS\",2013,\"\\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!\",24528,\"\"],\"POJ-2955\":[\"Brackets\",8653,\"\\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\"],\"UVA-10944\":[\"Nuts for nuts..\",1002,null],\"HDU-1400\":[\"Mondriaan\\u0027s Dream\",1046,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUniversity+of+Ulm+Local+Contest+2000\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Ulm Local Contest 2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1520\":[\"Anniversary party\",6783,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUral+State+University+Internal+Contest+October%26%23039%3B2000+Students+Session\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Ural State University Internal Contest October\\u00272000 Students Session \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10940\":[\"Throwing cards away II\",4100,null],\"HDU-1080\":[\"Human Gene Functions\",2441,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+2001%2C+Taejon+%28South+Korea%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 2001, Taejon (South Korea) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1081\":[\"To The Max\",6075,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dGreater+New+York+2001\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Greater New York 2001 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2882\":[\"Nested Dolls\",266,null],\"POJ-1192\":[\"最优连通子集\",1506,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNoi+99\\\"\\u003eNoi 99\\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\"],\"SPOJ-PERMUT1\":[\"Permutations\",4489,\"III Polish Collegiate Team Programming Contest (AMPPZ), 1998\"],\"POJ-3254\":[\"Corn Fields\",9800,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+November+Gold\\\"\\u003eUSACO 2006 November Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-11584\":[\"Partitioning by Palindromes\",5320,null],\"HDU-1414\":[\"银河跳舞机大赛\",4,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2006-5+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2006-5 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10131\":[\"Is Bigger Smarter?\",9708,null],\"UVA-1412\":[\"Fund Management\",418,null],\"POJ-1631\":[\"Bridging signals\",7054,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNorthwestern+Europe+2003\\\"\\u003eNorthwestern Europe 2003\\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\"],\"UVA-10934\":[\"Dropping water balloons\",1502,null],\"UVA-10930\":[\"A-Sequence\",1551,null],\"UVALive-3267\":[\"Islands and Bridges\",39,\"Regionals 2004 \\u003e\\u003e Asia - Shanghai\"],\"ZOJ-1206\":[\"Win the Bonus\",740,null],\"UVALive-3275\":[\"Tiling the Plane\",83,\"World Finals \\u003e\\u003e 2005 - Shanghai\"],\"UVA-10817\":[\"Headmaster\\u0027s Headache\",2420,null],\"UVA-10937\":[\"Blackbeard the Pirate\",669,null],\"HDU-3709\":[\"Balanced Number\",3632,\"\\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\"],\"URAL-1519\":[\"Formula 1\",1545,\"\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"tigerisland45","updateTime":1552943434000,"title":"TYUT动态规划题汇","dislikeCnt":0,"content":"\nTYUT动态规划题汇\n\n紫书 第9章 动态规划(例题)\n1. [problem:UVA-1025] A Spy in the Metro\n2. [problem:UVA-437] The Tower of Babylon\n3. [problem:UVA-1347] Tour\n4. [problem:UVA-116] Unidirectional TSP\n5. [problem:UVA-12563] Jin Ge Jin Qu hao\n6. [problem:UVA-11400] Lighting System Design\n7. [problem:UVA-11584] Partitioning by Palindromes\n8. [problem:UVA-1625] Color Length\n9. [problem:UVA-10003] Cutting Sticks\n10. [problem:UVA-1626] Brackets sequence\n11. [problem:UVA-1331] Minimax Triangulation\n12. [problem:UVA-12186] Another Crisis\n13. [problem:UVA-1220] Party at Hali-Bula\n14. [problem:UVA-1218] Perfect Service\n15. [problem:UVA-10817] Headmaster\u0027s Headache\n16. [problem:UVA-1252] Twenty Questions\n17. [problem:UVA-1412] Fund Management\n18. [problem:UVA-10618] Tango Tango Insurrection\n19. [problem:UVA-1627] Team them up!\n20. [problem:UVA-10934] Dropping water balloons\n21. [problem:UVA-1336] Fixing the Great Wall\n22. [problem:UVA-12105] Bigger is Better\n23. [problem:UVA-1204] Fun Game\n24. [problem:UVA-12099] The Bookcase\n25. [problem:UVA-12170] Easy Climb\n26. [problem:UVA-1380] A Scheduling Problem\n27. [problem:UVA-10559] Blocks\n28. [problem:UVA-1439] Exclusive Access 2\n29. [problem:UVA-1228] Integer Transmission\n30. [problem:UVA-1375] The Best Name for Your Baby\n31. [problem:UVA-1628] Pizza Delivery\n\n紫书 第9章 动态规划(习题)\n1. [problem:UVA-10285] Longest Run on a Snowboard\n2. [problem:UVA-10118] Free Candies\n3. [problem:UVA-1629] Cake slicing\n4. [problem:UVA-1630] Folding\n5. [problem:UVA-242] Stamps and Envelope Size\n6. [problem:UVA-10723] Cyborg Genes\n7. [problem:UVA-1631] Locker\n8. [problem:UVA-1632] Alibaba\n9. [problem:UVA-10163] Storage Keepers\n10. [problem:UVA-10641] Barisal Stadium\n11. [problem:UVA-1633] Dyslexic Gollum\n12. [problem:UVA-12093] Protecting Zonk\n13. [problem:UVA-1289] Stacking Plates\n14. [problem:UVA-1543] Telescope\n15. [problem:UVA-12589] Learning Vector\n16. [problem:UVA-1634] The Picnic\n17. [problem:UVA-10271] Chopsticks\n18. [problem:UVA-1379] Pitcher Rotation\n19. [problem:UVA-1443] Garlands\n20. [problem:UVA-12222] Mountain Road\n21. [problem:UVA-1371] Period\n22. [problem:UVA-1579] Matryoshka\n23. [problem:UVA-1322] Minimizing Maximizer\n\nπ-Algorithmist Dynamic Programming\n1. [problem:UVALive-3530] Martian Mining\n2. [problem:SPOJ-ACODE] Alphacode\n3. [problem:SPOJ-COINS] Bytelandian gold coins\n4. [problem:SPOJ-EDIST] Edit distance\n5. [problem:SPOJ-MAIN72] Subset sum\n6. [problem:SPOJ-PARTY] Party Schedule\n7. [problem:SPOJ-PERMUT1] Permutations\n8. [problem:SPOJ-PIGBANK] Piggy-Bank\n9. [problem:TopCoder-7505] CsCourses\n10. [problem:TopCoder-7332] FairTournament\n11. [problem:TopCoder-7415] ReverseResources\n12. [problem:TopCoder-6876] ValidPlates\n13. [problem:UVA-10000] Longest Paths\n14. [problem:UVA-10003] Cutting Sticks\n15. [problem:UVA-10036] Divisibility\n16. [problem:UVA-10068] The Treasure Hunt\n17. [problem:UVA-10074] Take the Land\n18. [problem:UVA-10099] The Tourist Guide\n19. [problem:UVA-10100] Longest Match\n20. [problem:UVA-10131] Is Bigger Smarter?\n21. [problem:UVA-10192] Vacation\n22. [problem:UVA-103] Stacking Boxes\n23. [problem:UVA-10337] Flight Planner\n24. [problem:UVA-104] Arbitrage\n25. [problem:UVA-10405] Longest Common Subsequence\n26. [problem:UVA-10453] Make Palindrome\n27. [problem:UVA-10502] Counting Rectangles\n28. [problem:UVA-10616] Divisible Group Sums\n29. [problem:UVA-10648] Chocolate Box\n30. [problem:UVA-107] The Cat in the Hat\n31. [problem:UVA-10739] String to Palindrome\n32. [problem:UVA-10798] Be wary of Roses\n33. [problem:UVA-108] Maximum Sum\n34. [problem:UVA-10838] The Pawn Chess\n35. [problem:UVA-10860] Many a Little makes a Mickle\n36. [problem:UVA-10891] Game of Sum\n37. [problem:UVA-10898] Combo Deal\n38. [problem:UVA-10910] Marks Distribution\n39. [problem:UVA-10917] Walk Through the Forest\n40. [problem:UVA-10918] Tri Tiling\n41. [problem:UVA-10930] A-Sequence\n42. [problem:UVA-10934] Dropping water balloons\n43. [problem:UVA-10937] Blackbeard the Pirate\n44. [problem:UVA-10940] Throwing cards away II\n45. [problem:UVA-10944] Nuts for nuts..\n46. [problem:UVA-10970] Big Chocolate\n47. [problem:UVA-10981] String Morphing\n48. [problem:UVA-11000] Bee\n49. [problem:UVA-11003] Boxes\n50. [problem:UVA-11088] End up with More Teams\n51. [problem:UVA-111] History Grading\n52. [problem:UVA-11420] Chest of Drawers\n53. [problem:UVA-11450] Wedding shopping\n54. [problem:UVA-116] Unidirectional TSP\n55. [problem:UVA-136] Ugly Numbers\n56. [problem:UVA-147] Dollars\n57. [problem:UVA-231] Testing the CATCHER\n58. [problem:UVA-348] Optimal Array Multiplication Sequence\n59. [problem:UVA-443] Humble Numbers\n60. [problem:UVA-526] String Distance and Transform Process\n61. [problem:UVA-590] Always on the run\n62. [problem:UVA-612] DNA Sorting\n63. [problem:UVA-674] Coin Change\n64. [problem:UVA-707] Robbery\n65. [problem:UVA-900] Brick Wall Patterns\n\nπ-Algorithmist Longest Increasing Subsequence\n1. [problem:UVA-10131] Is Bigger Smarter?\n2. [problem:UVA-103] Stacking Boxes\n3. [problem:UVA-10534] Wavio Sequence\n4. [problem:UVA-111] History Grading\n\nπ-Algorithmist Longest Common Subsequence\n1. [problem:UVA-10100] Longest Match\n2. [problem:UVA-10192] Vacation\n3. [problem:UVA-10405] Longest Common Subsequence\n4. [problem:UVA-10453] Make Palindrome\n\n蓝书 1.4动态规划专题\n1. [problem:UVALive-3882] And Then There Was One\n2. [problem:UVA-10635] Prince and Princess\n3. [problem:UVA-10891] Game of Sum\n4. [problem:UVA-11825] Hackers\u0027 Crackdown\n5. [problem:UVA-10859] Placing Lampposts\n6. [problem:UVALive-3983] Robotruck\n7. [problem:UVALive-4794] Sharing Chocolate\n\n白书 2.3动态规划(练习题)\n1. [problem:POJ-3176] Cow Bowling\n2. [problem:POJ-2229] Sumsets\n3. [problem:POJ-2385] Apple Catching\n4. [problem:POJ-3616] Milking Time\n5. [problem:POJ-3280] Cheapest Palindrome\n6. [problem:POJ-1742] Coins\n7. [problem:POJ-3046] Ant Counting\n8. [problem:POJ-3181] Dollar Dayz\n9. [problem:POJ-1065] Wooden Sticks\n10. [problem:POJ-1631] Bridging signals\n11. [problem:POJ-3666] Making the Grade\n12. [problem:POJ-2392] Space Elevator\n13. [problem:POJ-2184] Cow Exhibition\n\n白书 3.4动态规划(练习题)\n1. [problem:POJ-2441] Arrange the Bulls\n2. [problem:POJ-3254] Corn Fields\n3. [problem:POJ-2836] Rectangular Covering\n4. [problem:POJ-1795] DNA Laboratory\n5. [problem:POJ-3411] Paid Roads\n6. [problem:POJ-3420] Quad Tiling\n7. [problem:POJ-3735] Training little cats\n8. [problem:POJ-3171] Cleaning Shifts\n\n吴书《算法设计编程实验》 第6章 动态规划\n1. [problem:UVA-1626] Brackets sequence\n2. [problem:UVA-147] Dollars\n3. [problem:UVA-10100] Longest Match\n4. [problem:UVA-111] History Grading\n5. [problem:POJ-1088] 滑雪\n6. [problem:UVA-10534] Wavio Sequence\n7. [problem:URAL-1018] Binary Apple Tree\n8. [problem:POJ-2342] Anniversary party\n9. [problem:UVA-10944] Nuts for nuts..\n10. [problem:POJ-2411] Mondriaan\u0027s Dream\n11. [problem:HYSBZ-1010] 玩具装箱toy\n12. [problem:HYSBZ-1499] 瑰丽华尔兹\n13. [problem:UVA-10918] Tri Tiling\n14. [problem:UVA-10910] Marks Distribution\n15. [problem:UVA-10648] Chocolate Box\n16. [problem:UVA-1025] A Spy in the Metro\n17. [problem:UVA-10917] Walk Through the Forest\n18. [problem:POJ-1185] 炮兵阵地\n19. [problem:UVALive-2759] Common Subsequence\n20. [problem:POJ-2430] Lazy Cows\n21. [problem:UVA-10405] Longest Common Subsequence\n22. [problem:UVA-10453] Make Palindrome\n23. [problem:UVA-10192] Vacation\n24. [problem:UVA-10131] Is Bigger Smarter?\n25. [problem:UVA-103] Stacking Boxes\n26. [problem:POJ-1579] Function Run Fun\n27. [problem:UVALive-2288] To The Max\n28. [problem:UVA-707] Robbery\n29. [problem:UVA-590] Always on the run\n30. [problem:UVA-1366] Martian Mining\n31. [problem:UVA-10739] String to Palindrome\n32. [problem:UVA-10981] String Morphing\n33. [problem:UVA-11088] End up with More Teams\n34. [problem:UVA-10860] Many a Little makes a Mickle\n35. [problem:HYSBZ-1812] riv\n36. [problem:UVALive-3267] Islands and Bridges\n37. [problem:UVALive-3275] Tiling the Plane\n38. [problem:UVA-1344] Tian Ji -- The Horse Racing\n39. [problem:POJ-1180] Batch Scheduling\n\n《挑战编程--程序设计竞赛训练手册》 11 Dynamic Programming\n1. [problem:UVA-10131] Is Bigger Smarter?\n2. [problem:UVA-10069] Distinct Subsequences\n3. [problem:UVA-10154] Weights and Measures\n4. [problem:UVA-116] Unidirectional TSP\n5. [problem:UVA-10003] Cutting Sticks\n6. [problem:UVA-10261] Ferry Loading\n7. [problem:UVA-10271] Chopsticks\n8. [problem:UVA-10201] Adventures in Moving - Part IV\n\nHDU Dynamic Programming\n1. [problem:HDU-1003] \t Max Sum \t\n2. [problem:HDU-1011] \t Starship Troopers \t\n3. [problem:HDU-1024] \t Max Sum Plus Plus \t\n4. [problem:HDU-1025] \t Constructing Roads In JGShining\u0027s Kingdom \t\n5. [problem:HDU-1058] \t Humble Numbers \t\n6. [problem:HDU-1059] \t Dividing \t\n7. [problem:HDU-1069] \t Monkey and Banana \t\n8. [problem:HDU-1074] \t Doing Homework \t\n9. [problem:HDU-1078] \t FatMouse and Cheese \t\n10. [problem:HDU-1080] \t Human Gene Functions \t\n11. [problem:HDU-1081] \t To The Max \t\n12. [problem:HDU-1087] \t Super Jumping! Jumping! Jumping! \t\n13. [problem:HDU-1114] \t Piggy-Bank \t\n14. [problem:HDU-1121] \t Complete the Sequence \t\n15. [problem:HDU-1158] \t Employment Planning \t\n16. [problem:HDU-1159] \t Common Subsequence \t\n17. [problem:HDU-1160] \t FatMouse\u0027s Speed \t\n18. [problem:HDU-1165] \t Eddy\u0027s research II \t\n19. [problem:HDU-1176] \t 免费馅饼 \t\n20. [problem:HDU-1203] \t I NEED A OFFER! \t\n21. [problem:HDU-1206] \t 劲乐团 \t\n22. [problem:HDU-1208] \t Pascal\u0027s Travels \t\n23. [problem:HDU-1224] \t Free DIY Tour \t\n24. [problem:HDU-1227] \t Fast Food \t\n25. [problem:HDU-1243] \t 反恐训练营 \t\n26. [problem:HDU-1244] \t Max Sum Plus Plus Plus \t\n27. [problem:HDU-1257] \t 最少拦截系统 \t\n28. [problem:HDU-1300] \t Pearls \t\n29. [problem:HDU-1331] \t Function Run Fun \t\n30. [problem:HDU-1337] \t The Drunk Jailer \t\n31. [problem:HDU-1355] \t The Peanuts \t\n32. [problem:HDU-1400] \t Mondriaan\u0027s Dream \t\n33. [problem:HDU-1414] \t 银河跳舞机大赛 \t\n34. [problem:HDU-1421] \t 搬寝室 \t\n35. [problem:HDU-1422] \t 重温世界杯 \t\n36. [problem:HDU-1423] \t Greatest Common Increasing Subsequence \t\n37. [problem:HDU-1428] \t 漫步校园 \t\n38. [problem:HDU-1466] \t 计算直线的交点数 \t\n39. [problem:HDU-1493] \t QQpet exploratory park \t\n40. [problem:HDU-1494] \t 跑跑卡丁车 \t\n41. [problem:HDU-1500] \t Chopsticks \t\n42. [problem:HDU-1501] \t Zipper \t\n43. [problem:HDU-1502] \t Regular Words \t\n44. [problem:HDU-1505] \t City Game \t\n45. [problem:HDU-1506] \t Largest Rectangle in a Histogram \t\n46. [problem:HDU-1513] \t Palindrome \t\n47. [problem:HDU-1516] \t String Distance and Transform Process \t\n48. [problem:HDU-1520] \t Anniversary party \t\n49. [problem:HDU-1545] \t 01-K Code \t\n50. [problem:HDU-1559] \t 最大子矩阵 \t\n51. [problem:HDU-1560] \t DNA sequence \t\n52. [problem:HDU-1561] \t The more, The Better \t\n53. [problem:HDU-1565] \t 方格取数(1) \t\n54. [problem:HDU-1574] \t RP问题 \t\n55. [problem:HDU-1579] \t Function Run Fun \t\n56. [problem:HDU-1692] \t Destroy the Well of Life \t\n57. [problem:HDU-1693] \t Eat the Trees \t\n58. [problem:HDU-1712] \t ACboy needs your help \t\n59. [problem:HDU-1723] \t Distribute Message \t\n60. [problem:HDU-2602] \t Bone Collector \t\n\n赵书 第七章 动态规划\n1. [problem:ZOJ-1163] The Staircases\n2. [problem:ZOJ-1183] Scheduling Lectures\n3. [problem:ZOJ-1196] Fast Food\n4. [problem:ZOJ-1206] Win the Bonus\n5. [problem:ZOJ-1227] Free Candies\n6. [problem:ZOJ-1234] Chopsticks\n7. [problem:ZOJ-1733] Common Subsequence\n8. [problem:ZOJ-1880] Tug of War\n9. [problem:ZOJ-2845] The Best Travel Design\n10. [problem:ZOJ-2882] Nested Dolls\n11. [problem:ZOJ-3070] Colored stones\n12. [problem:ZOJ-3541] The Last Puzzle\n\n赵书2 第六章 动态规划(1-2)\n1. [problem:ZOJ-1013] Great Equipment\n2. [problem:ZOJ-1027] Human Gene Functions\n3. [problem:ZOJ-1074] To the Max\n4. [problem:ZOJ-1093] Monkey and Banana\n5. [problem:ZOJ-1100] Mondriaan\u0027s Dream\n6. [problem:ZOJ-1102] Phylogenetic Trees Inherited\n7. [problem:ZOJ-1107] FatMouse and Cheese\n8. [problem:ZOJ-1108] FatMouse\u0027s Speed\n9. [problem:ZOJ-1132] Railroad\n10. [problem:ZOJ-1147] Formatting Text\n11. [problem:ZOJ-1149] Dividing\n\n余书 第3章 动态规划\n1. [problem:POJ-2479] Maximum sum\n2. [problem:POJ-1458] Common Subsequence\n3. [problem:POJ-1159] Palindrome\n4. [problem:POJ-2533] Longest Ordered Subsequence\n5. [problem:POJ-1463] Strategic game\n6. [problem:POJ-3071] Football\n7. [problem:POJ-1038] Bugs Integrated, Inc.\n\n喻书 第6章 动态规划(例题)\n1. [problem:HDU-2602] Bone Collector\n2. [problem:HDU-1114] Piggy-Bank\n3. [problem:HDU-2844] Coins\n4. [problem:HDU-3001] Travelling\n5. [problem:HDU-4949] Light\n6. [problem:HDU-4539] 郑厂长系列故事——排兵布阵\n7. [problem:HDU-3401] Trade\n8. [problem:HDU-3450] Counting Sequences\n9. [problem:HDU-4258] Covered Walkway\n10. [problem:HDU-2829] Lawrence\n11. [problem:HDU-1561] The more, The Better\n12. [problem:HDU-3183] A Magic Lamp\n13. [problem:POJ-3249] Test for Job\n14. [problem:HDU-1087] Super Jumping! Jumping! Jumping!\n15. [problem:POJ-2533] Longest Ordered Subsequence\n\n喻书 第6章 动态规划(习题)\n1. [problem:HDU-3449] Consumer\n2. [problem:ZOJ-3164] Cookie Choice\n3. [problem:POJ-3254] Corn Fields\n4. [problem:HDU-1074] Doing Homework\n5. [problem:HDU-1693] Eat the Trees\n6. [problem:HDU-1964] Pipes\n7. [problem:POJ-2373] Dividing the Path\n8. [problem:POJ-1821] Fence\n9. [problem:POJ-1160] Post Office\n10. [problem:HDU-3507] Print Article\n11. [problem:HDU-4582] DFS spanning tree\n12. [problem:POJ-1192] 最优连通子集\n\n吴书3 第5章 动态规划\n1. [problem:HDU-4842] 过河\n2. [problem:POJ-1014] Dividing\n3. [problem:POJ-1160] Post Office\n4. [problem:POJ-1738] An old Stone Game\n5. [problem:URAL-1148] Building Towers\n6. [problem:POJ-2520] DNA Sequence Alignment\n7. [problem:POJ-2759] Distributing tasks\n8. [problem:POJ-1631] Bridging signals\n9. [problem:POJ-2057] The Lost House\n10. [problem:POJ-2152] Fire\n11. [problem:HDU-4843] 古城之谜\n12. [problem:ZOJ-2366] Weird Dissimilarity\n13. [problem:HDU-4844] 公路巡逻\n14. [problem:URAL-1519] Formula 1\n15. [problem:POJ-1739] Tony\u0027s Tour\n16. [problem:UVA-10572] Black \u0026 White\n17. [problem:ZOJ-2125] Rocket Mania\n\nKB 专题十二 基础DP1\n1. [problem:HDU-1024] Max Sum Plus Plus\n2. [problem:HDU-1029] Ignatius and the Princess IV\n3. [problem:HDU-1069] Monkey and Banana\n4. [problem:HDU-1074] Doing Homework\n5. [problem:HDU-1087] Super Jumping! Jumping! Jumping!\n6. [problem:HDU-1114] Piggy-Bank\n7. [problem:HDU-1176] 免费馅饼\n8. [problem:HDU-1260] Tickets\n9. [problem:HDU-1257] 最少拦截系统\n10. [problem:HDU-1160] FatMouse\u0027s Speed\n11. [problem:POJ-1015] Jury Compromise\n12. [problem:POJ-1458] Common Subsequence\n13. [problem:POJ-1661] Help Jimmy\n14. [problem:POJ-2533] Longest Ordered Subsequence\n15. [problem:POJ-3186] Treats for the Cows\n16. [problem:HDU-1078] FatMouse and Cheese\n17. [problem:HDU-2859] Phalanx\n18. [problem:POJ-3616] Milking Time\n19. [problem:POJ-3666] Making the Grade\n\nKB 专题十五 数位DP\n1. [problem:CodeForces-55D] Beautiful numbers\n2. [problem:HDU-4352] XHXJ\u0027s LIS\n3. [problem:HDU-2089] 不要62\n4. [problem:HDU-3555] Bomb\n5. [problem:POJ-3252] Round Numbers\n6. [problem:HDU-3709] Balanced Number\n7. [problem:HDU-3652] B-number\n8. [problem:HDU-4734] F(x)\n9. [problem:ZOJ-3494] BCD Code\n10. [problem:HDU-4507] 吉哥系列故事――恨7不成妻\n11. [problem:SPOJ-BALNUM] Balanced Numbers\n\nKB 专题二十 斜率DP\n1. [problem:HDU-3507] Print Article\n2. [problem:HDU-2829] Lawrence\n3. [problem:HDU-4528] 小明系列故事――捉迷藏\n4. [problem:HDU-1300] Pearls\n5. [problem:HDU-2993] MAX Average Problem\n6. [problem:UVALive-5097] Cross the Wall\n7. [problem:HDU-3045] Picnic Cows\n8. [problem:HDU-3516] Tree Construction\n9. [problem:POJ-1160] Post Office\n10. [problem:POJ-1180] Batch Scheduling\n11. [problem:POJ-2018] Best Cow Fences\n12. [problem:POJ-3709] K-Anonymous Sequence\n13. [problem:POJ-2841] Navigation Game\n14. [problem:POJ-1260] Pearls\n15. [problem:UVA-12594] Naming Babies\n16. [problem:HDU-3480] Division\n17. [problem:UVALive-6771] Buffed Buffet\n\nKB 专题二十二 区间DP\n1. [problem:ZOJ-3537] Cake\n2. [problem:LightOJ-1422] Halloween Costumes\n3. [problem:POJ-2955] Brackets\n4. [problem:CodeForces-149D] Coloring Brackets\n5. [problem:POJ-1651] Multiplication Puzzle\n6. [problem:ZOJ-3469] Food Delivery\n7. [problem:HDU-4283] You Are the One\n8. [problem:HDU-2476] String painter\n\n","threadId":39993,"likeCnt":9,"createTime":1543567156000,"isWorkbook":true,"viewCnt":3039,"openness":1,"fav":false,"id":756,"trustable":false}