{"workbook":{"problemsBrief":"{\"POJ-1442\":[\"Black Box\",5309,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+1996\\\"\\u003eNortheastern Europe 1996\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2891\":[\"Strange Way to Express Integers\",5344,\"\\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, Static\\u003c/div\\u003e\"],\"LibreOJ-2589\":[\"Hankson 的趣味题\",926,\"NOIP2009\"],\"POJ-3189\":[\"Steady Cow Assignment\",1790,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+February+Gold\\\"\\u003eUSACO 2006 February Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1325\":[\"Machine Schedule\",6635,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBeijing+2002\\\"\\u003eBeijing 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1201\":[\"Intervals\",9046,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouthwestern+Europe+2002\\\"\\u003eSouthwestern Europe 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2411\":[\"Mondriaan\\u0027s Dream\",9844,\"\\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-3621\":[\"Sightseeing Cows\",2393,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+December+Gold\\\"\\u003eUSACO 2007 December Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1328\":[\"Radar Installation\",25470,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBeijing+2002\\\"\\u003eBeijing 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2196\":[\"Computer\",7246,\"\"],\"洛谷-P1912\":[\"诗人小G\",6727,\"NOI2009\"],\"HDU-2870\":[\"Largest Submatrix\",1234,\"\\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+7+-+Host+by+FZU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 7 - Host by FZU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LibreOJ-104\":[\"普通平衡树\",10219,null],\"POJ-3190\":[\"Stall Reservations\",6510,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+February+Silver\\\"\\u003eUSACO 2006 February Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"LibreOJ-10010\":[\"糖果传递\",1833,\"一本通 1.1 练习 6\"],\"LibreOJ-10132\":[\"异象石\",913,\"一本通 4.4 例 3\"],\"黑暗爆炸-2457\":[\"双端队列\",379,\"BeiJing2011 Day1\"],\"LibreOJ-10133\":[\"次小生成树\",1989,\"一本通 4.4 例 4\"],\"POJ-3070\":[\"Fibonacci\",16541,\"\\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\"],\"LibreOJ-10136\":[\"聚会\",1235,\"一本通 4.4 练习 3\"],\"POJ-3076\":[\"Sudoku\",1435,\"\\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\"],\"LibreOJ-2598\":[\"Mayan 游戏\",337,\"NOIP2011\"],\"POJ-3630\":[\"Phone List\",8777,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNordic+2007\\\"\\u003eNordic 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"LibreOJ-2599\":[\"计算系数\",953,\"NOIP2011\"],\"洛谷-P3304\":[\"直径\",7362,\"SDOI2013\"],\"LibreOJ-2359\":[\"天天爱跑步\",915,\"NOIP2016\"],\"POJ-1456\":[\"Supermarket\",9310,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2003\\\"\\u003eSoutheastern Europe 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3635\":[\"Full Tank?\",3713,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNordic+2007\\\"\\u003eNordic 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"LibreOJ-2352\":[\"社交网络\",111,\"NOI2007\"],\"LibreOJ-2594\":[\"关押罪犯\",909,\"NOIP2010\"],\"洛谷-P1006\":[\"传纸条\",87086,\"NOIP 2008 提高组\"],\"LibreOJ-2590\":[\"最优贸易\",1109,\"NOIP2009\"],\"LibreOJ-2591\":[\"靶形数独\",1162,\"NOIP2009\"],\"LibreOJ-2593\":[\"乌龟棋\",347,\"NOIP2010\"],\"HDU-4261\":[\"Estimation\",304,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+University+of+Chicago+Invitational+Programming+Contest+2012\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The University of Chicago Invitational Programming Contest 2012 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"黑暗爆炸-1233\":[\"干草堆tower\",73,\"Usaco2009Open\"],\"LibreOJ-2108\":[\"装备购买\",324,\"JLOI2015\"],\"POJ-3045\":[\"Cow Acrobats\",3305,\"\\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\"],\"洛谷-P4408\":[\"逃学的小孩 / 数据生成器\",8108,\"NOI2003\"],\"POJ-1422\":[\"Air Raid\",5349,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dDhaka+2002\\\"\\u003eDhaka 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"黑暗爆炸-2599\":[\"Race\",364,\"IOI2011\"],\"黑暗爆炸-2115\":[\" Xor\",153,\"Wc2011\"],\"LibreOJ-10154\":[\"选课\",1836,\"一本通 5.2 例 2\"],\"POJ-3171\":[\"Cleaning Shifts\",1435,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+December+Silver\\\"\\u003eUSACO 2005 December Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2083\":[\"Fractal\",9231,\"\\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\"],\"黑暗爆炸-2351\":[\"Matrix\",248,\"BeiJing2011\"],\"LibreOJ-2318\":[\"宝藏\",934,\"NOIP2017\"],\"POJ-3179\":[\"Corral the Cows\",1110,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+January+Gold\\\"\\u003eUSACO 2006 January Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2762\":[\"Going from u to v or from v to u?\",3649,\"\\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\"],\"洛谷-P4778\":[\"Counting swaps\",1446,null],\"POJ-3177\":[\"Redundant Paths\",5988,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+January+Gold\\\"\\u003eUSACO 2006 January Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3613\":[\"Cow Relays\",2949,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+November+Gold\\\"\\u003eUSACO 2007 November Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3974\":[\"Palindrome\",6697,\"\\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\"],\"HDU-5015\":[\"233 Matrix\",2552,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014+ACM%2FICPC+Asia+Regional+Xi%26%23039%3Ban+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 ACM/ICPC Asia Regional Xi\\u0027an Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LibreOJ-2691\":[\"约会 Rendezvous\",152,\"POI2012\"],\"洛谷-P1706\":[\"全排列问题\",200869,null],\"POJ-3614\":[\"Sunscreen\",4901,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+November+Gold\\\"\\u003eUSACO 2007 November Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"黑暗爆炸-1257\":[\"余数之和\",465,\"CQOI2007\"],\"LibreOJ-10143\":[\"营业额统计\",1535,\"一本通 4.6 例 1\"],\"黑暗爆炸-3674\":[\"可持久化并查集加强版\",373,\"\"],\"LibreOJ-10147\":[\"石子合并\",4010,\"一本通 5.1 例 1\"],\"CodeForces-670C\":[\"Cinema\",12010,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/670\\\"\\u003eCodeforces Round 350 (Div. 2)\\u003c/a\\u003e\"],\"LibreOJ-10148\":[\"能量项链\",1965,\"一本通 5.1 例 2\"],\"洛谷-P1032\":[\"字串变换（疑似错题）\",44009,\"NOIP 2002 提高组\"],\"洛谷-P3211\":[\"XOR和路径\",2470,\"HNOI2011\"],\"洛谷-P1155\":[\"双栈排序\",8032,\"NOIP 2008 提高组\"],\"POJ-3422\":[\"Kaka\\u0027s Matrix Travels\",2820,\"\\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, Huang, Jinsong\\u003c/div\\u003e\"],\"洛谷-P1157\":[\"组合的输出\",118315,null],\"POJ-3784\":[\"Running Median\",2581,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dGreater+New+York+Regional+2009\\\"\\u003eGreater New York Regional 2009\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1486\":[\"Sorting Slides\",1783,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouthwestern+European+Regional+Contest+1998\\\"\\u003eSouthwestern European Regional Contest 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"OpenJ_POJ-1044\":[\"PKU ACM Team\\u0027s Excursion\",63,\"\"],\"POJ-3662\":[\"Telephone Lines\",3405,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2008+January+Silver\\\"\\u003eUSACO 2008 January Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3667\":[\"Hotel\",6413,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2008+February+Gold\\\"\\u003eUSACO 2008 February Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3666\":[\"Making the Grade\",5171,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2008+February+Gold\\\"\\u003eUSACO 2008 February Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-24D\":[\"Broken robot\",3032,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/24\\\"\\u003eCodeforces Beta Round 24\\u003c/a\\u003e\"],\"HDU-3085\":[\"Nightmare Ⅱ\",1849,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2nd+%A1%B0Vegetable-Birds+Cup%A1%B1+Programming+Open+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2nd “Vegetable-Birds Cup” Programming Open Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"黑暗爆炸-3105\":[\"新Nim游戏\",117,\"cqoi2013\"],\"LibreOJ-10214\":[\"计算器\",558,\"一本通 6.4 例 6\"],\"黑暗爆炸-2252\":[\"矩阵距离 \",490,\"2010Beijing wc\"],\"洛谷-P1044\":[\"栈\",124022,\"NOIP 2003 普及组\"],\"POJ-1011\":[\"Sticks\",22740,\"\\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\"],\"洛谷-P4556\":[\"线段树合并 / [Vani 有约会] 雨天的尾巴\",22005,\"模板\"],\"POJ-2226\":[\"Muddy Fields\",4126,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+January+Gold\\\"\\u003eUSACO 2005 January Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3678\":[\"Katu Puzzle\",3475,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.07.27\\\"\\u003ePOJ Founder Monthly Contest – 2008.07.27\\u003c/a\\u003e, Dagger\\u003c/div\\u003e\"],\"POJ-1014\":[\"Dividing\",13942,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dMid-Central+European+Regional+Contest+1999\\\"\\u003eMid-Central European Regional Contest 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1015\":[\"Jury Compromise\",7124,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouthwestern+European+Regional+Contest+1996\\\"\\u003eSouthwestern European Regional Contest 1996\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2104\":[\"K-th Number\",14235,\"\\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-1934\":[\"Trip\",1663,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCEOI+2003\\\"\\u003eCEOI 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2228\":[\"Naptime\",2416,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+January+Gold\\\"\\u003eUSACO 2005 January Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2349\":[\"Arctic Network\",8173,\"\\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\"],\"HDU-4864\":[\"Task\",3379,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014+Multi-University+Training+Contest+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 Multi-University Training Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LibreOJ-10203\":[\"反素数 Antiprime\",981,\"一本通 6.3 例 1\"],\"POJ-2230\":[\"Watchcow\",3344,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+January+Silver\\\"\\u003eUSACO 2005 January Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"黑暗爆炸-1150\":[\"数据备份Backup\",189,\"CTSC2007\"],\"POJ-1463\":[\"Strategic game\",4677,\"\\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\"],\"LibreOJ-10229\":[\"古代猪文\",706,\"一本通 6.6 例 4\"],\"POJ-2311\":[\"Cutting Game\",2381,\"\\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-1220\":[\"NUMBER BASE CONVERSION\",2540,\"\\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\"],\"洛谷-P1854\":[\"花店橱窗布置\",19212,\"IOI 1999\"],\"POJ-2676\":[\"Sudoku\",10666,\"\\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-3764\":[\"The xor-longest Path\",2279,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003d\\\"\\u003e\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-U64949\":[\"棋盘覆盖\",550,null],\"POJ-3648\":[\"Wedding\",2139,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+Local+Contest\\\"\\u003eWaterloo Local Contest\\u003c/a\\u003e, 2007.9.29\\u003c/div\\u003e\"],\"POJ-2559\":[\"Largest Rectangle in a Histogram\",9637,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+2003\\\"\\u003eUlm Local 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3889\":[\"Fractal Streets\",1127,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBAPC+2009\\\"\\u003eBAPC 2009\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1904\":[\"King\\u0027s Quest\",2290,\"\\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\\u003c/div\\u003e\"],\"黑暗爆炸-2716\":[\"天使玩偶\",240,\"Violet 3 Vani原创 欢迎移步 OJ2648\"],\"POJ-3090\":[\"Visible Lattice Points\",5622,\"\\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\"],\"黑暗爆炸-2038\":[\"小Z的袜子(hose)\",638,\"2009国家集训队\"],\"LibreOJ-10110\":[\"太鼓达人\",306,\"一本通 3.7 练习 4\"],\"POJ-2442\":[\"Sequence\",3186,\"\\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,Guang Lin\\u003c/div\\u003e\"],\"POJ-1112\":[\"Team Them Up!\",1764,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2001\\\"\\u003eNortheastern Europe 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1475\":[\"Pushing Boxes\",2483,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouthwestern+European+Regional+Contest+1997\\\"\\u003eSouthwestern European Regional Contest 1997\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P3368\":[\"树状数组 2\",101388,\"模板\"],\"POJ-1236\":[\"Network of Schools\",8623,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dIOI+1996\\\"\\u003eIOI 1996\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2689\":[\"Prime Distance\",6464,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+1998.10.17\\\"\\u003eWaterloo local 1998.10.17\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P3008\":[\"Roads and Planes G\",5621,\"USACO11JAN\"],\"CodeForces-311B\":[\"Cats Transport\",5004,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/311\\\"\\u003eCodeforces Round 185 (Div. 1)\\u003c/a\\u003e\"],\"POJ-3417\":[\"Network\",2369,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.10.06\\\"\\u003ePOJ Monthly--2007.10.06\\u003c/a\\u003e, Yang Mu\\u003c/div\\u003e\"],\"POJ-2449\":[\"Remmarguts\\u0027 Date\",6570,\"\\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\"],\"黑暗爆炸-2818\":[\"Gcd\",486,\" 湖北省队互测\"],\"黑暗爆炸-2821\":[\"作诗(Poetize)\",519,\" By lydrainbowcat\"],\"黑暗爆炸-1176\":[\"Mokia\",226,\"Balkan2007\"],\"Baekjoon-6004\":[\"The Chivalrous Cow\",103,\"\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/2\\\"\\u003eOlympiad\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/106\\\"\\u003eUSA Computing Olympiad\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/128\\\"\\u003e2009-2010 Season\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/130\\\"\\u003eUSACO November 2009 Contest\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/detail/634\\\"\\u003eBronze\\u003c/a\\u003e\\u0026nbsp;2번\"],\"POJ-2376\":[\"Cleaning Shifts\",10170,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+December+Silver\\\"\\u003eUSACO 2004 December Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3345\":[\"Bribing FIPA\",1354,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+2006\\\"\\u003eTehran 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"黑暗爆炸-3261\":[\"最大异或和\",255,\"\"],\"POJ-1167\":[\"The Buses\",1217,\"\\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\"],\"洛谷-P2960\":[\"Invasion of the Milkweed G\",5105,\"USACO09OCT\"],\"POJ-2374\":[\"Fence Obstacle Course\",855,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+December+Gold\\\"\\u003eUSACO 2004 December Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3585\":[\"Accumulation Degree\",1836,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouth+Central+China+2008+hosted+by+NUDT\\\"\\u003eSouth Central China 2008 hosted by NUDT\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3463\":[\"Sightseeing\",2954,\"\\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-3349\":[\"Snowflake\\r\\nSnow\\r\\nSnowflakes\",7797,\"\\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-2259\":[\"Team Queue\",3248,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+1998\\\"\\u003eUlm Local 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2018\":[\"Best Cow Fences\",4539,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2003+March+Green\\\"\\u003eUSACO 2003 March Green\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3468\":[\"A Simple Problem with Integers\",30483,\"\\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-1961\":[\"Period\",9316,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2004\\\"\\u003eSoutheastern Europe 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1966\":[\"Cable TV Network\",1858,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2004\\\"\\u003eSoutheastern Europe 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1845\":[\"Sumdiv\",6312,\"\\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\"],\"POJ-1964\":[\"City Game\",1897,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2004\\\"\\u003eSoutheastern Europe 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1722\":[\"SUBTRACT\",902,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCEOI+1998\\\"\\u003eCEOI 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1723\":[\"SOLDIERS\",5370,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCEOI+1998\\\"\\u003eCEOI 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-3686\":[\"Traffic Real Time Query System\",515,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Hangzhou+Regional+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Hangzhou Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3904\":[\"Sky Code\",1411,\"\\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\"],\"黑暗爆炸-2973\":[\"石头游戏\",77,\"\"],\"黑暗爆炸-3029\":[\"守卫者的挑战\",88,\"Poetize1\"],\"LibreOJ-10099\":[\"矿场搭建\",747,\"一本通 3.6 例 2\"],\"LibreOJ-2619\":[\"球形空间产生器\",159,\"JSOI2008\"],\"OpenJ_NOI-CH0206-2985\":[\"数字组合\",4219,\"\"],\"POJ-1050\":[\"To the Max\",26307,\"\\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\",5153,\"\\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\"],\"LibreOJ-2632\":[\"打开灯泡 Switch the Lamp On\",1449,\"BalticOI 2011 Day1\"],\"计蒜客-T1683\":[\"阶乘分解\",1069,null],\"POJ-3233\":[\"Matrix Power Series\",9566,\"\\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-2942\":[\"Knights of the Round Table\",2983,\"\\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-1179\":[\"Polygon\",2776,\"\\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-1733\":[\"Parity game\",4904,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCEOI+1999\\\"\\u003eCEOI 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1734\":[\"Sightseeing trip\",2736,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCEOI+1999\\\"\\u003eCEOI 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2823\":[\"Sliding Window\",15898,\"\\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\"],\"POJ-2828\":[\"Buy Tickets\",8883,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.05.28\\\"\\u003ePOJ Monthly--2006.05.28\\u003c/a\\u003e, Zhu, Zeyuan\\u003c/div\\u003e\"],\"POJ-2947\":[\"Widget Factory\",1710,\"\\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-1737\":[\"Connected Graph\",1738,\"\\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-1738\":[\"An old Stone Game\",839,\"\\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\"],\"黑暗爆炸-2718\":[\"毕业旅行\",24,\"Violet 4 Ctsc2008 River \\u0026amp; ural 1533. Fat Hobbits\"],\"CodeForces-559C\":[\"Gerald and Giant Chess\",8605,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/559\\\"\\u003eCodeforces Round 313 (Div. 1)\\u003c/a\\u003e\"],\"黑暗爆炸-2724\":[\"蒲公英\",396,\"Violet 6 Vani原创\"],\"黑暗爆炸-1997\":[\"Planar\",40,\"Hnoi2010\"],\"洛谷-P1092\":[\"虫食算\",16544,\"NOIP 2004 提高组\"],\"POJ-1180\":[\"Batch Scheduling\",1854,\"\\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\"],\"黑暗爆炸-2288\":[\"【POJ Challenge】生日礼物\",72,\"\"],\"POJ-1185\":[\"炮兵阵地\",10195,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNoi+01\\\"\\u003eNoi 01\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1061\":[\"青蛙的约会\",23580,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003d%E6%B5%99%E6%B1%9F\\\"\\u003e浙江\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1182\":[\"食物链\",26203,\"\\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\"],\"洛谷-P1099\":[\"树网的核\",18215,\"NOIP 2007 提高组\"],\"POJ-3565\":[\"Ants\",1835,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2007\\\"\\u003eNortheastern Europe 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3323\":[\"Bloxorz II\",147,\"\\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, Rainer\\u003c/div\\u003e\"],\"LibreOJ-2169\":[\"流星 Meteors\",657,\"POI2011 R3\"],\"POJ-3322\":[\"Bloxorz I\",1798,\"\\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, Rainer\\u003c/div\\u003e\"],\"POJ-3683\":[\"Priest John\\u0027s Busiest Day\",2743,\"\\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\"],\"洛谷-P4127\":[\"同类分布\",7621,\"AHOI2009\"],\"POJ-2912\":[\"Rochambeau\",2138,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBaidu+Star+2006+Preliminary\\\"\\u003eBaidu Star 2006 Preliminary\\u003c/a\\u003e\\r\\u003cbr\\u003eChen, Shixi (xreborner) living in http://fairyair.yeah.net/\\u003c/div\\u003e\"],\"POJ-1945\":[\"Power Hungry Cows\",912,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2002+February\\\"\\u003eUSACO 2002 February\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1821\":[\"Fence\",2155,\"\\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\"],\"POJ-3208\":[\"Apocalypse Someday\",1374,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.03.04\\\"\\u003ePOJ Monthly--2007.03.04\\u003c/a\\u003e, Ikki, adapted from TCHS SRM 2 ApocalypseSomeday\\u003c/div\\u003e\"],\"POJ-1704\":[\"Georgia and Bob\",4968,\"\\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-1390\":[\"Blocks\",2025,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dLiu+Rujia%40POJ\\\"\\u003eLiu Rujia@POJ\\u003c/a\\u003e\\u003c/div\\u003e\"],\"黑暗爆炸-3047\":[\"Freda的传呼机\",12,\"Poetize9\"],\"POJ-1151\":[\"Atlantis\",7251,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dMid-Central+European+Regional+Contest+2000\\\"\\u003eMid-Central European Regional Contest 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2482\":[\"Stars in Your Window\",2548,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Contest\\\"\\u003ePOJ Contest\\u003c/a\\u003e,Author:kinfkong@ZSU\\u003c/div\\u003e\"],\"POJ-1273\":[\"Drainage Ditches\",16848,\"\\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-2480\":[\"Longge\\u0027s problem\",2821,\"\\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\"],\"黑暗爆炸-3043\":[\"IncDec Sequence\",1147,\" Poetize6\"],\"POJ-3696\":[\"The Luckiest number\",1817,\"\\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-3694\":[\"Network\",3121,\"\\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-1275\":[\"Cashier Employment\",2671,\"\\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\"],\"POJ-1038\":[\"Bugs Integrated, Inc.\",2587,\"\\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-1830\":[\"开关问题\",3746,\"\\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-2248\":[\"Addition Chains\",2611,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+1997\\\"\\u003eUlm Local 1997\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1952\":[\"BUY LOW, BUY LOWER\",3181,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2002+February\\\"\\u003eUSACO 2002 February\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1037\":[\"A decorative fence\",2889,\"\\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\"],\"LibreOJ-2294\":[\"银河英雄传说\",391,\"NOI2002\"],\"POJ-1958\":[\"Strange Towers of Hanoi\",3038,\"\\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\"],\"LibreOJ-2607\":[\"疫情控制\",494,\"NOIP2012\"],\"黑暗爆炸-2741\":[\"【FOTILE模拟赛】L\",151,\" By seter\"],\"黑暗爆炸-3037\":[\"创世纪\",94,\"Poetize4\"],\"黑暗爆炸-3036\":[\"绿豆蛙的归宿\",233,\" Poetize3\"],\"POJ-1041\":[\"John\\u0027s trip\",2797,\"\\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\"],\"黑暗爆炸-3276\":[\"磁力\",42,\"\"],\"LibreOJ-2603\":[\"国王游戏\",1103,\"NOIP2012\"],\"POJ-3460\":[\"Booksort\",858,\"\\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-1160\":[\"Post Office\",8372,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dIOI+2000\\\"\\u003eIOI 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"LibreOJ-2604\":[\"开车旅行\",402,\"NOIP2012\"],\"黑暗爆炸-3032\":[\"七夕祭\",250,\" Poetize2\"],\"POJ-3580\":[\"SuperMemo\",2417,\"\\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\"],\"LibreOJ-2605\":[\"同余方程\",2369,\"NOIP2012\"],\"POJ-2299\":[\"Ultra-QuickSort\",23417,\"\\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-2176\":[\"Folding\",577,\"\\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\"],\"CodeForces-451E\":[\"Devu and Flowers\",5699,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/451\\\"\\u003eCodeforces Round 258 (Div. 2)\\u003c/a\\u003e\"],\"POJ-3700\":[\"Missile Defence System\",796,\"\\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.10.05\\\"\\u003ePOJ Founder Monthly Contest – 2008.10.05\\u003c/a\\u003e, facer\\u003c/div\\u003e\"],\"HDU-5542\":[\"The Battle of Chibi\",1287,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+2015+China+Collegiate+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 2015 China Collegiate Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2976\":[\"Dropping tests\",6956,\"\\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\"],\"POJ-3709\":[\"K-Anonymous Sequence\",1593,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.12.28\\\"\\u003ePOJ Founder Monthly Contest – 2008.12.28\\u003c/a\\u003e, Rainer\\u003c/div\\u003e\"],\"HDU-4699\":[\"Editor\",1541,\"\\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+10\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 10 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1654\":[\"Place the Robots\",2085,null],\"LibreOJ-10050\":[\"The XOR Largest Pair\",3485,\"一本通 2.3 例 2\"],\"POJ-2182\":[\"Lost Cows\",8124,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2003+U+S+Open+Orange\\\"\\u003eUSACO 2003 U S Open Orange\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2185\":[\"Milking Grid\",3554,\"\\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\"],\"SPOJ-GSS3\":[\"Can you answer these queries III\",15890,\"own problem\"],\"POJ-1094\":[\"Sorting It All Out\",11132,\"\\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\"],\"LibreOJ-2034\":[\"排列计数\",1051,\"SDOI2016\"],\"POJ-4007\":[\"Flood-it!\",196,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dFuzhou+2011\\\"\\u003eFuzhou 2011\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1417\":[\"True Liars\",2156,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2002+Kanazawa\\\"\\u003eJapan 2002 Kanazawa\\u003c/a\\u003e\\u003c/div\\u003e\"],\"LibreOJ-2151\":[\"骑士精神\",459,\"SCOI2005\"],\"POJ-3714\":[\"Raid\",5094,\"\\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, Dagger\\u003c/div\\u003e\"],\"洛谷-P3629\":[\"巡逻\",9022,\"APIO2010\"],\"黑暗爆炸-3058\":[\"四叶草魔杖\",9,\"Poetize11\"],\"黑暗爆炸-3056\":[\"升降梯口\",0,\" Poetize10\"],\"黑暗爆炸-1791\":[\"Island 岛屿 \",244,\"Ioi2008\"],\"黑暗爆炸-3054\":[\"Rainbow的信号\",109,\"\"],\"POJ-2195\":[\"Going Home\",8934,\"\\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-1187\":[\"陨石的秘密\",877,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNoi+01\\\"\\u003eNoi 01\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1742\":[\"Coins\",10683,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dLouTiancheng%40POJ\\\"\\u003eLouTiancheng@POJ\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-3949\":[\"XOR\",3111,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Multi-University+Training+Contest+11+-+Host+by+UESTC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Multi-University Training Contest 11 - Host by UESTC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2279\":[\"Mr. Young\\u0027s Picture Permutations\",1430,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dGreater+New+York+2004\\\"\\u003eGreater New York 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"LibreOJ-2244\":[\"起床困难综合症\",787,\"NOI2014\"],\"POJ-1741\":[\"Tree\",7082,\"\\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\"],\"LibreOJ-2360\":[\"换教室\",643,\"NOIP2016\"],\"LibreOJ-2362\":[\"蚯蚓\",725,\"NOIP2016\"],\"LibreOJ-10190\":[\"特别行动队\",560,\"一本通 5.6 练习 3\"],\"黑暗爆炸-2438\":[\"杀人游戏 \",90,\"中山市选2011\"],\"POJ-1191\":[\"棋盘分割\",4520,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNoi+99\\\"\\u003eNoi 99\\u003c/a\\u003e\\u003c/div\\u003e\"],\"黑暗爆炸-1101\":[\"Zap\",273,\"POI2007\"],\"洛谷-P6596\":[\"How Many of Them\",1156,null],\"POJ-1190\":[\"生日蛋糕\",7779,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNoi+99\\\"\\u003eNoi 99\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3252\":[\"Round Numbers\",6932,\"\\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-3253\":[\"Fence Repair\",21938,\"\\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-2282\":[\"The Counting Problem\",2353,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dShanghai+2004\\\"\\u003eShanghai 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1193\":[\"内存分配\",589,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNoi+99\\\"\\u003eNoi 99\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2288\":[\"Islands and Bridges\",2461,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dShanghai+2004\\\"\\u003eShanghai 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2044\":[\"Weather Forecast\",675,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2003\\\"\\u003eJapan 2003\\u003c/a\\u003e,Aizu\\u003c/div\\u003e\"],\"POJ-2286\":[\"The Rotation Game\",1698,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dShanghai+2004\\\"\\u003eShanghai 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3254\":[\"Corn Fields\",9942,\"\\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-1077\":[\"Eight\",8240,\"\\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\"],\"Gym-100340A\":[\"Cookies\",192,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100340\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2006-2007 Winter Petrozavodsk Camp, Andrew Stankevich Contest 24 (ASC 24)\\u003c/a\\u003e\"],\"POJ-1995\":[\"Raising Modulo Numbers\",12418,\"\\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\"],\"LibreOJ-2132\":[\"荷马史诗\",579,\"NOI2015\"],\"POJ-3017\":[\"Cut the Sequence\",2543,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.09.29\\\"\\u003ePOJ Monthly--2006.09.29\\u003c/a\\u003e, zhucheng\\u003c/div\\u003e\"],\"POJ-2965\":[\"The Pilots Brothers\\u0027 refrigerator\",10539,\"\\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, Western Subregion\\u003c/div\\u003e\"],\"POJ-1635\":[\"Subway tree systems\",2174,\"\\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-1639\":[\"Picnic Planning\",2404,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dEast+Central+North+America+2000\\\"\\u003eEast Central North America 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2728\":[\"Desert King\",4637,\"\\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\"],\"LibreOJ-10183\":[\"股票交易\",588,\"一本通 5.5 练习 4\"],\"黑暗爆炸-1218\":[\"激光炸弹\",1188,\"HNOI2003\"],\"LibreOJ-10184\":[\"任务安排 1\",1093,\"一本通 5.6 例 1\"],\"SGU-167\":[\"I-country. \",153,\"\"],\"LibreOJ-10186\":[\"任务安排 3\",761,\"一本通 5.6 例 3\"],\"POJ-3263\":[\"Tallest Cow\",4072,\"\\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\"],\"LibreOJ-2129\":[\"程序自动分析\",1011,\"NOI2015\"],\"POJ-2054\":[\"Color a Tree\",2363,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBeijing+2004\\\"\\u003eBeijing 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1084\":[\"Square Destroyer\",2036,\"\\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\"],\"洛谷-P1352\":[\"没有上司的舞会\",90856,null]}","joined":false,"groups":{}},"managingGroups":{},"collectingGroups":[[19321,"hufeAcmer","湖财ACM训练队","https://cn.cravatar.com/avatar/163e759328765ce49c0fc8bf82927119?d\u003dmonsterid",true],[19735,"hufeAcmer2023","湖财ACM协会2023级训练","https://cn.cravatar.com/avatar/163e759328765ce49c0fc8bf82927119?d\u003dmonsterid",true],[27153,"hufeAcmer2025","湖财ACM协会训练2025","https://cn.cravatar.com/avatar/163e759328765ce49c0fc8bf82927119?d\u003dmonsterid",true]],"author":"zebinlu","updateTime":1702523023000,"title":"李煜东《算法竞赛进阶指南》题单","dislikeCnt":0,"content":"#### 0x00 基本算法\n##### 0x01 位运算\n##### 移位运算\n[problem:POJ-1995]\n\n##### 二进制状态压缩\n[problem:LibreOJ-2244]\n\n##### 0x02 递归与递推\n##### 递推与递归的简单应用\n[problem:洛谷-P1706]\n[problem:洛谷-P1157]\n[problem:POJ-1958]\n\n##### 分治\n[problem:POJ-1845]\n\n##### 分形\n[problem:POJ-3889]\n\n##### 0x03 前缀和与差分\n##### 前缀和\n[problem:黑暗爆炸-1218]\n\n##### 差分\n[problem:黑暗爆炸-3043]\n[problem:POJ-3263]\n\n##### 0x04 二分\n##### 二分答案转化为判定\n[problem:POJ-2018]\n\n##### 0x05 排序\n##### 离散化\n[problem:CodeForces-670C]\n\n##### 中位数\n[problem:黑暗爆炸-3032]\n[problem:POJ-3784]\n\n##### 逆序对\n[problem:POJ-2299]\n\n##### 0x06 倍增\n##### 0x07 贪心\n[problem:POJ-3614]\n[problem:POJ-3190]\n[problem:POJ-1328]\n[problem:LibreOJ-2603]\n[problem:POJ-2054]\n\n##### 习题\n[problem:POJ-2965]\n[problem:POJ-2083]\n[problem:POJ-3714]\n[problem:POJ-3179]\n[problem:LibreOJ-10010]\n[problem:POJ-1723]\n[problem:POJ-1220]\n[problem:POJ-3045]\n[problem:POJ-1050]\n[problem:HDU-4864]\n\n#### 0x10 基本数据结构\n##### 0x11 栈\n[problem:HDU-4699]\n[problem:洛谷-P1044]\n\n##### 单调栈\n[problem:POJ-2559]\n\n##### 0x12 队列\n[problem:POJ-2259]\n[problem:LibreOJ-2362]\n[problem:黑暗爆炸-2457]\n\n##### 0x13 链表与邻接表\n[problem:POJ-3784]\n\n##### 0x14 Hash\n##### Hash 表\n[problem:POJ-3349]\n\n##### 字符串 Hash\n[problem:POJ-3974]\n\n##### 0x15 字符串\n##### KMP 模式匹配\n[problem:POJ-1961]\n\n##### 0x16 Trie\n[problem:LibreOJ-10050]\n[problem:POJ-3764]\n\n##### 0x17 二叉堆\n[problem:POJ-1456]\n[problem:POJ-2442]\n[problem:黑暗爆炸-1150]\n\n##### Huffman 树\n[problem:POJ-3253]\n[problem:LibreOJ-2132]\n\n##### 习题\n[problem:POJ-1964]\n[problem:洛谷-P1155]\n[problem:POJ-2823]\n[problem:POJ-1193]\n[problem:黑暗爆炸-2351]\n[problem:POJ-1635]\n[problem:POJ-2185]\n[problem:POJ-3630]\n[problem:POJ-1442]\n[problem:黑暗爆炸-2288]\n\n#### 0x20 搜索\n##### 0x21 树与图的遍历\n##### 0x22 深度优先搜索\n[problem:POJ-2676]\n\n##### 0x23 剪枝\n[problem:POJ-1011]\n[problem:POJ-1190]\n[problem:POJ-3076]\n\n##### 0x24 迭代加深\n[problem:POJ-2248]\n\n##### 0x25 广度优先搜索\n[problem:POJ-3322]\n[problem:黑暗爆炸-2252]\n[problem:POJ-1475]\n\n##### 0x26 广搜变形\n[problem:LibreOJ-2632]\n[problem:POJ-3635]\n[problem:HDU-3085]\n\n##### 0x27 A*\n[problem:POJ-2449]\n[problem:POJ-1077]\n\n##### 0x28 IDA*\n[problem:POJ-3460]\n[problem:POJ-2286]\n[problem:POJ-1084]\n\n##### 习题\n[problem:LibreOJ-2591]\n[problem:洛谷-P1092]\n[problem:LibreOJ-2598]\n[problem:POJ-1167]\n[problem:POJ-3700]\n[problem:Baekjoon-6004]\n[problem:洛谷-P2960]\n[problem:洛谷-P1032]\n[problem:POJ-2044]\n[problem:POJ-3323]\n[problem:POJ-1945]\n[problem:POJ-4007]\n[problem:LibreOJ-2151]\n\n#### 0x30 数学知识\n##### 0x31 质数\n[problem:POJ-2689]\n[problem:计蒜客-T1683]\n\n##### 0x32 约数\n[problem:LibreOJ-10203]\n[problem:黑暗爆炸-1257]\n[problem:LibreOJ-2589]\n[problem:POJ-3090]\n\n##### 0x33 同余\n[problem:POJ-3696]\n[problem:LibreOJ-2605]\n[problem:POJ-2891]\n\n##### 0x34 矩阵乘法\n[problem:POJ-3070]\n[problem:黑暗爆炸-2973]\n\n###### 0x35 高斯消元与线性空间\n[problem:LibreOJ-2619]\n[problem:POJ-1830]\n[problem:LibreOJ-2108]\n[problem:HDU-3949]\n\n##### 0x36 组合计数\n[problem:LibreOJ-2599]\n[problem:洛谷-P4778]\n[problem:LibreOJ-10229]\n\n##### 0x37 容斥原理与 Möbius 函数\n[problem:CodeForces-451E]\n[problem:黑暗爆炸-1101]\n\n##### 0x38 概率与数学期望\n[problem:黑暗爆炸-3054]\n[problem:黑暗爆炸-3036]\n\n##### 0x39 0/1 分数规划\n##### 0x3A 博弈论之 SG 函数\n[problem:POJ-2311]\n\n##### 习题\n[problem:黑暗爆炸-2818]\n[problem:POJ-2480]\n[problem:POJ-1061]\n[problem:LibreOJ-10214]\n[problem:POJ-3233]\n[problem:HDU-5015]\n[problem:POJ-2947]\n[problem:黑暗爆炸-2115]\n[problem:黑暗爆炸-3105]\n[problem:LibreOJ-2034]\n[problem:POJ-3904]\n[problem:黑暗爆炸-3029]\n[problem:LibreOJ-2360]\n[problem:POJ-2976]\n[problem:POJ-1704]\n\n#### 0x40 数据结构进阶\n##### 0x41 并查集\n[problem:LibreOJ-2129]\n[problem:LibreOJ-2294]\n[problem:POJ-1733]\n[problem:POJ-1182]\n\n##### 0x42 树状树组\n[problem:洛谷-P3368]\n[problem:POJ-3468]\n[problem:POJ-2182]\n\n##### 0x43 线段树\n[problem:SPOJ-GSS3]\n[problem:POJ-1151]\n[problem:POJ-2482]\n\n##### 0x44 分块\n[problem:黑暗爆炸-2724]\n[problem:黑暗爆炸-3276]\n[problem:黑暗爆炸-2038]\n\n##### 0x45 点分治\n[problem:POJ-1741]\n\n##### 0x46 二叉查找树与平衡树初步\n[problem:LibreOJ-104]\n\n##### 0x47 离线分治算法\n[problem:黑暗爆炸-2716]\n[problem:POJ-2104]\n\n##### 0x48 可持久化数据结构\n[problem:黑暗爆炸-3261]\n\n##### 习题\n[problem:LibreOJ-2594]\n[problem:POJ-2912]\n[problem:POJ-1417]\n[problem:POJ-2828]\n[problem:POJ-3667]\n[problem:POJ-1177]\n[problem:黑暗爆炸-2821]\n[problem:黑暗爆炸-2599]\n[problem:LibreOJ-10143]\n[problem:POJ-3580]\n[problem:黑暗爆炸-1176]\n[problem:LibreOJ-2169]\n[problem:黑暗爆炸-2741]\n[problem:黑暗爆炸-3674]\n\n#### 0x50 动态规划\n##### 0x51 线性 DP\n[problem:POJ-2279]\n[problem:POJ-3666]\n[problem:洛谷-P1006]\n[problem:SGU-167]\n[problem:Gym-100340A]\n\n##### 0x52 背包\n[problem:OpenJ_NOI-CH0206-2985]\n[problem:POJ-1015]\n[problem:POJ-1742]\n\n##### 0x53 区间 DP\n[problem:LibreOJ-10147]\n[problem:POJ-1179]\n\n##### 0x54 树形 DP\n[problem:洛谷-P1352]\n[problem:LibreOJ-10154]\n[problem:POJ-3585]\n\n##### 0x55 环形与后效性处理\n[problem:POJ-2228]\n[problem:CodeForces-24D]\n\n##### 0x56 状态压缩 DP\n[problem:POJ-2411]\n[problem:POJ-1185]\n[problem:LibreOJ-2318]\n\n##### 0x57 倍增优化 DP\n[problem:LibreOJ-2604]\n\n##### 0x58 数据结构优化 DP\n[problem:POJ-2376]\n[problem:POJ-3171]\n[problem:HDU-5542]\n\n##### 0x59 单调队列优化 DP\n[problem:POJ-1821]\n[problem:POJ-3017]\n\n##### 0x5A 斜率优化\n[problem:LibreOJ-10184]\n[problem:POJ-1180]\n[problem:LibreOJ-10186]\n[problem:CodeForces-311B]\n\n##### 0x5B 四边形不等式\n[problem:洛谷-P1912]\n[problem:POJ-1738]\n\n##### 0x5C 计数类 DP\n[problem:CodeForces-559C]\n[problem:POJ-1737]\n[problem:洛谷-P6596]\n[problem:POJ-1037]\n\n##### 0x5D 数位统计 DP\n[problem:POJ-3208]\n[problem:洛谷-P4127]\n\n##### 习题\n[problem:LibreOJ-2593]\n[problem:洛谷-P1854]\n[problem:POJ-1952]\n[problem:POJ-1934]\n[problem:POJ-1722]\n[problem:POJ-1014]\n[problem:POJ-2176]\n[problem:LibreOJ-10148]\n[problem:POJ-1191]\n[problem:POJ-1390]\n[problem:POJ-1463]\n[problem:POJ-3345]\n[problem:HDU-2196]\n[problem:洛谷-P3211]\n[problem:POJ-2288]\n[problem:POJ-3254]\n[problem:POJ-1038]\n[problem:POJ-2374]\n[problem:HDU-4261]\n[problem:黑暗爆炸-1233]\n[problem:LibreOJ-10183]\n[problem:HDU-2870]\n[problem:POJ-3709]\n[problem:LibreOJ-10190]\n[problem:POJ-1160]\n[problem:POJ-1187]\n[problem:POJ-2282]\n[problem:POJ-3252]\n\n#### 0x60 图论\n##### 0x61 最短路\n[problem:POJ-3662]\n[problem:LibreOJ-2590]\n[problem:洛谷-P3008]\n[problem:POJ-1094]\n[problem:POJ-1734]\n[problem:POJ-3613]\n\n##### 0x62 最小生成树\n[problem:POJ-1639]\n[problem:POJ-2728]\n\n##### 0x63 树的直径与最近公共祖先\n[problem:洛谷-P3629]\n[problem:洛谷-P1099]\n[problem:POJ-3417]\n[problem:洛谷-P4556]\n[problem:LibreOJ-2359]\n[problem:LibreOJ-10132]\n[problem:LibreOJ-10133]\n[problem:LibreOJ-2607]\n\n##### 0x64 基环树\n[problem:黑暗爆炸-1791]\n[problem:黑暗爆炸-3037]\n[problem:黑暗爆炸-3047]\n\n##### 0x65 负环与差分约束\n[problem:POJ-3621]\n[problem:POJ-1201]\n\n##### 0x66 Tarjan 算法与无向图连通性\n[problem:POJ-3694]\n[problem:POJ-2942]\n[problem:POJ-2230]\n\n##### 0x67 Tarjan 算法与有向图连通性\n[problem:POJ-1236]\n[problem:OpenJ_POJ-1044]\n[problem:POJ-3678]\n[problem:POJ-3683]\n\n##### 0x68 二分图的匹配\n[problem:LibreOJ-2594]\n[problem:洛谷-U64949]\n[problem:POJ-3565]\n\n##### 0x69 二分图的覆盖与独立集\n[problem:POJ-1325]\n[problem:POJ-2226]\n[problem:黑暗爆炸-2718]\n\n##### 0x6A 网络流初步\n[problem:POJ-1966]\n[problem:POJ-3422]\n\n##### 习题\n[problem:POJ-3463]\n[problem:黑暗爆炸-3056]\n[problem:LibreOJ-2352]\n[problem:POJ-2349]\n[problem:黑暗爆炸-3058]\n[problem:洛谷-P3304]\n[problem:洛谷-P4408]\n[problem:LibreOJ-10136]\n[problem:LibreOJ-2691]\n[problem:POJ-1275]\n[problem:POJ-3177]\n[problem:LibreOJ-10099]\n[problem:HDU-3686]\n[problem:POJ-1041]\n[problem:LibreOJ-10110]\n[problem:POJ-2762]\n[problem:黑暗爆炸-2438]\n[problem:黑暗爆炸-1997]\n[problem:POJ-3648]\n[problem:POJ-1112]\n[problem:ZOJ-1654]\n[problem:POJ-3189]\n[problem:POJ-2195]\n[problem:POJ-1422]\n[problem:POJ-1486]\n[problem:POJ-1904]\n[problem:POJ-1273]","threadId":178053,"likeCnt":0,"createTime":1702523023000,"isWorkbook":true,"viewCnt":967,"openness":1,"fav":false,"id":4387,"trustable":false}
