Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"POJ-1166\":[\"The Clocks\",6191,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dIOI+1994\\\"\\u003eIOI 1994\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2653\":[\"Pick-up sticks\",4662,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2005.09.17\\\"\\u003eWaterloo local 2005.09.17\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1686\":[\"Lazy Math Instructor\",1104,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+2000\\\"\\u003eTehran 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1308\":[\"What Day Is It?\",806,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dPacific+Northwest+1997\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Pacific Northwest 1997 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2352\":[\"Verdis Quo\",1204,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2008%26%23039%3B8+%B9%AB%BF%AA%C8%FC%A3%A8%B7%C7%D4%AD%B4%B4%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2008\\u00278 公开赛(非原创) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3904\":[\"Sky Code\",1391,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+European+Regional+Programming+Contest+2008\\\"\\u003eSoutheastern European Regional Programming Contest 2008\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3070\":[\"Fibonacci\",15401,\"\\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\"],\"ZOJ-1450\":[\"Minimal Circle\",1771,null],\"POJ-1050\":[\"To the Max\",26028,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dGreater+New+York+2001\\\"\\u003eGreater New York 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1177\":[\"Picture\",5090,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dIOI+1998\\\"\\u003eIOI 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1056\":[\"IMMEDIATE DECODABILITY\",6459,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPacific+Northwest+1998\\\"\\u003ePacific Northwest 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"OpenJ_Bailian-2980\":[\"大整数乘法\",5016,\"程序设计实习2007\"],\"POJ-2942\":[\"Knights of the Round Table\",2917,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCentral+Europe+2005\\\"\\u003eCentral Europe 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1699\":[\"Best Sequence\",3238,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2004.07.18\\\"\\u003ePOJ Monthly--2004.07.18\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3239\":[\"Solution to the n Queens Puzzle\",1427,\"\\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, Yao, Jinyu\\u003c/div\\u003e\"],\"POJ-1458\":[\"Common Subsequence\",26861,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2003\\\"\\u003eSoutheastern Europe 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"URAL-1099\":[\"Work Scheduling\",1346,\"\"],\"UVA-948\":[\"Fibonaccimal Base\",4361,null],\"OpenJ_Bailian-2981\":[\"大整数加法\",5443,\"程序设计实习2007\"],\"SPOJ-QMAX3VN\":[\"Giá tr\\u0026#7883; l\\u0026#7899;n nh\\u0026#7845;t 3\",440,\"Sưu tầm\"],\"POJ-3241\":[\"Object Clustering\",613,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.08.05\\\"\\u003ePOJ Monthly--2007.08.05\\u003c/a\\u003e, Li, Haoyuan\\u003c/div\\u003e\"],\"POJ-2395\":[\"Out of Hay\",6532,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+March+Silver\\\"\\u003eUSACO 2005 March Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1265\":[\"Area\",2866,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNorthwestern+Europe+2001\\\"\\u003eNorthwestern Europe 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1144\":[\"Network\",6333,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCentral+Europe+1996\\\"\\u003eCentral Europe 1996\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2138\":[\"How many prime numbers\",8118,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-11++Programming+Contest_WarmUp\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-11 Programming Contest_WarmUp \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2352\":[\"Stars\",17292,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUral+Collegiate+Programming+Contest+1999\\\"\\u003eUral Collegiate Programming Contest 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1142\":[\"Smith Numbers\",3824,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dMid-Central+European+Regional+Contest+2000\\\"\\u003eMid-Central European Regional Contest 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1021\":[\"2D-Nim\",1771,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+2002\\\"\\u003eTehran 2002\\u003c/a\\u003e, First Iran Nationwide Internet Programming Contest\\u003c/div\\u003e\"],\"POJ-1385\":[\"Lifting the Stone\",959,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCentral+Europe+1999\\\"\\u003eCentral Europe 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1264\":[\"SCUD Busters\",373,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dDuke+Internet+Programming+Contest+1991\\\"\\u003eDuke Internet Programming Contest 1991\\u003c/a\\u003e,UVA 109\\u003c/div\\u003e\"],\"POJ-2116\":[\"Death to Binary?\",809,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCTU+Open+2004\\\"\\u003eCTU Open 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1389\":[\"Area of Simple Polygons\",1477,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTaiwan+2001\\\"\\u003eTaiwan 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2115\":[\"C Looooops\",8029,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCTU+Open+2004\\\"\\u003eCTU Open 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"SPOJ-VCIRCLES\":[\"Area of circles\",379,\"IOICAMP\"],\"POJ-2914\":[\"Minimum Cut\",2731,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBaidu+Star+2006+Semifinal\\\"\\u003eBaidu Star 2006 Semifinal\\u003c/a\\u003e\\r\\u003cbr\\u003eWang, Ying (Originator)\\r\\u003cbr\\u003eChen, Shixi (Test cases)\\u003c/div\\u003e\"],\"POJ-3728\":[\"The merchant\",1558,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly+Contest+%E2%80%93+2009.04.05\\\"\\u003ePOJ Monthly Contest – 2009.04.05\\u003c/a\\u003e, GaoYihan\\u003c/div\\u003e\"],\"SPOJ-OTOCI\":[\"OTOCI\",599,\"Croatian Olympiad in Informatics 28.03.2009.\"],\"POJ-1273\":[\"Drainage Ditches\",16538,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+93\\\"\\u003eUSACO 93\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1673\":[\"EXOCENTER OF A TRIANGLE\",1161,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dGreater+New+York+2003\\\"\\u003eGreater New York 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"OpenJ_Bailian-3177\":[\"判决素数个数\",3125,\"\"],\"POJ-1830\":[\"开关问题\",3680,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dLIANGLIANG%40POJ\\\"\\u003eLIANGLIANG@POJ\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2127\":[\"Greatest Common Increasing Subsequence\",2015,\"\\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\"],\"HDU-4609\":[\"3-idiots\",2209,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+Multi-University+Training+Contest+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"SPOJ-MOD\":[\"Power Modulo Inverted\",1216,\"Folklore, description, standard program and test data by Blue Mary\"],\"POJ-2488\":[\"A Knight\\u0027s Journey\",16939,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTUD+Programming+Contest+2005\\\"\\u003eTUD Programming Contest 2005\\u003c/a\\u003e, Darmstadt, Germany\\u003c/div\\u003e\"],\"POJ-2367\":[\"Genealogical tree\",6135,\"\\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-2125\":[\"Destroying The Graph\",1705,\"\\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\"],\"URAL-1158\":[\"Censored!\",1071,\"\"],\"POJ-1279\":[\"Art Gallery\",2363,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2002\\\"\\u003eSoutheastern Europe 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-125E\":[\"MST Company\",1124,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/125\\\"\\u003eCodeforces Testing Round 2\\u003c/a\\u003e\"],\"URAL-1553\":[\"Caves and Tunnels\",1730,\"\"],\"POJ-1955\":[\"Rubik\\u0027s Cube\",309,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTUD+Programming+Contest+2002\\\"\\u003eTUD Programming Contest 2002\\u003c/a\\u003e, Darmstadt, Germany\\u003c/div\\u003e\"],\"POJ-1832\":[\"连环锁\",392,\"\\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\"],\"ZOJ-2334\":[\"Monkey King\",1950,null],\"POJ-1041\":[\"John\\u0027s trip\",2774,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCentral+Europe+1995\\\"\\u003eCentral Europe 1995\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2098\":[\"Ellipse\",67,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2004\\\"\\u003eNortheastern Europe 2004\\u003c/a\\u003e, Northern Subregion\\u003c/div\\u003e\"],\"POJ-1284\":[\"Primitive Roots\",3138,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003d%E8%B4%BE%E6%80%A1%40pku\\\"\\u003e贾怡@pku\\u003c/a\\u003e\\u003c/div\\u003e\"],\"ZOJ-1081\":[\"Points Within\",2057,null],\"POJ-3580\":[\"SuperMemo\",2377,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.04.13\\\"\\u003ePOJ Founder Monthly Contest – 2008.04.13\\u003c/a\\u003e, Yao Jinyu\\u003c/div\\u003e\"],\"POJ-2492\":[\"A Bug\\u0027s Life\",12033,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTUD+Programming+Contest+2005\\\"\\u003eTUD Programming Contest 2005\\u003c/a\\u003e, Darmstadt, Germany\\u003c/div\\u003e\"],\"POJ-2299\":[\"Ultra-QuickSort\",22353,\"\\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\"],\"POJ-3268\":[\"Silver Cow Party\",14870,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+February+Silver\\\"\\u003eUSACO 2007 February Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2451\":[\"Uyuw\\u0027s Concert\",1805,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly\\\"\\u003ePOJ Monthly\\u003c/a\\u003e,Zeyuan Zhu\\u003c/div\\u003e\"],\"POJ-3420\":[\"Quad Tiling\",1938,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.10.06\\\"\\u003ePOJ Monthly--2007.10.06\\u003c/a\\u003e, Dagger\\u003c/div\\u003e\"],\"POJ-1006\":[\"Biorhythms\",39064,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dEast+Central+North+America+1999\\\"\\u003eEast Central North America 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2031\":[\"进制转换\",43000,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d+C%D3%EF%D1%D4%B3%CC%D0%F2%C9%E8%BC%C6%C1%B7%CF%B0%A3%A8%CE%E5%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e C语言程序设计练习(五) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2977\":[\"Box walking\",522,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dStanford+Local+2005\\\"\\u003eStanford Local 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"ZOJ-2107\":[\"Quoit Design\",5947,null],\"SPOJ-BEADS\":[\"Glass Beads\",3545,\"ACM Central European Programming Contest, Prague 1998\"],\"ZOJ-1776\":[\"Study Group\",140,null],\"POJ-1808\":[\"Quadratic Residues\",511,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTUD+Programming+Contest+2003\\\"\\u003eTUD Programming Contest 2003\\u003c/a\\u003e, Darmstadt, Germany\\u003c/div\\u003e\"],\"ZOJ-1015\":[\"Fishing Net\",1636,null],\"ZOJ-1492\":[\"Maximum Clique\",1754,null],\"POJ-3391\":[\"The Bug Sensor Problem\",62,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dKaohsiung+2006\\\"\\u003eKaohsiung 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"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\"],\"POJ-1094\":[\"Sorting It All Out\",10989,\"\\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\"],\"POJ-3675\":[\"Telescope\",680,\"\\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, Updog\\u003c/div\\u003e\"],\"POJ-2069\":[\"Super Star\",1120,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2001\\\"\\u003eJapan 2001\\u003c/a\\u003e\\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\"],\"HDU-1998\":[\"奇数阶魔方\",2384,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dECJTU+2008+Spring+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ECJTU 2008 Spring Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2985\":[\"The k-th Largest Group\",1945,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.08.27\\\"\\u003ePOJ Monthly--2006.08.27\\u003c/a\\u003e, zcgzcgzcg\\u003c/div\\u003e\"],\"SPOJ-CIRU\":[\"The area of the union of circles\",627,\"https://www.spoj.pl/problems/VCIRCLES/\"],\"POJ-1259\":[\"The Picnic\",325,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNorthwestern+Europe+2002\\\"\\u003eNorthwestern Europe 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2989\":[\"All Friends\",552,\"\\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-2503\":[\"Babelfish\",17202,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2001.09.22\\\"\\u003eWaterloo local 2001.09.22\\u003c/a\\u003e\\u003c/div\\u003e\"],\"URAL-1297\":[\"Palindrome\",7424,\"\"],\"URAL-1450\":[\"Russian Pipelines\",2951,\"\"],\"HDU-3930\":[\"Broot\",225,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Multi-University+Training+Contest+10+-+Host+by+HRBEU+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Multi-University Training Contest 10 - Host by HRBEU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVALive-6875\":[\"Continued Fraction\",54,\"Regionals 2014 \\u003e\\u003e North America - East Central NA\"],\"Aizu-2309\":[\"Vector Compression\",192,\"ACM-ICPC Japan Alumni Group Summer Camp 2011 Day 3\"],\"POJ-2195\":[\"Going Home\",8703,\"\\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-1584\":[\"A Round Peg in a Ground Hole\",1890,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dMid-Atlantic+2003\\\"\\u003eMid-Atlantic 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2396\":[\"Budget\",2033,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+2003+Preliminary\\\"\\u003eTehran 2003 Preliminary\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1249\":[\"三角形\",5991,\"\"],\"POJ-1985\":[\"Cow Marathon\",3754,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+February\\\"\\u003eUSACO 2004 February\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1743\":[\"Musical Theme\",6270,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dLouTiancheng%40POJ\\\"\\u003eLouTiancheng@POJ\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3528\":[\"Ultimate Weapon\",636,\"\\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.03.16\\\"\\u003ePOJ Founder Monthly Contest – 2008.03.16\\u003c/a\\u003e, Jiang Liyang\\u003c/div\\u003e\"],\"POJ-1502\":[\"MPI Maelstrom\",8696,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dEast+Central+North+America+1996\\\"\\u003eEast Central North America 1996\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1469\":[\"COURSES\",7896,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2000\\\"\\u003eSoutheastern Europe 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1228\":[\"Grandpa\\u0027s Estate\",3271,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+2002+Preliminary\\\"\\u003eTehran 2002 Preliminary\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2852\":[\"KiKi\\u0027s K-Number\",1680,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+4+-+Host+by+HDU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 4 - Host by HDU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3090\":[\"Visible Lattice Points\",5502,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dGreater+New+York+2006\\\"\\u003eGreater New York 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"URAL-1517\":[\"Freedom of Choice\",2252,\"\"],\"POJ-1077\":[\"Eight\",7851,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouth+Central+USA+1998\\\"\\u003eSouth Central USA 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"URAL-1117\":[\"Hierarchy\",1808,\"\"],\"HDU-1814\":[\"Peaceful Commission\",1546,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dPOI+2001\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e POI 2001 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2208\":[\"Pyramids\",871,\"\\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, Northern Subregion\\u003c/div\\u003e\"],\"POJ-1637\":[\"Sightseeing tour\",3003,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNorthwestern+Europe+2003\\\"\\u003eNorthwestern Europe 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1912\":[\"A highway and the seven dwarfs\",427,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCEOI+2002\\\"\\u003eCEOI 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2449\":[\"Remmarguts\\u0027 Date\",6322,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly\\\"\\u003ePOJ Monthly\\u003c/a\\u003e,Zeyuan Zhu\\u003c/div\\u003e\"],\"POJ-1635\":[\"Subway tree systems\",2164,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNorthwestern+Europe+2003\\\"\\u003eNorthwestern Europe 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"URAL-1076\":[\"Trash\",2060,\"\"],\"POJ-2728\":[\"Desert King\",4520,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBeijing+2005\\\"\\u003eBeijing 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3264\":[\"Balanced Lineup\",23675,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+January+Silver\\\"\\u003eUSACO 2007 January Silver\\u003c/a\\u003e\\u003c/div\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"tigerisland45","updateTime":1552943332000,"title":"俞勇《ACM国际大学生程序设计竞赛-算法与实现》题目一览","dislikeCnt":0,"content":"\n[海岛Blog](http://blog.csdn.net/tigerisland45)\n\n[挑战ACM编程](https://cn.vjudge.net/group/challenge)是自由参与组。提供挑战题、水题、白书、紫书和蓝书等等......\n\n俞勇《ACM国际大学生程序设计竞赛-算法与实现》题目一览\n\n第一章数学\n1. [problem:POJ-3420] Quad Tiling\n2. [problem:POJ-1830] 开关问题\n3. [problem:POJ-1166] The Clocks\n4. [problem:POJ-3070] Fibonacci\n5. [problem:POJ-1006] Biorhythms\n6. [problem:POJ-2115] C Looooops\n7. [problem:POJ-2116] Death to Binary?\n8. [problem:POJ-1284] Primitive Roots\n9. [problem:POJ-1808] Quadratic Residues\n10. [problem:SPOJ-MOD] Power Modulo Inverted\n11. [problem:HDU-3930] Broot\n12. [problem:OpenJ_Bailian-3177] 判决素数个数\n13. [problem:HDU-2138] How many prime numbers\n14. [problem:POJ-1142] Smith Numbers\n15. [problem:POJ-3090] Visible Lattice Points\n16. [problem:POJ-3904] Sky Code\n17. [problem:POJ-2098] Ellipse\n18. [problem:HDU-2031] 进制转换\n19. [problem:POJ-1832] 连环锁\n20. [problem:OpenJ_Bailian-2980] 大整数乘法\n21. [problem:OpenJ_Bailian-2981] 大整数加法\n22. [problem:HDU-4609] 3-idiots\n23. [problem:UVALive-6875] Continued Fraction\n24. [problem:POJ-1077] Eight\n\n第二章图论\n1. [problem:POJ-2367] Genealogical tree\n2. [problem:POJ-1144] Network\n3. [problem:POJ-2942] Knights of the Round Table\n4. [problem:POJ-2186] Popular Cows\n5. [problem:POJ-1094] Sorting It All Out\n6. [problem:HDU-1814] Peaceful Commission\n7. [problem:POJ-1502] MPI Maelstrom\n8. [problem:URAL-1450] Russian Pipelines\n9. [problem:POJ-2449] Remmarguts\u0027 Date\n10. [problem:POJ-1041] John\u0027s trip\n11. [problem:POJ-1637] Sightseeing tour\n12. [problem:POJ-1469] COURSES\n13. [problem:URAL-1076] Trash\n14. [problem:URAL-1099] Work Scheduling\n15. [problem:POJ-3728] The merchant\n16. [problem:POJ-2395] Out of Hay\n17. [problem:CodeForces-125E] MST Company\n18. [problem:Aizu-2309] Vector Compression\n19. [problem:POJ-2728] Desert King\n20. [problem:POJ-1985] Cow Marathon\n21. [problem:POJ-1273] Drainage Ditches\n22. [problem:POJ-2125] Destroying The Graph\n23. [problem:POJ-2914] Minimum Cut\n24. [problem:POJ-2396] Budget\n25. [problem:POJ-2195] Going Home\n26. [problem:ZOJ-1015] Fishing Net\n27. [problem:ZOJ-1492] Maximum Clique\n28. [problem:POJ-2989] All Friends\n29. [problem:POJ-1021] 2D-Nim\n30. [problem:POJ-1635] Subway tree systems\n\n第三章计算几何\n1. [problem:POJ-2653] Pick-up sticks\n2. [problem:POJ-1584] A Round Peg in a Ground Hole\n3. [problem:ZOJ-1081] Points Within\n4. [problem:POJ-1385] Lifting the Stone\n5. [problem:POJ-1265] Area\n6. [problem:POJ-1228] Grandpa\u0027s Estate\n7. [problem:POJ-1264] SCUD Busters\n8. [problem:POJ-2187] Beauty Contest\n9. [problem:POJ-1279] Art Gallery\n10. [problem:POJ-2451] Uyuw\u0027s Concert\n11. [problem:POJ-1912] A highway and the seven dwarfs\n12. [problem:POJ-3675] Telescope\n13. [problem:ZOJ-1450] Minimal Circle\n14. [problem:SPOJ-CIRU] The area of the union of circles\n15. [problem:SPOJ-VCIRCLES] Area of circles\n16. [problem:POJ-3391] The Bug Sensor Problem\n17. [problem:POJ-2977] Box walking\n18. [problem:POJ-2208] Pyramids\n19. [problem:POJ-2069] Super Star\n20. [problem:POJ-3528] Ultimate Weapon\n21. [problem:POJ-1673] EXOCENTER OF A TRIANGLE\n22. [problem:ZOJ-1776] Study Group\n23. [problem:ZOJ-2107] Quoit Design\n24. [problem:POJ-3241] Object Clustering\n25. [problem:POJ-1259] The Picnic\n26. [problem:HDU-1249] 三角形\n\n第四章数据结构\n1. [problem:POJ-3268] Silver Cow Party\n2. [problem:POJ-2492] A Bug\u0027s Life\n3. [problem:POJ-2352] Stars\n4. [problem:ZOJ-2334] Monkey King\n5. [problem:POJ-1056] IMMEDIATE DECODABILITY\n6. [problem:POJ-2985] The k-th Largest Group\n7. [problem:POJ-3580] SuperMemo\n8. [problem:POJ-3264] Balanced Lineup\n9. [problem:SPOJ-OTOCI] OTOCI\n10. [problem:SPOJ-QMAX3VN] Giá trị lớn nhất 3\n11. [problem:URAL-1553] Caves and Tunnels\n\n第五章论题选编\n\n5.1字符串\n1. [problem:POJ-1699] Best Sequence\n2. [problem:SPOJ-BEADS] Glass Beads\n3. [problem:URAL-1158] Censored!\n4. [problem:URAL-1517] Freedom of Choice\n5. [problem:POJ-1743] Musical Theme\n6. [problem:URAL-1297] Palindrome\n7. [problem:POJ-2503] Babelfish\n\n5.2转换\n1. [problem:HDU-1308] What Day Is It?\n2. [problem:URAL-1117] Hierarchy\n3. [problem:UVA-948] Fibonaccimal Base\n4. [problem:HDU-2352] Verdis Quo\n\n5.3构造\n1. [problem:HDU-1998] 奇数阶魔方\n2. [problem:POJ-3239] Solution to the n Queens Puzzle\n3. [problem:POJ-1955] Rubik\u0027s Cube\n4. [problem:POJ-2488] A Knight\u0027s Journey\n\n5.4计算\n1. [problem:POJ-1686] Lazy Math Instructor\n2. [problem:POJ-1050] To the Max\n3. [problem:POJ-1389] Area of Simple Polygons\n4. [problem:POJ-1177] Picture\n5. [problem:HDU-2852] KiKi\u0027s K-Number\n6. [problem:POJ-2299] Ultra-QuickSort\n7. [problem:POJ-1458] Common Subsequence\n8. [problem:POJ-2127] Greatest Common Increasing Subsequence\n\n","threadId":40216,"likeCnt":6,"createTime":1543888492000,"isWorkbook":true,"viewCnt":4381,"openness":1,"fav":false,"id":772,"trustable":false}