Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"UVA-11057\":[\"Exact Sum\",12787,null],\"UVA-11054\":[\"Wine trading in Gergovia\",5424,null],\"UVA-10087\":[\"The Tajmahal of ++Y2k\",139,null],\"SPOJ-FCTRL2\":[\"Small factorials\",49774,\"\"],\"UVA-815\":[\"Flooded!\",3453,null],\"UVA-814\":[\"The Letter Carrier\\u0027s Rounds\",1243,null],\"UVA-10093\":[\"An Easy Problem!\",3747,null],\"POJ-3751\":[\"时间日期格式转换\",4088,\"\"],\"POJ-3750\":[\"小孩报数问题\",7633,\"\"],\"UVA-10077\":[\"The Stern-Brocot Number System\",6326,null],\"UVA-10196\":[\"Check The Check\",5134,null],\"TopCoder-7576\":[\"Chessboard\",1,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10668\\u0026amp;pm\\u003d7576\\\"\\u003eSingle Round Match 344 Round 1 - Division II, Level One\\u003c/a\\u003e\"],\"UVA-10194\":[\"Football (aka Soccer)\",4368,null],\"POJ-2785\":[\"4 Values whose Sum is 0\",9722,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouthwestern+Europe+2005\\\"\\u003eSouthwestern Europe 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2665\":[\"Trees\",6316,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBeijing+2005+Preliminary\\\"\\u003eBeijing 2005 Preliminary\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2549\":[\"Sumsets\",2641,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2001.06.02\\\"\\u003eWaterloo local 2001.06.02\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1338\":[\"Ugly Numbers\",10507,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNew+Zealand+1990+Division+I\\\"\\u003eNew Zealand 1990 Division I\\u003c/a\\u003e,UVA 136\\u003c/div\\u003e\"],\"UVA-706\":[\"LC-Display\",11553,null],\"UVA-701\":[\"The Archeologists\\u0027 Dilemma\",3112,null],\"UVA-822\":[\"Queue and A\",583,null],\"HDU-3052\":[\"Vim\",64,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+15+-+Host+by+BUAA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 15 - Host by BUAA \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-944\":[\"Happy Numbers\",1008,null],\"UVA-10082\":[\"WERTYU\",35317,null],\"UVA-10189\":[\"Minesweeper\",28575,null],\"POJ-1782\":[\"Run Length Encoding\",1217,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+2004\\\"\\u003eUlm Local 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2991\":[\"Crane\",1857,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCTU+Open+2005\\\"\\u003eCTU Open 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3723\":[\"Conscription\",5973,\"\\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, windy7926778\\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\"],\"UVA-10062\":[\"Tell me the frequencies!\",9728,null],\"UVA-10183\":[\"How Many Fibs?\",6259,null],\"POJ-1664\":[\"放苹果\",22972,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dlwx%40POJ\\\"\\u003elwx@POJ\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVALive-2787\":[\"Doubles\",647,\"Regionals 2003 \\u003e\\u003e North America - Mid-Central USA\"],\"SPOJ-SBANK\":[\"Sorting Bank Accounts\",9012,\"-\"],\"HDU-5241\":[\"Friends\",803,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+2015+ACM-ICPC+China+Shanghai+Metropolitan+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 2015 ACM-ICPC China Shanghai Metropolitan Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10191\":[\"Longest Nap\",4817,null],\"UVA-10055\":[\"Hashmat the Brave Warrior\",73250,null],\"UVA-10298\":[\"Power Strings\",8828,null],\"POJ-3734\":[\"Blocks\",4039,\"\\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, Simon\\u003c/div\\u003e\"],\"POJ-2887\":[\"Big String\",1330,\"\\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, zhucheng\\u003c/div\\u003e\"],\"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\"],\"UVALive-3628\":[\"Blue Jeans\",264,\"Regionals 2006 \\u003e\\u003e North America - South Central USA\"],\"TopCoder-7552\":[\"EntertainingSegment\",2,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10881\\u0026amp;pm\\u003d7552\\\"\\u003e2007 TopCoder Collegiate Challenge Qualification Round 2 - Division I, Level Two\\u003c/a\\u003e\"],\"POJ-3617\":[\"Best Cow Line\",11354,\"\\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\"],\"POJ-3977\":[\"Subset\",1305,\"\\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-2408\":[\"Anagram Groups\",1259,\"\\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-1002\":[\"487-3279\",34756,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dEast+Central+North+America+1999\\\"\\u003eEast Central North America 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1127\":[\"Jack Straws\",2080,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dEast+Central+North+America+1994\\\"\\u003eEast Central North America 1994\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVALive-6929\":[\"Sums\",467,\"Regionals 2014 \\u003e\\u003e Europe - Central\"],\"POJ-2456\":[\"Aggressive cows\",14376,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+February+Gold\\\"\\u003eUSACO 2005 February Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVALive-2324\":[\"Human Gene Functions\",118,\"Regionals 2001 \\u003e\\u003e Asia - Taejon\"],\"POJ-2217\":[\"Secretary\",546,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCTU+FEE+Local+1998\\\"\\u003eCTU FEE Local 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-1589\":[\"Xiangqi\",2570,null],\"UVALive-2323\":[\"Modular Multiplication of Polynomials\",123,\"Regionals 2001 \\u003e\\u003e Asia - Taejon\"],\"SPOJ-HAROWS\":[\"A - Crazy Rows\",322,\"\"],\"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\"],\"UVALive-3527\":[\"Find the Clones\",285,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"UVALive-2559\":[\"Number Base Conversion\",102,\"Regionals 2002 \\u003e\\u003e North America - Greater NY\"],\"POJ-2348\":[\"Euclid\\u0027s Game\",4210,\"\\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\"],\"TopCoder-7411\":[\"TagalogDictionary\",1,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10666\\u0026amp;pm\\u003d7411\\\"\\u003eSingle Round Match 342 Round 1 - Division I, Level One\\u003c/a\\u003e\\n\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10666\\u0026amp;pm\\u003d7411\\\"\\u003eSingle Round Match 342 Round 1 - Division II, Level Two\\u003c/a\\u003e\"],\"TopCoder-7410\":[\"DegreesToRadians\",2,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10666\\u0026amp;pm\\u003d7410\\\"\\u003eSingle Round Match 342 Round 1 - Division II, Level One\\u003c/a\\u003e\"],\"POJ-2104\":[\"K-th Number\",14078,\"\\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\"],\"UVA-1598\":[\"Exchange\",411,null],\"SPOJ-IE4\":[\"Endless Knight\",48,\"Google Codejam 2008\"],\"UVALive-3524\":[\"The Cow Doctor\",137,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"UVA-1590\":[\"IP Networks\",2171,null],\"UVA-1591\":[\"Data Mining\",771,null],\"UVA-1592\":[\"Database\",3058,null],\"UVA-1593\":[\"Alignment of Code\",3623,null],\"UVA-1594\":[\"Ducci Sequence\",5166,null],\"UVA-1595\":[\"Symmetry\",3779,null],\"UVA-1596\":[\"Bug Hunt\",1124,null],\"UVA-1597\":[\"Searching the Web\",932,null],\"POJ-3680\":[\"Intervals\",2263,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.07.27\\\"\\u003ePOJ Founder Monthly Contest – 2008.07.27\\u003c/a\\u003e, windy7926778\\r\\u003cbr\\u003e\\u003c/div\\u003e\"],\"UVA-12049\":[\"Just Prune The List\",3160,null],\"POJ-2431\":[\"Expedition\",7161,\"\\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\"],\"TopCoder-7625\":[\"SimpleRotationDecoder\",0,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10668\\u0026amp;pm\\u003d7625\\\"\\u003eSingle Round Match 344 Round 1 - Division II, Level Two\\u003c/a\\u003e\"],\"TopCoder-7504\":[\"ProblemsToSolve\",6,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10664\\u0026amp;pm\\u003d7504\\\"\\u003eSingle Round Match 340 Round 1 - Division I, Level One\\u003c/a\\u003e\\n\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10664\\u0026amp;pm\\u003d7504\\\"\\u003eSingle Round Match 340 Round 1 - Division II, Level Two\\u003c/a\\u003e\"],\"POJ-2311\":[\"Cutting Game\",2315,\"\\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,CHEN Shixi(xreborner)\\u003c/div\\u003e\"],\"POJ-1222\":[\"EXTENDED LIGHTS OUT\",7755,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dGreater+New+York+2002\\\"\\u003eGreater New York 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2674\":[\"Linear world\",929,\"\\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\"],\"SPOJ-TEST\":[\"Life, the Universe, and Everything\",217553,\"Douglas Adams, The Hitchhiker\\u0027s Guide to the Galaxy\"],\"POJ-2676\":[\"Sudoku\",10312,\"\\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\"],\"POJ-2559\":[\"Largest Rectangle in a Histogram\",9385,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+2003\\\"\\u003eUlm Local 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"SPOJ-CANDY3\":[\"Candy III\",20470,\"IPSC 2006\"],\"Aizu-ALDS1_6_B\":[\"Partition\",9078,null],\"Aizu-ALDS1_6_A\":[\"Counting Sort\",9592,null],\"POJ-2686\":[\"Traveling by Stagecoach\",1877,\"\\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-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\"],\"Aizu-ALDS1_6_D\":[\"Minimum Cost Sort\",2579,null],\"UVALive-5600\":[\"Train Swapping\",52,\"Regionals 1994 \\u003e\\u003e Europe - Southwestern\"],\"Aizu-ALDS1_6_C\":[\"Quick Sort\",7244,null],\"ZOJ-1962\":[\"How Many Fibs?\",1424,null],\"UVA-11192\":[\"Group Reverse\",9970,null],\"POJ-1046\":[\"Color Me Less\",15794,\"\\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-2135\":[\"Farm Tour\",5158,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2003+February+Green\\\"\\u003eUSACO 2003 February Green\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3349\":[\"Snowflake\\r\\nSnow\\r\\nSnowflakes\",7717,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCCC+2007\\\"\\u003eCCC 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3469\":[\"Dual Core CPU\",4506,\"\\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-3468\":[\"A Simple Problem with Integers\",29966,\"\\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-2136\":[\"Vertical Histogram\",8754,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2003+February+Orange\\\"\\u003eUSACO 2003 February Orange\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2379\":[\"ACM Rank Table\",1280,\"\\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, Far-Eastern Subregion\\u003c/div\\u003e\"],\"UVA-10921\":[\"Find the Telephone\",13396,null],\"UVA-10800\":[\"Not That Kind of Graph\",1902,null],\"UVA-10922\":[\"2 the 9s\",7664,null],\"Kattis-numbersetseasy\":[\"Number Sets\",443,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/Google%20Code%20Jam%202008%20Round%201B\\\"\\u003eGoogle Code Jam 2008 Round 1B\\u003c/a\\u003e\"],\"UVA-10929\":[\"You can say 11\",14442,null],\"UVALive-3463\":[\"Holiday Hotel\",0,\"Regionals 2005 \\u003e\\u003e Asia - Beijing\"],\"ZOJ-1058\":[\"Currency Exchange\",1963,null],\"POJ-2141\":[\"Message Decowding\",6886,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2003+March+Orange\\\"\\u003eUSACO 2003 March Orange\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2388\":[\"Who\\u0027s in the Middle\",23842,\"\\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\"],\"POJ-3233\":[\"Matrix Power Series\",9308,\"\\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, Huang, Jinsong\\u003c/div\\u003e\"],\"POJ-2386\":[\"Lake Counting\",23836,\"\\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-1715\":[\"大菲波数\",7079,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2007%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A82%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-305\":[\"Joseph\",6242,null],\"UVA-424\":[\"Integer Inquiry\",15091,null],\"UVA-10919\":[\"Prerequisites?\",3483,null],\"UVALive-2363\":[\"I Think I Need a Houseboat\",230,\"Regionals 2001 \\u003e\\u003e North America - Mid-Atlantic USA\"],\"UVA-10916\":[\"Factstone Benchmark\",2418,null],\"ZOJ-1067\":[\"Color Me Less\",8021,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-1064\":[\"Cable master\",11120,\"\\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\"],\"UVA-300\":[\"Maya Calendar\",2976,null],\"POJ-1182\":[\"食物链\",25684,\"\\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\"],\"UVA-541\":[\"Error Correction\",13480,null],\"UVA-540\":[\"Team Queue\",12446,null],\"POJ-3686\":[\"The Windy\\u0027s\",1787,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.08.31\\\"\\u003ePOJ Founder Monthly Contest – 2008.08.31\\u003c/a\\u003e, windy7926778\\u003c/div\\u003e\"],\"POJ-2234\":[\"Matches Game\",7209,\"\\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,readchild\\u003c/div\\u003e\"],\"POJ-3684\":[\"Physics Experiment\",1396,\"\\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, Simon\\u003c/div\\u003e\"],\"POJ-3683\":[\"Priest John\\u0027s Busiest Day\",2682,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.08.31\\\"\\u003ePOJ Founder Monthly Contest – 2008.08.31\\u003c/a\\u003e, Dagger and Facer\\u003c/div\\u003e\"],\"POJ-3320\":[\"Jessica\\u0027s Reading Problem\",6840,\"\\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, Jerry\\u003c/div\\u003e\"],\"POJ-1028\":[\"Web Navigation\",15594,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dEast+Central+North+America+2001\\\"\\u003eEast Central North America 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-514\":[\"Rails\",21304,null],\"UVA-512\":[\"Spreadsheet Tracking\",2859,null],\"UVA-511\":[\"Do You Know the Way to San Jose?\",494,null],\"UVA-10905\":[\"Children\\u0027s Game\",7114,null],\"ZOJ-1078\":[\"Palindrom Numbers\",6714,null],\"UVA-10906\":[\"Strange Integration\",326,null],\"UVA-10903\":[\"Rock-Paper-Scissors Tournament\",2556,null],\"UVA-12096\":[\"The SetStack Computer\",4855,null],\"ZOJ-1195\":[\"Blowing Fuses\",2763,null],\"UVA-993\":[\"Product of digits\",5239,null],\"UVA-630\":[\"Anagrams (II)\",1890,null],\"POJ-3691\":[\"DNA repair\",2265,\"\\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-3690\":[\"Constellations\",862,\"\\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-2121\":[\"Inglish-Number Translator\",2552,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCTU+Open+2004\\\"\\u003eCTU Open 2004\\u003c/a\\u003e,UVA 486\\u003c/div\\u003e\"],\"POJ-2484\":[\"A Funny Game\",5179,\"\\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\"],\"Aizu-1313\":[\"Intersection of Two Prisms\",329,\"ACM International Collegiate Programming Contest, Asia Regional 2010, Japan\"],\"POJ-3337\":[\"Expression Evaluator\",543,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+2006+Preliminary\\\"\\u003eTehran 2006 Preliminary\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1735\":[\"字数统计\",969,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%A1%B0%CD%F8%D0%C2%B6%F7%C6%D5%B1%AD%A1%B1%BA%BC%D6%DD%B5%E7%D7%D3%BF%C6%BC%BC%B4%F3%D1%A7%B3%CC%D0%F2%C9%E8%BC%C6%D1%FB%C7%EB%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e “网新恩普杯”杭州电子科技大学程序设计邀请赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2126\":[\"Factoring a Polynomial\",1229,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2003\\\"\\u003eNortheastern Europe 2003\\u003c/a\\u003e, Northern Subregion\\u003c/div\\u003e\"],\"UVA-409\":[\"Excuses, Excuses!\",4870,null],\"UVA-765\":[\"References\",132,null],\"UVA-402\":[\"M*A*S*H\",1493,null],\"UVALive-3594\":[\"Quicksum\",662,\"Regionals 2006 \\u003e\\u003e North America - Mid-Central USA\"],\"UVA-401\":[\"Palindromes\",24678,null],\"UVA-408\":[\"Uniform Generator\",8393,null],\"ZOJ-1089\":[\"Lotto\",4445,null],\"ZOJ-1086\":[\"Octal Fractions\",2115,null],\"UVA-400\":[\"Unix ls\",8398,null],\"UVA-642\":[\"Word Amalgamation\",3598,null],\"POJ-3461\":[\"Oulipo\",16517,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBAPC+2006+Qualification\\\"\\u003eBAPC 2006 Qualification\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1042\":[\"Gone Fishing\",11548,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dEast+Central+North+America+1999\\\"\\u003eEast Central North America 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"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\"],\"POJ-2371\":[\"Questions and answers\",4889,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUral+State+University+Internal+Contest+October%272000+Junior+Session\\\"\\u003eUral State University Internal Contest October\\u00272000 Junior Session\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2299\":[\"Ultra-QuickSort\",22355,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2005.02.05\\\"\\u003eWaterloo local 2005.02.05\\u003c/a\\u003e\\u003c/div\\u003e\"],\"ZOJ-1090\":[\"The Circumference of the Circle\",3860,null],\"Aizu-0531\":[\"Paint Color\",1455,\"7th Japanese Olympiad in Informatics\"],\"UVA-10844\":[\"Bloques\",275,null],\"UVA-10963\":[\"The Swallowing Ground\",5426,null],\"UVALive-2294\":[\"Hangover\",444,\"Regionals 2001 \\u003e\\u003e North America - Mid-Central USA\"],\"UVA-612\":[\"DNA Sorting\",7102,null],\"UVA-732\":[\"Anagrams by Stack\",2225,null],\"ZOJ-1099\":[\"HTML\",3187,null],\"POJ-2186\":[\"Popular Cows\",11730,\"\\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\"],\"ZOJ-1095\":[\"Humble Numbers\",3439,null],\"POJ-3273\":[\"Monthly Expense\",11936,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+March+Silver\\\"\\u003eUSACO 2007 March Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3279\":[\"Fliptile\",8856,\"\\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-1753\":[\"大明A+B\",5277,\"\\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-3399\":[\"Product\",655,\"\\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, Western Subregion\\u003c/div\\u003e\"],\"POJ-2187\":[\"Beauty Contest\",7363,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2003+Fall\\\"\\u003eUSACO 2003 Fall\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3276\":[\"Face The Right Way\",3399,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+March+Gold\\\"\\u003eUSACO 2007 March Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10714\":[\"Ants\",4324,null],\"UVA-509\":[\"RAID!\",884,null],\"UVA-508\":[\"Morse Mismatches\",1227,null],\"UVA-623\":[\"500!\",10198,null],\"UVA-1070\":[\"Conveyor Belt\",27,null],\"UVA-748\":[\"Exponentiation\",4202,null],\"UVA-505\":[\"Moscow time\",302,null],\"POJ-3281\":[\"Dining\",8094,\"\\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-2196\":[\"Specialized Four-Digit Numbers\",8946,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPacific+Northwest+2004\\\"\\u003ePacific Northwest 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3044\":[\"City Skyline\",1405,\"\\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\"],\"POJ-3041\":[\"Asteroids\",12956,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+November+Gold\\\"\\u003eUSACO 2005 November Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1402\":[\"A * B Problem Plus\",4623,\"\"],\"POJ-3006\":[\"Dirichlet\\u0027s Theorem on Arithmetic Progressions\",9169,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2006+Domestic\\\"\\u003eJapan 2006 Domestic\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10945\":[\"Mother bear\",11005,null],\"UVA-10703\":[\"Free spots\",4611,null],\"UVA-10942\":[\"Can of Beans\",480,null],\"UVALive-3157\":[\"Grandpa is Famous\",414,\"Regionals 2004 \\u003e\\u003e Latin America - South America\"],\"UVALive-4493\":[\"That is Your Queue\",544,\"Regionals 2009 \\u003e\\u003e Asia - Dhaka\"],\"UVA-10706\":[\"Number Sequence\",2863,null],\"UVA-713\":[\"Adding Reversed Numbers\",9695,null],\"POJ-3253\":[\"Fence Repair\",20826,\"\\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\"],\"POJ-3494\":[\"Largest Submatrix of All 1’s\",2741,\"\\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.01.31\\\"\\u003ePOJ Founder Monthly Contest – 2008.01.31\\u003c/a\\u003e, xfxyjwf\\u003c/div\\u003e\"],\"POJ-3250\":[\"Bad Hair Day\",8731,\"\\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-3255\":[\"Roadblocks\",6646,\"\\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-10935\":[\"Throwing cards away I\",18814,null],\"UVA-10931\":[\"Parity\",13787,null],\"UVA-10810\":[\"Ultra-QuickSort\",5767,null],\"UVALive-3026\":[\"Period\",1288,\"Regionals 2004 \\u003e\\u003e Europe - Southeastern\"],\"UVA-602\":[\"What Day Is It?\",1345,null],\"UVA-843\":[\"Crypt Kicker\",2935,null],\"UVA-1091\":[\"Barcodes\",269,null],\"UVA-847\":[\"A Multiplication Game\",7556,null],\"UVA-10815\":[\"Andy\\u0027s First Dictionary\",24656,null],\"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-2175\":[\"Evacuation Plan\",993,\"\\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\\u003c/div\\u003e\"],\"POJ-1084\":[\"Square Destroyer\",1959,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTaejon+2001\\\"\\u003eTaejon 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3069\":[\"Saruman\\u0027s Army\",10264,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dStanford+Local+2006\\\"\\u003eStanford Local 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-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\"],\"HDU-1427\":[\"速算24点\",1426,\"\\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\"],\"UVA-10523\":[\"Very Easy !!!\",4594,null],\"UVA-10644\":[\"Floor Tiles\",170,null],\"UVA-11734\":[\"Big Number of Teams will Solve This\",4065,null],\"UVA-10763\":[\"Foreign Exchange\",8410,null],\"ZOJ-1209\":[\"April Fool\\u0027s Joke\",175,null],\"UVA-138\":[\"Street Numbers\",8146,null],\"ZOJ-1210\":[\"Reciprocals\",409,null],\"ZOJ-1212\":[\"Mountain Landscape\",203,null],\"UVA-253\":[\"Cube painting\",7292,null],\"UVA-495\":[\"Fibonacci Freeze\",12033,null],\"UVA-494\":[\"Kindergarten Counting Game\",29351,null],\"UVA-130\":[\"Roman Roulette\",3320,null],\"POJ-3076\":[\"Sudoku\",1410,\"\\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\"],\"UVA-136\":[\"Ugly Numbers\",31814,null],\"UVA-256\":[\"Quirksome Squares\",9884,null],\"POJ-3074\":[\"Sudoku\",2485,\"\\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-133\":[\"The Dole Queue\",11370,null],\"HDU-1316\":[\"How Many Fibs?\",2874,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUniversity+of+Ulm+Local+Contest+2000\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Ulm Local Contest 2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"SPOJ-ACODE\":[\"Alphacode\",22864,\"ACM East Central North America Regional Programming Contest 2004\"],\"UVA-392\":[\"Polynomial Showdown\",4533,null],\"UVA-150\":[\"Double Time\",584,null],\"HDU-1438\":[\"钥匙计数之一\",960,\"\"],\"Aizu-ALDS1_1_A\":[\"Insertion Sort\",29097,null],\"UVA-10879\":[\"Code Refactoring\",4156,null],\"UVA-10878\":[\"Decode the tape\",6713,null],\"UVA-10515\":[\"Powers Et Al.\",3533,null],\"ZOJ-1105\":[\"FatMouse\\u0027s Tour\",505,null],\"UVA-382\":[\"Perfection\",18594,null],\"UVA-386\":[\"Perfect Cubes\",6380,null],\"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-1207\":[\"汉诺塔II\",6047,\"\\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-1209\":[\"Clock\",1966,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+2003%A3%A8Seoul%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 2003(Seoul) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"SPOJ-ADDREV\":[\"Adding Reversed Numbers\",78950,\"ACM Central European Programming Contest, Prague 1998\"],\"UVA-11716\":[\"Digital Fortress\",5235,null],\"HDU-1563\":[\"Find your present!\",3382,\"\\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\"],\"UVA-10862\":[\"Connect the Cable Wires\",1570,null],\"SPOJ-GCJ1C09C\":[\"Bribe the Prisoners\",579,\"Google Codejam 2009, Round 1C, Problem C\"],\"ZOJ-1115\":[\"Digital Roots\",11079,null],\"POJ-2082\":[\"Terrible Sets\",2361,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dShanghai+2004+Preliminary\\\"\\u003eShanghai 2004 Preliminary\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-230\":[\"Borrowers\",3333,null],\"POJ-2080\":[\"Calendar\",4855,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dShanghai+2004+Preliminary\\\"\\u003eShanghai 2004 Preliminary\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10970\":[\"Big Chocolate\",18979,null],\"POJ-3057\":[\"Evacuation\",1003,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dThe+2006+Benelux+Algorithm+Programming+Contest\\\"\\u003eThe 2006 Benelux Algorithm Programming Contest\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-490\":[\"Rotating Sentences\",13084,null],\"UVA-10976\":[\"Fractions Again?!\",11311,null],\"UVA-11945\":[\"Financial Management\",1394,null],\"HDU-1211\":[\"RSA\",1964,\"\\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-1334\":[\"Perfect Cubes\",2260,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Central+USA+1995\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central USA 1995 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10851\":[\"2D Hieroglyphs decoder\",1368,null],\"UVA-489\":[\"Hangman Judge\",15008,null],\"ZOJ-1244\":[\"Definite Values\",1552,null],\"ZOJ-1122\":[\"Clock\",627,null],\"ZOJ-1243\":[\"URLs\",2471,null],\"UVALive-3195\":[\"Zipper\",210,\"Regionals 2004 \\u003e\\u003e North America - North Central NA\"],\"UVA-484\":[\"The Department of Redundancy Department\",14387,null],\"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\"],\"UVA-121\":[\"Pipe Fitters\",3072,null],\"UVA-120\":[\"Stacks of Flapjacks\",13528,null],\"UVA-483\":[\"Word Scramble\",18809,null],\"HRBUST-1754\":[\"Minimum Scalar Product\",103,\"\"],\"ZOJ-1241\":[\"Geometry Made Simple\",7439,null],\"UVA-488\":[\"Triangle Wave\",20362,null],\"UVA-246\":[\"10-20-30\",1172,null],\"UVA-486\":[\"English-Number Translator\",2190,null],\"POJ-3185\":[\"The Water Bowls\",2683,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+January+Bronze\\\"\\u003eUSACO 2006 January Bronze\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10443\":[\"Rock, Scissors, Paper\",2514,null],\"HDU-1349\":[\"Fold-up Patterns\",2,\"\\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-1106\":[\"排序\",20524,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dPOJ\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e POJ \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1108\":[\"最小公倍数\",39896,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dPOJ\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e POJ \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10327\":[\"Flip Sort\",16620,null],\"HDU-1340\":[\"Cog-Wheels\",0,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dNorthwestern+Europe+2001\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Northwestern Europe 2001 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1582\":[\"AC Again\",214,\"\\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\"],\"UVA-12504\":[\"Updating a Dictionary\",2684,null],\"UVA-10205\":[\"Stack \\u0027em Up\",4458,null],\"HDU-2673\":[\"shǎ崽 OrOrOrOrz\",3985,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU%C5%AE%C9%FA%D7%A8%B3%A1%B9%AB%BF%AA%C8%FC%A1%AA%A1%AA%CB%AD%CB%B5%C5%AE%D7%D3%B2%BB%C8%E7%C4%D0\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU女生专场公开赛——谁说女子不如男 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10202\":[\"Pairsumonious Numbers\",1345,null],\"UVA-10323\":[\"Factorial! You Must be Kidding!!!\",9271,null],\"HDU-3400\":[\"Line belt\",1599,\"\\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\"],\"HDU-1223\":[\"Order Count\",429,\"\\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-1344\":[\"Nonst\",70,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dNorth+Central+North+America+1997\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e North Central North America 1997 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-458\":[\"The Decoder\",32844,null],\"ZOJ-1139\":[\"Rectangles\",1208,null],\"UVA-213\":[\"Message Decoding\",5050,null],\"UVA-697\":[\"Jack and Jill\",298,null],\"UVA-212\":[\"Use of Hospital Facilities\",377,null],\"HDU-1237\":[\"简单计算器\",10882,\"\\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\"],\"UVA-10310\":[\"Dog and Gopher\",4522,null],\"HDU-1236\":[\"排名\",9939,\"\\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-2005%C4%EA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙大计算机研究生复试上机考试-2005年 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1359\":[\"As the Crow Flies\",9,\"\"],\"UVA-10672\":[\"Marbles on a tree\",1017,null],\"Kattis-numbers2\":[\"Numbers\",106,\"\"],\"HDU-1470\":[\"Island of Logic\",62,\"\\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\"],\"HDU-1593\":[\"find a way to escape\",1024,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-Spring+Programming+Contest+-+Warm+Up+%A3%A81%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-Spring Programming Contest - Warm Up (1) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1351\":[\"Leaky Cryptography\",32,\"\"],\"HDU-1354\":[\"Choose Your Own Adventure\",72,\"\"],\"UVA-10315\":[\"Poker Hands\",3920,null],\"HDU-1356\":[\"The Balance\",284,\"\"],\"UVA-105\":[\"The Skyline Problem\",11315,null],\"UVALive-3094\":[\"Boolean Expressions\",160,\"Regionals 2004 \\u003e\\u003e Latin America - Mexico and Central America\"],\"UVA-220\":[\"Othello\",2170,null],\"UVA-103\":[\"Stacking Boxes\",8040,null],\"UVA-102\":[\"Ecological Bin Packing\",28994,null],\"UVA-344\":[\"Roman Digititis\",7299,null],\"UVA-101\":[\"The Blocks Problem\",22943,null],\"UVA-100\":[\"The 3n + 1 problem\",113757,null],\"Aizu-2308\":[\"White Bird\",539,\"ACM-ICPC Japan Alumni Group Summer Camp 2011 Day 3\"],\"UVA-221\":[\"Urban Elevations\",1954,null],\"HDU-1369\":[\"Erdos Numbers\",38,\"\\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-1368\":[\"University Entrance Examination\",38,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2001+Asia+Regional+Teheran\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2001 Asia Regional Teheran \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10300\":[\"Ecological Premium\",31331,null],\"UVA-11991\":[\"Easy Problem from Rujia Liu?\",8977,null],\"HDU-1007\":[\"Quoit Design\",11819,\"\\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-1009\":[\"FatMouse\\u0027 Trade\",31601,\"\\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-2570\":[\"迷瘴\",5859,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM%B3%CC%D0%F2%C9%E8%BC%C6%C6%DA%C4%A9%BF%BC%CA%D4081230\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM程序设计期末考试081230 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1363\":[\"Deformed Wheel\",5,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2001+Asia+Regional+Teheran\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2001 Asia Regional Teheran \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10305\":[\"Ordering Tasks\",23267,null],\"UVA-10789\":[\"Prime Frequency\",6958,null],\"HDU-1362\":[\"The Bermuda Triangle\",100,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2001+Asia+Regional+Teheran\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2001 Asia Regional Teheran \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1120\":[\"The Bulk\",6,\"\\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-1002\":[\"A + B Problem II\",76426,\"\"],\"HDU-1365\":[\"Puzzle Out\",26,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2001+Asia+Regional+Teheran\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2001 Asia Regional Teheran \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1123\":[\"Complicated Expressions\",160,\"\\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-1364\":[\"Illusive Chase\",173,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2001+Asia+Regional+Teheran\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2001 Asia Regional Teheran \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1122\":[\"Direct Visibility\",15,\"\\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-1367\":[\"Parallel Expectations\",16,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2001+Asia+Regional+Teheran\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2001 Asia Regional Teheran \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-11995\":[\"I Can Guess the Data Structure!\",12374,null],\"HDU-1246\":[\"自共轭Ferrers图\",584,\"\"],\"HDU-1366\":[\"The Willy Memorial Program\",44,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2001+Asia+Regional+Teheran\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2001 Asia Regional Teheran \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1037\":[\"Gridland\",9649,null],\"UVA-438\":[\"The Circumference of the Circle\",7850,null],\"ZOJ-3210\":[\"A Stack or A Queue?\",6216,null],\"ZOJ-1152\":[\"A Mathematical Curiosity\",3783,null],\"UVA-671\":[\"Spell checker\",650,null],\"ZOJ-1151\":[\"Word Reversal\",9001,null],\"ZOJ-1154\":[\"Niven Numbers\",2626,null],\"UVA-10894\":[\"Save Hridoy\",711,null],\"UVA-10771\":[\"Barbarian tribes\",639,null],\"HDU-1130\":[\"How Many Trees?\",2257,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUVA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e UVA \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1131\":[\"Count the Trees\",1390,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUVA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e UVA \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1134\":[\"Game of Connections\",2679,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+2004%2C+Shanghai+%28Mainland+China%29%2C+Preliminary\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 2004, Shanghai (Mainland China), Preliminary \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1496\":[\"Equations\",2985,\"\\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-1133\":[\"Buy the Ticket\",2723,\"\"],\"HDU-1375\":[\"Chemical Reactions\",23,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dNortheastern+Europe+2001\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Northeastern Europe 2001 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1378\":[\"Formatting Text\",58,\"\\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\"],\"UVA-10896\":[\"Known Plaintext Attack\",960,null],\"HDU-1377\":[\"A Well-Formed Problem\",32,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dGreater+New+York+2000\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Greater New York 2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10775\":[\"Mystical Matrix\",114,null],\"ZOJ-1049\":[\"I Think I Need a Houseboat\",10783,null],\"UVA-688\":[\"Mobile Phone Coverage\",820,null],\"UVA-445\":[\"Marvelous Mazes\",11804,null],\"ZOJ-1045\":[\"HangOver\",13361,null],\"ZOJ-1168\":[\"Function Run Fun\",2769,null],\"UVA-207\":[\"PGA Tour Prize Money\",625,null],\"ZOJ-1164\":[\"Software CRC\",389,null],\"UVA-444\":[\"Encoder and Decoder\",5852,null],\"UVA-201\":[\"Squares\",5317,null],\"UVA-442\":[\"Matrix Chain Multiplication\",9289,null],\"UVA-200\":[\"Rare Order\",7300,null],\"HDU-1149\":[\"Structural Equivalence\",12,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUniversity+of+Waterloo+Local+Contest+2005.09.17\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Waterloo Local Contest 2005.09.17 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10245\":[\"The Closest Pair Problem\",5381,null],\"UVA-10363\":[\"Tic Tac Toe\",3424,null],\"HDU-1029\":[\"Ignatius and the Princess IV\",21642,\"\"],\"POJ-1840\":[\"Eqs\",5411,\"\\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-1383\":[\"Company\",4,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSoutheastern+Europe+2000\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Southeastern Europe 2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-1544\":[\"Simple Arithmetics\",28,null],\"POJ-2932\":[\"Coneology\",822,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dMIT+Programming+Contest+2005\\\"\\u003eMIT Programming Contest 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1143\":[\"Tri Tiling\",2920,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUniversity+of+Waterloo+Local+Contest+2005.09.24\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Waterloo Local Contest 2005.09.24 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10008\":[\"What\\u0027s Cryptanalysis?\",17723,null],\"UVA-10006\":[\"Carmichael Numbers\",10929,null],\"UVA-10127\":[\"Ones\",13313,null],\"HDU-1023\":[\"Train Problem II\",6530,\"\"],\"UVA-10007\":[\"Count the Trees\",2899,null],\"HDU-1386\":[\"Elevator Simulation\",6,\"\\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\"],\"UVA-10249\":[\"The Grand Dinner\",2923,null],\"HDU-1265\":[\"Floating Point Presentation\",414,\"\\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-1268\":[\"积木堆砌的城堡\",146,\"\\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-1389\":[\"Markov Trains\",2,\"\\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-1267\":[\"下沙的沙子有几粒?\",2529,\"\\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-1381\":[\"Crazy Search\",967,\"\"],\"UVA-12412\":[\"A Typical Homework (a.k.a Shi Xiong Bang Bang Mang)\",1519,null],\"Aizu-ALDS1_5_B\":[\"Merge Sort\",12281,null],\"HDU-3337\":[\"Guess the number\",395,\"\\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\"],\"UVA-10473\":[\"Simple Base Conversion\",6331,null],\"UVA-10474\":[\"Where is the Marble?\",27241,null],\"POJ-1852\":[\"Ants\",12046,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2004.09.19\\\"\\u003eWaterloo local 2004.09.19\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1030\":[\"Delta-wave\",4848,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUral+Collegiate+Programming+Contest+1998\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Ural Collegiate Programming Contest 1998 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2823\":[\"Sliding Window\",15428,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.04.28\\\"\\u003ePOJ Monthly--2006.04.28\\u003c/a\\u003e, Ikki\\u003c/div\\u003e\"],\"HDU-1277\":[\"全文检索\",710,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VI%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VI) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10116\":[\"Robot Motion\",4348,null],\"Aizu-ALDS1_5_D\":[\"The Number of Inversions\",5310,null],\"HDU-1391\":[\"Number Steps\",4069,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+2000%2C+Tehran+%28Iran%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 2000, Tehran (Iran) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1270\":[\"小希的数表\",494,\"\\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\"],\"UVA-10222\":[\"Decode the Mad man\",12743,null],\"UVA-10586\":[\"Polynomial Remains\",823,null],\"UVA-10220\":[\"I Love Big Numbers !\",7093,null],\"UVA-10221\":[\"Satellites\",5408,null],\"HDU-1042\":[\"N!\",21903,\"\"],\"HDU-1041\":[\"Computer Transformation\",3617,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSoutheastern+Europe+2005\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Southeastern Europe 2005 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10105\":[\"Polynomial Coefficients\",4212,null],\"UVA-10226\":[\"Hardwood Species\",11277,null],\"HDU-1287\":[\"破译密码\",2838,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VII%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VII) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1704\":[\"Georgia and Bob\",4834,\"\\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\"],\"HDU-1047\":[\"Integer Inquiry\",6856,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dEast+Central+North+America+1996\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e East Central North America 1996 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10346\":[\"Peter\\u0027s Smokes\",21649,null],\"HDU-1289\":[\"Hat’s IEEE\",265,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VII%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VII) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2918\":[\"Tudoku\",1418,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTUD+Programming+Contest+2006\\\"\\u003eTUD Programming Contest 2006\\u003c/a\\u003e, Darmstadt, Germany\\u003c/div\\u003e\"],\"HDU-1280\":[\"前m大的数\",7375,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VI%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VI) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2962\":[\"Stack By Stack\",73,null],\"HDU-1040\":[\"As Easy As A+B\",32710,\"\"],\"UVA-196\":[\"Spreadsheet\",2054,null],\"UVA-10696\":[\"f91\",22264,null],\"UVA-1339\":[\"Ancient Cipher\",7566,null],\"HDU-1052\":[\"Tian Ji -- The Horse Racing\",10028,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2004+Asia+Regional+Shanghai+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2004 Asia Regional Shanghai \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1297\":[\"Children’s Queue\",4522,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VIII%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VIII) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1833\":[\"排列\",7077,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dqinlu%40POJ\\\"\\u003eqinlu@POJ\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10579\":[\"Fibonacci Numbers\",5869,null],\"UVA-10698\":[\"Football Sort\",671,null],\"ZOJ-1403\":[\"Safecracker\",1422,null],\"HDU-1291\":[\"Closing Ceremony of Sunny Cup\",82,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VIII%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VIII) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1172\":[\"猜数字\",4184,\"\"],\"HDU-1051\":[\"Wooden Sticks\",9467,\"\\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-1293\":[\"The Number of Paths\",413,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VIII%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VIII) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1292\":[\"\\\"下沙野骆驼\\\"ACM夏令营\",811,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VIII%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VIII) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-1210\":[\"Sum of Consecutive Prime Numbers\",3774,null],\"UVA-10044\":[\"Erdos Numbers\",3353,null],\"UVALive-2724\":[\"Eurodiffusion\",253,\"World Finals \\u003e\\u003e 2003 - Beverly Hills\"],\"UVA-12100\":[\"Printer Queue\",6711,null],\"UVA-11495\":[\"Bubbles and Buckets\",2687,null],\"UVA-10282\":[\"Babelfish\",11088,null],\"UVA-10041\":[\"Vito\\u0027s Family\",23182,null],\"POJ-1405\":[\"Heritage\",2055,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dural+1108\\\"\\u003eural 1108\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1063\":[\"Exponentiation\",3276,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dEast+Central+North+America+1988\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e East Central North America 1988 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1769\":[\"Minimizing maximizer\",1759,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCentral+Europe+2003\\\"\\u003eCentral Europe 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVALive-2722\":[\"Light Bulbs\",362,\"World Finals \\u003e\\u003e 2003 - Beverly Hills\"],\"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\"],\"UVA-12108\":[\"Extraordinarily Tired Students\",2307,null],\"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-1183\":[\"Not magic,but logic.\",5,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dGardon-DYGG+Contest+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Gardon-DYGG Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1061\":[\"Rightmost Digit\",26548,\"\"],\"UVA-10050\":[\"Hartals\",18793,null],\"UVA-299\":[\"Train Swapping\",30019,null],\"UVA-10035\":[\"Primary Arithmetic\",30459,null],\"UVA-10033\":[\"Interpreter\",5335,null],\"UVA-12333\":[\"Revenge of Fibonacci\",798,null],\"UVA-10152\":[\"ShellSort\",5334,null],\"UVA-11241\":[\"Humidex\",572,null],\"UVALive-2832\":[\"A Contesting Decision\",307,\"Regionals 2003 \\u003e\\u003e North America - Mid-Atlantic USA\"],\"UVA-10037\":[\"Bridge\",4376,null],\"UVA-10279\":[\"Mine Sweeper\",2554,null],\"UVA-10038\":[\"Jolly Jumpers\",41364,null],\"SPOJ-HANGOVER\":[\"Hangover\",17850,\"ACM Mid Central Regionals 2001\"],\"UVA-10267\":[\"Graphical Editor\",4758,null],\"UVA-10020\":[\"Minimal coverage\",4612,null],\"UVA-10142\":[\"Australian Voting\",4734,null],\"UVA-10260\":[\"Soundex\",9572,null],\"POJ-1741\":[\"Tree\",6887,\"\\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\"],\"TopCoder-7585\":[\"ChangingString\",1,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10665\\u0026amp;pm\\u003d7585\\\"\\u003eSingle Round Match 341 Round 1 - Division II, Level One\\u003c/a\\u003e\"],\"UVA-10149\":[\"Yahtzee\",1134,null],\"UVA-10026\":[\"Shoemaker\\u0027s Problem\",9013,null],\"UVA-10391\":[\"Compound Words\",6419,null],\"UVA-272\":[\"TEX Quotes\",59141,null],\"UVA-156\":[\"Ananagrams\",18474,null],\"UVA-10013\":[\"Super long sums\",7258,null],\"UVA-10132\":[\"File Fragmentation\",3355,null],\"Aizu-ALDS1_2_D\":[\"Shell Sort\",9564,null],\"Aizu-ALDS1_2_C\":[\"Stable Sort\",13366,null],\"POJ-1995\":[\"Raising Modulo Numbers\",11635,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCTU+Open+1999\\\"\\u003eCTU Open 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"Aizu-ALDS1_2_B\":[\"Selection Sort\",20443,null],\"UVA-10131\":[\"Is Bigger Smarter?\",9710,null],\"UVA-10494\":[\"If We Were a Child Again\",4635,null],\"UVA-10252\":[\"Common Permutation\",13194,null],\"Aizu-ALDS1_2_A\":[\"Bubble Sort\",24315,null],\"TopCoder-7476\":[\"CDPlayer\",1,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10667\\u0026amp;pm\\u003d7476\\\"\\u003eSingle Round Match 343 Round 1 - Division I, Level One\\u003c/a\\u003e\\n\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10667\\u0026amp;pm\\u003d7476\\\"\\u003eSingle Round Match 343 Round 1 - Division II, Level Two\\u003c/a\\u003e\"],\"UVA-10371\":[\"Time Zones\",925,null],\"Aizu-1070\":[\"FIMO sequence\",38,\"University of Aizu Programming Contest 2011 1\"],\"UVA-10138\":[\"CDVII\",1389,null],\"UVA-10018\":[\"Reverse and Add\",27379,null],\"UVA-10015\":[\"Joseph\\u0027s Cousin\",2031,null],\"UVA-10258\":[\"Contest Scoreboard\",7593,null],\"UVA-10137\":[\"The Trip\",11704,null],\"ZOJ-1205\":[\"Martian Addition\",6385,null],\"ZOJ-1200\":[\"Mining\",914,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"tigerisland45","updateTime":1552943536000,"title":"TYUT基础训练题汇","dislikeCnt":0,"content":"\nTYUT基础训练题汇\n\n**Ad Hoc**\n\nπ-Algorithmist Ad Hoc\n1. [problem:UVALive-3524] The Cow Doctor\n2. [problem:SPOJ-ADDREV] Adding Reversed Numbers\n3. [problem:SPOJ-CANDY3] Candy III\n4. [problem:SPOJ-HANGOVER] Hangover\n5. [problem:SPOJ-TEST] Life, the Universe, and Everything\n6. [problem:TopCoder-7476] CDPlayer\n7. [problem:TopCoder-7576] Chessboard\n8. [problem:TopCoder-7410] DegreesToRadians\n9. [problem:TopCoder-7504] ProblemsToSolve\n10. [problem:TopCoder-7552] EntertainingSegment\n11. [problem:UVA-10015] Joseph\u0027s Cousin\n12. [problem:UVA-10018] Reverse and Add\n13. [problem:UVA-10037] Bridge\n14. [problem:UVA-10055] Hashmat the Brave Warrior\n15. [problem:UVA-10082] WERTYU\n16. [problem:UVA-10087] The Tajmahal of ++Y2k\n17. [problem:UVA-10093] An Easy Problem!\n18. [problem:UVA-10189] Minesweeper\n19. [problem:UVA-102] Ecological Bin Packing\n20. [problem:UVA-10205] Stack \u0027em Up\n21. [problem:UVA-10220] I Love Big Numbers !\n22. [problem:UVA-10221] Satellites\n23. [problem:UVA-10222] Decode the Mad man\n24. [problem:UVA-10260] Soundex\n25. [problem:UVA-10279] Mine Sweeper\n26. [problem:UVA-10300] Ecological Premium\n27. [problem:UVA-10310] Dog and Gopher\n28. [problem:UVA-10323] Factorial! You Must be Kidding!!!\n29. [problem:UVA-10346] Peter\u0027s Smokes\n30. [problem:UVA-10363] Tic Tac Toe\n31. [problem:UVA-10443] Rock, Scissors, Paper\n32. [problem:UVA-10473] Simple Base Conversion\n33. [problem:UVA-105] The Skyline Problem\n34. [problem:UVA-10644] Floor Tiles\n35. [problem:UVA-10696] f91\n36. [problem:UVA-10698] Football Sort\n37. [problem:UVA-1070] Conveyor Belt\n38. [problem:UVA-10703] Free spots\n39. [problem:UVA-10714] Ants\n40. [problem:UVA-10771] Barbarian tribes\n41. [problem:UVA-10775] Mystical Matrix\n42. [problem:UVA-10789] Prime Frequency\n43. [problem:UVA-10800] Not That Kind of Graph\n44. [problem:UVA-10851] 2D Hieroglyphs decoder\n45. [problem:UVA-10878] Decode the tape\n46. [problem:UVA-10879] Code Refactoring\n47. [problem:UVA-10894] Save Hridoy\n48. [problem:UVA-10896] Known Plaintext Attack\n49. [problem:UVA-10903] Rock-Paper-Scissors Tournament\n50. [problem:UVA-10906] Strange Integration\n51. [problem:UVA-1091] Barcodes\n52. [problem:UVA-10919] Prerequisites?\n53. [problem:UVA-10921] Find the Telephone\n54. [problem:UVA-10922] 2 the 9s\n55. [problem:UVA-10929] You can say 11\n56. [problem:UVA-10931] Parity\n57. [problem:UVA-10935] Throwing cards away I\n58. [problem:UVA-10942] Can of Beans\n59. [problem:UVA-10945] Mother bear\n60. [problem:UVA-10963] The Swallowing Ground\n61. [problem:UVA-10970] Big Chocolate\n62. [problem:UVA-10976] Fractions Again?!\n63. [problem:UVA-11192] Group Reverse\n64. [problem:UVA-121] Pipe Fitters\n65. [problem:UVA-138] Street Numbers\n66. [problem:UVA-156] Ananagrams\n67. [problem:UVA-201] Squares\n68. [problem:UVA-256] Quirksome Squares\n69. [problem:UVA-344] Roman Digititis\n70. [problem:UVA-382] Perfection\n71. [problem:UVA-386] Perfect Cubes\n72. [problem:UVA-400] Unix ls\n73. [problem:UVA-408] Uniform Generator\n74. [problem:UVA-444] Encoder and Decoder\n75. [problem:UVA-445] Marvelous Mazes\n76. [problem:UVA-458] The Decoder\n77. [problem:UVA-483] Word Scramble\n78. [problem:UVA-484] The Department of Redundancy Department\n79. [problem:UVA-488] Triangle Wave\n80. [problem:UVA-490] Rotating Sentences\n81. [problem:UVA-494] Kindergarten Counting Game\n82. [problem:UVA-697] Jack and Jill\n83. [problem:UVA-944] Happy Numbers\n84. [problem:UVA-993] Product of digits\n85. [problem:UVA-11734] Big Number of Teams will Solve This\n86. [problem:UVA-10132] File Fragmentation\n\n吴书《算法设计编程实验》 第1章 Ad Hoc\n1. [problem:UVA-10916] Factstone Benchmark\n2. [problem:UVA-10037] Bridge\n3. [problem:UVA-10038] Jolly Jumpers\n4. [problem:UVA-10714] Ants\n5. [problem:POJ-2234] Matches Game\n6. [problem:UVA-382] Perfection\n7. [problem:UVA-408] Uniform Generator\n8. [problem:UVA-10082] WERTYU\n9. [problem:UVA-10260] Soundex\n10. [problem:UVA-10279] Mine Sweeper\n11. [problem:UVA-10363] Tic Tac Toe\n12. [problem:UVA-10443] Rock, Scissors, Paper\n13. [problem:UVA-10919] Prerequisites?\n14. [problem:UVA-10894] Save Hridoy\n15. [problem:UVA-10921] Find the Telephone\n16. [problem:UVA-10922] 2 the 9s\n17. [problem:UVA-10929] You can say 11\n18. [problem:UVA-10931] Parity\n19. [problem:UVA-10800] Not That Kind of Graph\n20. [problem:UVA-10878] Decode the tape\n21. [problem:UVA-10976] Fractions Again?!\n22. [problem:UVA-10323] Factorial! You Must be Kidding!!!\n23. [problem:UVA-201] Squares\n24. [problem:UVALive-3524] The Cow Doctor\n25. [problem:UVA-11054] Wine trading in Gergovia\n26. [problem:UVA-10515] Powers Et Al.\n27. [problem:UVA-10862] Connect the Cable Wires\n\n**STL**\n\n紫书 第5章 STL入门(例题)\n1. [problem:UVA-10474] Where is the Marble?\n2. [problem:UVA-101] The Blocks Problem\n3. [problem:UVA-10815] Andy\u0027s First Dictionary\n4. [problem:UVA-156] Ananagrams\n5. [problem:UVA-12096] The SetStack Computer\n6. [problem:UVA-540] Team Queue\n7. [problem:UVA-136] Ugly Numbers\n8. [problem:UVA-400] Unix ls\n9. [problem:UVA-1592] Database\n10. [problem:UVA-207] PGA Tour Prize Money\n11. [problem:UVA-814] The Letter Carrier\u0027s Rounds\n12. [problem:UVA-221] Urban Elevations\n\n紫书 第5章 STL入门(习题)\n1. [problem:UVA-1593] Alignment of Code\n2. [problem:UVA-1594] Ducci Sequence\n3. [problem:UVA-10935] Throwing cards away I\n4. [problem:UVA-10763] Foreign Exchange\n5. [problem:UVA-10391] Compound Words\n6. [problem:UVA-1595] Symmetry\n7. [problem:UVA-12100] Printer Queue\n8. [problem:UVA-230] Borrowers\n9. [problem:UVA-1596] Bug Hunt\n10. [problem:UVA-1597] Searching the Web\n11. [problem:UVA-12504] Updating a Dictionary\n12. [problem:UVA-511] Do You Know the Way to San Jose?\n13. [problem:UVA-822] Queue and A\n14. [problem:UVA-1598] Exchange\n15. [problem:UVA-12333] Revenge of Fibonacci\n16. [problem:UVA-212] Use of Hospital Facilities\n\n《挑战编程--程序设计竞赛训练手册》 2 Data Structures\n1. [problem:UVA-10038] Jolly Jumpers\n2. [problem:UVA-10315] Poker Hands\n3. [problem:UVA-10050] Hartals\n4. [problem:UVA-843] Crypt Kicker\n5. [problem:UVA-10205] Stack \u0027em Up\n6. [problem:UVA-10044] Erdos Numbers\n7. [problem:UVA-10258] Contest Scoreboard\n8. [problem:UVA-10149] Yahtzee\n\n**排序**\n\n白书2《挑战程序设计竞赛2(算法和数据结构)》 第3章 初等排序\n1. [problem:Aizu-ALDS1_1_A] Insertion Sort\n2. [problem:Aizu-ALDS1_2_A] Bubble Sort\n3. [problem:Aizu-ALDS1_2_B] Selection Sort\n4. [problem:Aizu-ALDS1_2_C] Stable Sort\n5. [problem:Aizu-ALDS1_2_D] Shell Sort\n\n白书2《挑战程序设计竞赛2(算法和数据结构)》 第7章 高等排序\n1. [problem:Aizu-ALDS1_5_B] Merge Sort\n2. [problem:Aizu-ALDS1_6_B] Partition\n3. [problem:Aizu-ALDS1_6_C] Quick Sort\n4. [problem:Aizu-ALDS1_6_A] Counting Sort\n5. [problem:Aizu-ALDS1_5_D] The Number of Inversions\n6. [problem:Aizu-ALDS1_6_D] Minimum Cost Sort\n\nπ-Algorithmist Sorting\n1. [problem:UVALive-2724] Eurodiffusion\n2. [problem:UVALive-3527] Find the Clones\n3. [problem:SPOJ-SBANK] Sorting Bank Accounts\n4. [problem:TopCoder-7585] ChangingString\n5. [problem:TopCoder-7411] TagalogDictionary\n6. [problem:UVA-10008] What\u0027s Cryptanalysis?\n7. [problem:UVA-10020] Minimal coverage\n8. [problem:UVA-10026] Shoemaker\u0027s Problem\n9. [problem:UVA-10062] Tell me the frequencies!\n10. [problem:UVA-10131] Is Bigger Smarter?\n11. [problem:UVA-10152] ShellSort\n12. [problem:UVA-10249] The Grand Dinner\n13. [problem:UVA-103] Stacking Boxes\n14. [problem:UVA-10327] Flip Sort\n15. [problem:UVA-10698] Football Sort\n16. [problem:UVA-10810] Ultra-QuickSort\n17. [problem:UVA-10905] Children\u0027s Game\n18. [problem:UVA-11057] Exact Sum\n19. [problem:UVA-11495] Bubbles and Buckets\n20. [problem:UVA-120] Stacks of Flapjacks\n21. [problem:UVA-12049] Just Prune The List\n22. [problem:UVA-156] Ananagrams\n23. [problem:UVA-299] Train Swapping\n24. [problem:UVA-400] Unix ls\n25. [problem:UVA-612] DNA Sorting\n26. [problem:UVA-630] Anagrams (II)\n27. [problem:UVA-688] Mobile Phone Coverage\n\nπ-Algorithmist Topological sort\n1. [problem:UVA-10305] Ordering Tasks\n2. [problem:UVA-10672] Marbles on a tree\n3. [problem:UVA-196] Spreadsheet\n4. [problem:UVA-200] Rare Order\n\n吴书《数据结构编程实验》 第7章 线性表排序\n1. [problem:UVA-10226] Hardwood Species\n2. [problem:POJ-2388] Who\u0027s in the Middle\n3. [problem:POJ-2379] ACM Rank Table\n4. [problem:UVA-10327] Flip Sort\n5. [problem:UVA-10810] Ultra-QuickSort\n\n7.3 相关题库\n1. [problem:UVA-156] Ananagrams\n2. [problem:UVALive-3157] Grandpa is Famous\n3. [problem:UVA-642] Word Amalgamation\n4. [problem:POJ-2371] Questions and answers\n5. [problem:UVALive-3527] Find the Clones\n6. [problem:POJ-1002] 487-3279\n7. [problem:UVALive-3463] Holiday Hotel\n8. [problem:UVALive-5600] Train Swapping\n9. [problem:UVA-400] Unix ls\n10. [problem:UVA-10905] Children\u0027s Game\n11. [problem:UVA-612] DNA Sorting\n12. [problem:UVA-11057] Exact Sum\n13. [problem:UVA-10152] ShellSort\n14. [problem:UVA-10062] Tell me the frequencies!\n15. [problem:UVA-630] Anagrams (II)\n16. [problem:UVA-815] Flooded!\n17. [problem:UVA-10698] Football Sort\n18. [problem:POJ-2665] Trees\n\n《挑战编程--程序设计竞赛训练手册》 4 Sorting\n1. [problem:UVA-10041] Vito\u0027s Family\n2. [problem:UVA-120] Stacks of Flapjacks\n3. [problem:UVA-10037] Bridge\n4. [problem:UVA-10191] Longest Nap\n5. [problem:UVA-10026] Shoemaker\u0027s Problem\n6. [problem:UVA-10138] CDVII\n7. [problem:UVA-10152] ShellSort\n8. [problem:UVA-10194] Football (aka Soccer)\n\nHDU Sort\n1. [problem:HDU-1029] \t Ignatius and the Princess IV \t\n2. [problem:HDU-1040] \t As Easy As A+B \t\n3. [problem:HDU-1106] \t 排序 \t\n4. [problem:HDU-1209] \t Clock \t\n5. [problem:HDU-1236] \t 排名 \t\n6. [problem:HDU-1280] \t 前m大的数 \t\n7. [problem:HDU-1391] \t Number Steps \t\n8. [problem:HDU-2673] \t shǎ崽 OrOrOrOrz \n\n**基础**\n\n紫书 第4章 函数和递归(例题)\n1. [problem:UVA-1339] Ancient Cipher\n2. [problem:UVA-489] Hangman Judge\n3. [problem:UVA-133] The Dole Queue\n4. [problem:UVA-213] Message Decoding\n5. [problem:UVA-512] Spreadsheet Tracking\n6. [problem:UVA-12412] A Typical Homework (a.k.a Shi Xiong Bang Bang Mang)\n\n紫书 第4章 函数和递归(习题)\n1. [problem:UVA-1589] Xiangqi\n2. [problem:UVA-201] Squares\n3. [problem:UVA-220] Othello\n4. [problem:UVA-253] Cube painting\n5. [problem:UVA-1590] IP Networks\n6. [problem:UVA-508] Morse Mismatches\n7. [problem:UVA-509] RAID!\n8. [problem:UVA-12108] Extraordinarily Tired Students\n9. [problem:UVA-1591] Data Mining\n10. [problem:UVA-815] Flooded!\n\n《挑战编程--程序设计竞赛训练手册》 1 Getting Started\n1. [problem:UVA-100] The 3n + 1 problem\n2. [problem:UVA-10189] Minesweeper\n3. [problem:UVA-10137] The Trip\n4. [problem:UVA-706] LCD Display\n5. [problem:UVA-10267] Graphical Editor\n6. [problem:UVA-10033] Interpreter\n7. [problem:UVA-10196] Check The Check\n8. [problem:UVA-10142] Australian Voting\n\n《挑战编程--程序设计竞赛训练手册》 5 Arithmetic and Algebra\n1. [problem:UVA-10035] Primary Arithmetic\n2. [problem:UVA-10018] Reverse and Add\n3. [problem:UVA-701] The Archeologists\u0027 Dilemma\n4. [problem:UVA-10127] Ones\n5. [problem:UVA-847] A Multiplication Game\n6. [problem:UVA-10105] Polynomial Coefficients\n7. [problem:UVA-10077] The Stern-Brocot Number System\n8. [problem:UVA-10202] Pairsumonious Numbers\n\n吴书《数据结构编程实验》 第1章 简单计算\n1. [problem:UVA-11945] Financial Management\n2. [problem:UVALive-2787] Doubles\n3. [problem:UVA-1210] Sum of Consecutive Prime Numbers\n4. [problem:UVALive-2363] I Think I Need a Houseboat\n5. [problem:UVALive-2294] Hangover\n6. [problem:UVA-11241] Humidex\n\n1.5 相关题库\n1. [problem:UVALive-6929] Sums\n2. [problem:POJ-2196] Specialized Four-Digit Numbers\n3. [problem:UVALive-3594] Quicksum\n4. [problem:UVALive-2832] A Contesting Decision\n5. [problem:POJ-3006] Dirichlet\u0027s Theorem on Arithmetic Progressions\n6. [problem:UVA-438] The Circumference of the Circle\n7. [problem:POJ-2136] Vertical Histogram\n8. [problem:POJ-1338] Ugly Numbers\n9. [problem:POJ-1833] 排列\n10. [problem:UVA-10706] Number Sequence\n\n吴书《数据结构编程实验》 第4章 直接存取线性表\n1. [problem:POJ-2080] Calendar\n2. [problem:UVA-602] What Day Is It?\n3. [problem:UVA-713] Adding Reversed Numbers\n4. [problem:UVA-10523] Very Easy !!!\n5. [problem:UVA-392] Polynomial Showdown\n6. [problem:UVALive-2323] Modular Multiplication of Polynomials\n7. [problem:UVA-541] Error Correction\n8. [problem:UVA-442] Matrix Chain Multiplication\n9. [problem:UVA-272] TEX Quotes\n10. [problem:UVALive-3628] Blue Jeans\n11. [problem:POJ-3461] Oulipo\n12. [problem:UVA-11991] Easy Problem from Rujia Liu?\n13. [problem:POJ-2887] Big String\n\n4.5 相关题库\n1. [problem:POJ-3751] 时间日期格式转换\n2. [problem:UVA-505] Moscow time\n3. [problem:UVA-150] Double Time\n4. [problem:UVA-300] Maya Calendar\n5. [problem:UVA-10371] Time Zones\n6. [problem:UVA-10586] Polynomial Remains\n7. [problem:POJ-2126] Factoring a Polynomial\n8. [problem:UVA-10008] What\u0027s Cryptanalysis?\n9. [problem:POJ-1782] Run Length Encoding\n10. [problem:UVALive-3195] Zipper\n11. [problem:POJ-2408] Anagram Groups\n12. [problem:POJ-2121] Inglish-Number Translator\n13. [problem:POJ-2141] Message Decowding\n14. [problem:UVA-10252] Common Permutation\n15. [problem:UVALive-2324] Human Gene Functions\n16. [problem:UVA-401] Palindromes\n17. [problem:UVA-10298] Power Strings\n18. [problem:UVALive-3026] Period\n19. [problem:POJ-2752] Seek the Name, Seek the Fame\n20. [problem:UVA-409] Excuses, Excuses!\n21. [problem:POJ-3399] Product\n22. [problem:POJ-3337] Expression Evaluator\n23. [problem:UVA-424] Integer Inquiry\n24. [problem:UVA-10013] Super long sums\n25. [problem:UVA-748] Exponentiation\n26. [problem:UVALive-2559] Number Base Conversion\n27. [problem:UVA-10494] If We Were a Child Again\n28. [problem:UVA-1544] Simple Arithmetics\n29. [problem:UVA-10579] Fibonacci Numbers\n30. [problem:UVA-10183] How Many Fibs?\n31. [problem:POJ-1405] Heritage\n32. [problem:UVA-11716] Digital Fortress\n\n吴书《数据结构编程实验》 第5章 顺序存取线性表\n1. [problem:POJ-3750] 小孩报数问题\n2. [problem:UVA-133] The Dole Queue\n3. [problem:UVA-514] Rails\n4. [problem:UVALive-3094] Boolean Expressions\n5. [problem:ZOJ-3210] A Stack or A Queue?\n6. [problem:UVA-540] Team Queue\n7. [problem:UVA-12100] Printer Queue\n8. [problem:UVA-11995] I Can Guess the Data Structure!\n9. [problem:UVALive-4493] That is Your Queue\n10. [problem:UVA-130] Roman Roulette\n11. [problem:UVA-402] M*A*S*H\n12. [problem:UVA-305] Joseph\n13. [problem:POJ-3044] City Skyline\n14. [problem:UVA-732] Anagrams by Stack\n\n吴书《数据结构编程实验》 第6章 广义索引线性表\n1. [problem:UVA-765] References\n2. [problem:UVA-10282] Babelfish\n3. [problem:POJ-3349] Snowflake Snow Snowflakes\n4. [problem:POJ-1840] Eqs\n5. [problem:UVA-246] 10-20-30\n6. [problem:UVA-671] Spell checker\n7. [problem:ZOJ-2962] Stack By Stack\n\n赵书 第一章 编程基础\n1. [problem:ZOJ-1164] Software CRC\n2. [problem:ZOJ-1168] Function Run Fun\n3. [problem:ZOJ-1195] Blowing Fuses\n4. [problem:ZOJ-1200] Mining\n5. [problem:ZOJ-1209] April Fool\u0027s Joke\n6. [problem:ZOJ-1212] Mountain Landscape\n7. [problem:ZOJ-1241] Geometry Made Simple\n8. [problem:ZOJ-1243] URLs\n9. [problem:ZOJ-1244] Definite Values\n\n赵书2 第一章 编程基础(1-2)\n1. [problem:ZOJ-1037] Gridland\n2. [problem:ZOJ-1045] HangOver\n3. [problem:ZOJ-1049] I Think I Need a Houseboat\n4. [problem:ZOJ-1058] Currency Exchange\n5. [problem:ZOJ-1067] Color Me Less\n6. [problem:ZOJ-1078] Palindrom Numbers\n7. [problem:ZOJ-1086] Octal Fractions\n8. [problem:ZOJ-1089] Lotto\n9. [problem:ZOJ-1090] The Circumference of the Circle\n10. [problem:ZOJ-1095] Humble Numbers\n11. [problem:ZOJ-1099] HTML\n12. [problem:ZOJ-1105] FatMouse\u0027s Tour\n13. [problem:ZOJ-1115] Digital Roots\n14. [problem:ZOJ-1122] Clock\n15. [problem:ZOJ-1139] Rectangles\n16. [problem:ZOJ-1151] Word Reversal\n17. [problem:ZOJ-1152] A Mathematical Curiosity\n18. [problem:ZOJ-1154] Niven Numbers\n\n赵书 第四章 大整数 \n1. [problem:ZOJ-1205] Martian Addition\n2. [problem:ZOJ-1210] Reciprocals\n3. [problem:ZOJ-1962] How Many Fibs?\n\n余书 第1章 基础算法\n1. [problem:ZOJ-1403] Safecracker\n2. [problem:POJ-1028] Web Navigation\n\n喻书 第1章 基础算法(例题)\n1. [problem:HDU-3052] Vim\n2. [problem:UVA-10315] Poker Hands\n3. [problem:HDU-1172] 猜数字\n4. [problem:HDU-1334] Perfect Cubes\n5. [problem:HDU-1108] 最小公倍数\n6. [problem:HDU-1052] Tian Ji -- The Horse Racing\n7. [problem:HDU-1051] Wooden Sticks\n8. [problem:POJ-1042] Gone Fishing\n9. [problem:POJ-2299] Ultra-QuickSort\n10. [problem:HDU-1061] Rightmost Digit\n11. [problem:HDU-1007] Quoit Design\n12. [problem:POJ-3273] Monthly Expense\n\n喻书 第1章 基础算法(习题)\n1. [problem:HDU-5241] Friends\n2. [problem:UVA-486] English-Number Translator\n3. [problem:POJ-1046] Color Me Less\n4. [problem:POJ-1664] 放苹果\n5. [problem:HDU-2570] 迷瘴\n6. [problem:HDU-1735] 字数统计\n7. [problem:HDU-1009] FatMouse\u0027 Trade\n8. [problem:POJ-1995] Raising Modulo Numbers\n9. [problem:HDU-3400] Line belt\n\n白书 第1-2章蓄势待发--准备篇+初出毛庐--初级篇(例题)\n1. [problem:POJ-1852] Ants\n2. [problem:POJ-2386] Lake Counting\n3. [problem:POJ-3617] Best Cow Line\n4. [problem:POJ-3069] Saruman\u0027s Army\n5. [problem:POJ-3253] Fence Repair\n6. [problem:POJ-2431] Expedition\n7. [problem:POJ-1182] 食物链\n8. [problem:POJ-3255] Roadblocks\n9. [problem:POJ-3723] Conscription\n10. [problem:POJ-3169] Layout\n11. [problem:UVA-10006] Carmichael Numbers\n12. [problem:HRBUST-1754] Minimum Scalar Product\n13. [problem:SPOJ-HAROWS] A - Crazy Rows\n14. [problem:SPOJ-GCJ1C09C] Bribe the Prisoners\n\n白书 第3章出类拔萃--中级篇(例题)\n1. [problem:POJ-1064] Cable master\n2. [problem:POJ-2456] Aggressive cows\n3. [problem:POJ-3061] Subsequence\n4. [problem:POJ-3320] Jessica\u0027s Reading Problem\n5. [problem:POJ-3276] Face The Right Way\n6. [problem:POJ-3279] Fliptile\n7. [problem:POJ-3684] Physics Experiment\n8. [problem:POJ-2785] 4 Values whose Sum is 0\n9. [problem:POJ-2991] Crane\n10. [problem:POJ-3468] A Simple Problem with Integers\n11. [problem:POJ-2104] K-th Number\n12. [problem:POJ-2686] Traveling by Stagecoach\n13. [problem:POJ-3734] Blocks\n14. [problem:POJ-3233] Matrix Power Series\n15. [problem:POJ-1769] Minimizing maximizer\n16. [problem:POJ-3041] Asteroids\n17. [problem:POJ-3057] Evacuation\n18. [problem:POJ-3281] Dining\n19. [problem:POJ-3469] Dual Core CPU\n20. [problem:POJ-2135] Farm Tour\n21. [problem:POJ-2175] Evacuation Plan\n22. [problem:POJ-3686] The Windy\u0027s\n23. [problem:POJ-3680] Intervals\n24. [problem:POJ-1127] Jack Straws\n25. [problem:Aizu-2308] White Bird\n26. [problem:POJ-2932] Coneology\n27. [problem:POJ-2187] Beauty Contest\n28. [problem:Aizu-1313] Intersection of Two Prisms\n29. [problem:Kattis-numbers2] Numbers\n30. [problem:Kattis-numbersetseasy] Number Sets\n\n白书 3.2常用技巧一(练习题)\n1. [problem:POJ-2566] Bound Found\n2. [problem:POJ-2739] Sum of Consecutive Prime Numbers\n3. [problem:POJ-2100] Graveyard Design\n4. [problem:POJ-3185] The Water Bowls\n5. [problem:POJ-1222] EXTENDED LIGHTS OUT\n6. [problem:POJ-2674] Linear world\n7. [problem:POJ-3977] Subset\n8. [problem:POJ-2549] Sumsets\n9. [problem:Aizu-0531] Paint Color\n\n白书 第4章登峰造极--高级篇(例题)\n1. [problem:POJ-2484] A Funny Game\n2. [problem:POJ-2348] Euclid\u0027s Game\n3. [problem:POJ-1704] Georgia and Bob\n4. [problem:POJ-2311] Cutting Game\n5. [problem:POJ-2186] Popular Cows\n6. [problem:POJ-3683] Priest John\u0027s Busiest Day\n7. [problem:POJ-2763] Housewife Wind\n8. [problem:POJ-2559] Largest Rectangle in a Histogram\n9. [problem:POJ-3709] K-Anonymous Sequence\n10. [problem:POJ-2676] Sudoku\n11. [problem:POJ-2918] Tudoku\n12. [problem:POJ-3074] Sudoku\n13. [problem:POJ-3076] Sudoku\n14. [problem:POJ-1084] Square Destroyer\n15. [problem:POJ-1741] Tree\n16. [problem:UVA-10245] The Closest Pair Problem\n17. [problem:POJ-3691] DNA repair\n18. [problem:POJ-3690] Constellations\n19. [problem:POJ-3581] Sequence\n20. [problem:POJ-2217] Secretary\n21. [problem:SPOJ-IE4] Endless Knight\n\n白书 4.4常用技巧二(练习题)\n1. [problem:POJ-3250] Bad Hair Day\n2. [problem:POJ-2082] Terrible Sets\n3. [problem:POJ-3494] Largest Submatrix of All 1’s\n4. [problem:POJ-2823] Sliding Window\n5. [problem:POJ-3260] The Fewest Coins\n6. [problem:POJ-1180] Batch Scheduling\n7. [problem:Aizu-1070] FIMO sequence\n\nπ-Algorithmist BigNum\n1. [problem:UVALive-2722] Light Bulbs\n2. [problem:SPOJ-FCTRL2] Small factorials\n3. [problem:UVA-10007] Count the Trees\n4. [problem:UVA-10013] Super long sums\n5. [problem:UVA-10116] Robot Motion\n6. [problem:UVA-10183] How Many Fibs?\n7. [problem:UVA-10220] I Love Big Numbers !\n8. [problem:UVA-10494] If We Were a Child Again\n9. [problem:UVA-10523] Very Easy !!!\n10. [problem:UVA-10579] Fibonacci Numbers\n11. [problem:UVA-10844] Bloques\n12. [problem:UVA-424] Integer Inquiry\n13. [problem:UVA-495] Fibonacci Freeze\n14. [problem:UVA-623] 500!\n15. [problem:UVA-713] Adding Reversed Numbers\n\nπ-Algorithmist Cryptography\n1. [problem:SPOJ-ACODE] Alphacode\n2. [problem:TopCoder-7625] SimpleRotationDecoder\n3. [problem:UVA-10851] 2D Hieroglyphs decoder\n4. [problem:UVA-10878] Decode the tape\n5. [problem:UVA-10896] Known Plaintext Attack\n6. [problem:UVA-444] Encoder and Decoder\n\nHDU BigNums\n1. [problem:HDU-1002] \t A + B Problem II \t\n2. [problem:HDU-1042] \t N! \t\n3. [problem:HDU-1047] \t Integer Inquiry \t\n4. [problem:HDU-1063] \t Exponentiation \t\n5. [problem:HDU-1316] \t How Many Fibs? \t\n6. [problem:HDU-1715] \t 大菲波数 \t\n7. [problem:HDU-1753] \t 大明A+B \t\n\nHDU Hash\n1. [problem:HDU-1381] \t Crazy Search \t\n2. [problem:HDU-1423] \t Greatest Common Increasing Subsequence \t\n3. [problem:HDU-1496] \t Equations \t\n\nHDU Non-Mainstream\n1. [problem:HDU-1007] \t Quoit Design \t\n2. [problem:HDU-1123] \t Complicated Expressions \t\n3. [problem:HDU-1149] \t Structural Equivalence \t\n4. [problem:HDU-1172] \t 猜数字 \t\n5. [problem:HDU-1183] \t Not magic,but logic. \t\n6. [problem:HDU-1211] \t RSA \t\n7. [problem:HDU-1237] \t 简单计算器 \t\n8. [problem:HDU-1265] \t Floating Point Presentation \t\n9. [problem:HDU-1268] \t 积木堆砌的城堡 \t\n10. [problem:HDU-1270] \t 小希的数表 \t\n11. [problem:HDU-1277] \t 全文检索 \t\n12. [problem:HDU-1287] \t 破译密码 \t\n13. [problem:HDU-1289] \t Hat’s IEEE \t\n14. [problem:HDU-1356] \t The Balance \t\n15. [problem:HDU-1375] \t Chemical Reactions \t\n16. [problem:HDU-1402] \t A * B Problem Plus \t\n17. [problem:HDU-1427] \t 速算24点 \t\n18. [problem:HDU-1470] \t Island of Logic \t\n19. [problem:HDU-1563] \t Find your present! \t\n20. [problem:HDU-1582] \t AC Again \t\n21. [problem:HDU-1593] \t find a way to escape \t\n22. [problem:HDU-3337] \t Guess the number \n\nHDU Deduce\n1. [problem:HDU-1023] \t Train Problem II \t\n2. [problem:HDU-1030] \t Delta-wave \t\n3. [problem:HDU-1041] \t Computer Transformation \t\n4. [problem:HDU-1130] \t How Many Trees? \t\n5. [problem:HDU-1131] \t Count the Trees \t\n6. [problem:HDU-1133] \t Buy the Ticket \t\n7. [problem:HDU-1134] \t Game of Connections \t\n8. [problem:HDU-1143] \t Tri Tiling \t\n9. [problem:HDU-1207] \t 汉诺塔II \t\n10. [problem:HDU-1223] \t Order Count \t\n11. [problem:HDU-1246] \t 自共轭Ferrers图 \t\n12. [problem:HDU-1267] \t 下沙的沙子有几粒? \t\n13. [problem:HDU-1291] \t Closing Ceremony of Sunny Cup \t\n14. [problem:HDU-1292] \t \"下沙野骆驼\"ACM夏令营 \t\n15. [problem:HDU-1293] \t The Number of Paths \t\n16. [problem:HDU-1297] \t Children’s Queue \t\n17. [problem:HDU-1438] \t 钥匙计数之一 \n\nHDU Oh My God(who can solve these problems?)\n1. [problem:HDU-1120] \t The Bulk \t\n2. [problem:HDU-1122] \t Direct Visibility \t\n3. [problem:HDU-1340] \t Cog-Wheels \t\n4. [problem:HDU-1344] \t Nonst \t\n5. [problem:HDU-1349] \t Fold-up Patterns \t\n6. [problem:HDU-1351] \t Leaky Cryptography \t\n7. [problem:HDU-1354] \t Choose Your Own Adventure \t\n8. [problem:HDU-1359] \t As the Crow Flies \t\n9. [problem:HDU-1362] \t The Bermuda Triangle \t\n10. [problem:HDU-1363] \t Deformed Wheel \t\n11. [problem:HDU-1364] \t Illusive Chase \t\n12. [problem:HDU-1365] \t Puzzle Out \t\n13. [problem:HDU-1366] \t The Willy Memorial Program \t\n14. [problem:HDU-1367] \t Parallel Expectations \t\n15. [problem:HDU-1368] \t University Entrance Examination \t\n16. [problem:HDU-1369] \t Erdos Numbers \t\n17. [problem:HDU-1377] \t A Well-Formed Problem \t\n18. [problem:HDU-1378] \t Formatting Text \t\n19. [problem:HDU-1383] \t Company \t\n20. [problem:HDU-1386] \t Elevator Simulation \t\n21. [problem:HDU-1389] \t Markov Trains ","threadId":39795,"likeCnt":0,"createTime":1543275438000,"isWorkbook":true,"viewCnt":2225,"openness":1,"fav":false,"id":744,"trustable":false}