Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"POJ-2773\":[\"Happy 2006\",4044,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.03.26\\\"\\u003ePOJ Monthly--2006.03.26\\u003c/a\\u003e,static\\u003c/div\\u003e\"],\"POJ-1321\":[\"棋盘问题\",36024,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003d%E8%94%A1%E9%94%99%40pku\\\"\\u003e蔡错@pku\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2531\":[\"Network Saboteur\",6352,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2002\\\"\\u003eNortheastern Europe 2002\\u003c/a\\u003e, Far-Eastern Subregion\\u003c/div\\u003e\"],\"UVA-11059\":[\"Maximum Product\",11114,null],\"POJ-2891\":[\"Strange Way to Express Integers\",5289,\"\\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\"],\"CodeForces-44A\":[\"Indian Summer\",12166,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/44\\\"\\u003eSchool Team Contest 2 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"洛谷-P8306\":[\"字典树\",14683,\"模板\"],\"POJ-2533\":[\"Longest Ordered Subsequence\",24547,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2002\\\"\\u003eNortheastern Europe 2002\\u003c/a\\u003e, Far-Eastern Subregion\\u003c/div\\u003e\"],\"POJ-2417\":[\"Discrete Logging\",2399,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+Local+2002.01.26\\\"\\u003eWaterloo Local 2002.01.26\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-4497\":[\"GCD and LCM\",1487,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+ACM-ICPC%BC%AA%C1%D6%CD%A8%BB%AF%C8%AB%B9%FA%D1%FB%C7%EB%C8%FC%A1%AA%A1%AA%CC%E2%C4%BF%D6%D8%CF%D6\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM-ICPC吉林通化全国邀请赛——题目重现 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3626\":[\"Mud Puddles\",1600,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+December+Silver\\\"\\u003eUSACO 2007 December Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2199\":[\"Can you solve this equation?\",10548,\"\"],\"POJ-3625\":[\"Building Roads\",2634,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+December+Silver\\\"\\u003eUSACO 2007 December Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-5463\":[\"Clarke and minecraft\",614,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2356+%28div.2%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #56 (div.2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"AtCoder-abc125_c\":[\"GCD on Blackboard\",2141,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc125\\\"\\u003eAtCoder Beginner Contest 125\\u003c/a\\u003e\"],\"洛谷-P1914\":[\"小书童——凯撒密码\",144686,null],\"OpenJ_Bailian-4017\":[\"爬楼梯\",3442,\"\"],\"OpenJ_Bailian-4137\":[\"最小新整数\",1751,\"\"],\"HDU-5104\":[\"Primes Problem\",1215,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2318\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #18 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4370\":[\"0 or 1\",1503,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+Multi-University+Training+Contest+8\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 8 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"OpenJ_Bailian-4124\":[\"海贼王之伟大航路\",1187,\"\"],\"OpenJ_Bailian-4123\":[\"马走日\",2581,\"\"],\"OpenJ_Bailian-4001\":[\"Catch That Cow\",3041,\"\"],\"POJ-1456\":[\"Supermarket\",8804,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2003\\\"\\u003eSoutheastern Europe 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"OpenJ_Bailian-3151\":[\"Pots\",344,\"\"],\"洛谷-P1803\":[\"凌乱的yyy / 线段覆盖\",68641,null],\"POJ-1579\":[\"Function Run Fun\",10661,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPacific+Northwest+1999\\\"\\u003ePacific Northwest 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1458\":[\"Common Subsequence\",26918,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2003\\\"\\u003eSoutheastern Europe 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2089\":[\"不要62\",26539,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D3%AD%BD%D3%D0%C2%D1%A7%C6%DA%A1%AA%A1%AA%B3%AC%BC%B6Easy%B0%E6%C8%C8%C9%ED%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 迎接新学期——超级Easy版热身赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"URAL-1132\":[\"Square Root\",1086,\"\"],\"洛谷-P1928\":[\"外星密码\",27394,null],\"洛谷-P1807\":[\"最长路\",24754,null],\"OpenJ_Bailian-4127\":[\"迷宫问题\",2571,\"\"],\"HDU-5358\":[\"First One\",751,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+Multi-University+Training+Contest+6\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 6 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"OpenJ_Bailian-4004\":[\"数字组合\",980,\"\"],\"洛谷-P8680\":[\"特别数的和\",10403,\"蓝桥杯 2019 省 B\"],\"HackerRank-vector-sort\":[\"Vector-Sort\",205979,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/master\\u0027 target\\u003d\\u0027_blank\\u0027\\u003emaster\\u003c/a\\u003e\"],\"洛谷-P6141\":[\"贪心的导游\",165,\"JSOI2013\"],\"HDU-2084\":[\"数塔\",35494,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2006%2F1%2F15+ACM%B3%CC%D0%F2%C9%E8%BC%C6%C6%DA%C4%A9%BF%BC%CA%D4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2006/1/15 ACM程序设计期末考试 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1661\":[\"Help Jimmy\",4907,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2004.05.15+CEOI+2000\\\"\\u003ePOJ Monthly--2004.05.15 CEOI 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2632\":[\"Crashing Robots\",5090,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNordic+2005\\\"\\u003eNordic 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2098\":[\"分拆素数和\",24807,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2007%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A82%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5128\":[\"The E-pang Palace\",988,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014ACM%2FICPC%D1%C7%D6%DE%C7%F8%B9%E3%D6%DD%D5%BE-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%BB%AA%B9%A4%BA%CD%B1%B1%B4%F3%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014ACM/ICPC亚洲区广州站-重现赛(感谢华工和北大) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1308\":[\"Is It A Tree?\",11126,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNorth+Central+North+America+1997\\\"\\u003eNorth Central North America 1997\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-1398C\":[\"Good Subarrays\",25088,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1398\\\"\\u003eEducational Codeforces Round 93 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-724B\":[\"Batch Sort\",4471,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/724\\\"\\u003eIntel Code Challenge Final Round (Div. 1 + Div. 2, Combined)\\u003c/a\\u003e\"],\"HDU-2094\":[\"产生冠军\",14112,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D3%AD%BD%D3%D0%C2%D1%A7%C6%DA%A1%AA%A1%AA%B3%AC%BC%B6Easy%B0%E6%C8%C8%C9%ED%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 迎接新学期——超级Easy版热身赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4394\":[\"Digital Square\",813,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+Multi-University+Training+Contest+10\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 10 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1797\":[\"Heavy Transportation\",12618,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTUD+Programming+Contest+2004\\\"\\u003eTUD Programming Contest 2004\\u003c/a\\u003e, Darmstadt, Germany\\u003c/div\\u003e\"],\"洛谷-P2910\":[\"Clear And Present Danger S\",13872,\"USACO08OPEN\"],\"洛谷-P8218\":[\"求区间和\",22659,\"深进1.例1\"],\"POJ-2524\":[\"Ubiquitous Religions\",17174,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dAlberta+Collegiate+Programming+Contest+2003.10.18\\\"\\u003eAlberta Collegiate Programming Contest 2003.10.18\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P2911\":[\"Bovine Bones G\",51844,\"USACO08OCT\"],\"POJ-3616\":[\"Milking Time\",8735,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+November+Silver\\\"\\u003eUSACO 2007 November Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P1824\":[\"进击的奶牛\",46609,null],\"洛谷-P1706\":[\"全排列问题\",109588,null],\"CodeForces-869A\":[\"The Artful Expedient\",10264,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/869\\\"\\u003eCodeforces Round 439 (Div. 2)\\u003c/a\\u003e\"],\"HDU-4283\":[\"You Are the One\",3611,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+ACM%2FICPC+Asia+Regional+Tianjin+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Tianjin Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1006\":[\"Biorhythms\",39068,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dEast+Central+North+America+1999\\\"\\u003eEast Central North America 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3666\":[\"Making the Grade\",5065,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2008+February+Gold\\\"\\u003eUSACO 2008 February Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P1957\":[\"口算练习题\",45884,null],\"洛谷-P2925\":[\"Hay For Sale S\",16170,\"USACO08DEC\"],\"HDU-5025\":[\"Saving Tang Monk\",775,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014+ACM%2FICPC+Asia+Regional+Guangzhou+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 ACM/ICPC Asia Regional Guangzhou Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1719\":[\"最大加权矩形\",28551,null],\"洛谷-P7149\":[\"Rectangular Pasture S\",849,\"USACO20DEC\"],\"POJ-2585\":[\"Window Pains\",1247,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouth+Central+USA+2003\\\"\\u003eSouth Central USA 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P1720\":[\"月落乌啼算钱(斐波那契数列)\",90463,null],\"POJ-1011\":[\"Sticks\",22389,\"\\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-1258\":[\"Agri-Net\",24174,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+102\\\"\\u003eUSACO 102\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P1843\":[\"奶牛晒衣服\",13685,null],\"洛谷-P1603\":[\"斯诺登的密码\",38903,null],\"POJ-1015\":[\"Jury Compromise\",7047,\"\\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\"],\"洛谷-T306565\":[\"找树根和孩子\",38,null],\"UVA-1599\":[\"Ideal Path\",1868,null],\"洛谷-P1967\":[\"货车运输\",29583,\"NOIP2013 提高组\"],\"洛谷-P2814\":[\"家谱\",15945,null],\"洛谷-P1969\":[\"积木大赛\",37255,\"NOIP2013 提高组\"],\"HDU-1905\":[\"Pseudoprime numbers\",1273,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008-1%BA%BC%B5%E7%B9%AB%BF%AA%C8%FC%28%B7%C7%D4%AD%B4%B4%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008-1杭电公开赛(非原创) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P9459\":[\"浴眼盯真\",3963,\"EZEC-14\"],\"HackerRank-cpp-sets\":[\"Sets-STL\",124252,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/master\\u0027 target\\u003d\\u0027_blank\\u0027\\u003emaster\\u003c/a\\u003e\"],\"洛谷-P9455\":[\"塔台超频 (Hard Version)\",967,\"入门赛 #14\"],\"POJ-3641\":[\"Pseudoprime numbers\",5599,\"\\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.23\\u003c/div\\u003e\"],\"UVA-12169\":[\"Disgruntled Judge\",1783,null],\"洛谷-T306591\":[\"求节点的祖先\",38,null],\"洛谷-P1610\":[\"鸿山洞的灯\",6290,null],\"CSES-1660\":[\"Subarray Sums I\",17881,\"Sorting and Searching\"],\"CSES-1661\":[\"Subarray Sums II\",16305,\"Sorting and Searching\"],\"洛谷-P2700\":[\"逐个击破\",3551,null],\"洛谷-P1614\":[\"爱与愁的心痛\",75577,null],\"洛谷-P3916\":[\"图的遍历\",36657,null],\"洛谷-P1616\":[\"疯狂的采药\",87400,null],\"洛谷-T306599\":[\"求节点的兄弟\",40,null],\"洛谷-T306596\":[\"求节点的子树\",33,null],\"洛谷-P1738\":[\"洛谷的文件夹\",3008,null],\"洛谷-P9228\":[\"原神\",3169,null],\"CSES-1662\":[\"Subarray Divisibility\",14776,\"Sorting and Searching\"],\"POJ-2560\":[\"Freckles\",3614,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2000.09.23\\\"\\u003eWaterloo local 2000.09.23\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P1980\":[\"计数问题\",203611,\"NOIP2013 普及组\"],\"POJ-1475\":[\"Pushing Boxes\",2426,\"\\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\"],\"HDU-1811\":[\"Rank of Tetris\",2934,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+2007+Summer+Exercise%A3%A82%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ 2007 Summer Exercise(2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1865\":[\"A % B Problem\",21856,null],\"POJ-2689\":[\"Prime Distance\",6154,\"\\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\"],\"CodeForces-1450B\":[\"Balls of Steel\",15121,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1450\\\"\\u003eCodeforces Global Round 12\\u003c/a\\u003e\"],\"洛谷-P1507\":[\"NASA的食物计划\",28906,null],\"CodeForces-825B\":[\"Five-In-a-Row\",4708,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"洛谷-P9472\":[\"枕万梦\",1392,\"yLOI2022\"],\"POJ-3660\":[\"Cow Contest\",11502,\"\\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\"],\"洛谷-P1993\":[\"小 K 的农场\",15920,null],\"POJ-2377\":[\"Bad Cowtractors\",6151,\"\\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\"],\"OpenJ_Bailian-3441\":[\"4 Values whose Sum is 0\",917,\"\"],\"POJ-2253\":[\"Frogger\",17729,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+1997\\\"\\u003eUlm Local 1997\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P1873\":[\"EKO / 砍树\",76153,\"COCI 2011/2012 #5\"],\"POJ-2259\":[\"Team Queue\",2880,\"\\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\"],\"洛谷-P1512\":[\"伊甸园日历游戏\",1704,null],\"洛谷-P1875\":[\"佳佳的魔法药水\",2712,null],\"洛谷-P1757\":[\"通天之分组背包\",28351,null],\"洛谷-P1877\":[\"音量调节\",10493,\"HAOI2012\"],\"洛谷-P1638\":[\"逛画展\",23184,null],\"洛谷-B2067\":[\"药房管理\",19368,null],\"SPOJ-SORT2D\":[\"2D-SORT\",3720,\"\"],\"洛谷-B2068\":[\"统计满足条件的 4 位数\",21095,null],\"洛谷-B2069\":[\"求分数序列和\",14471,null],\"洛谷-B2063\":[\"人口增长问题\",21868,null],\"洛谷-B2064\":[\"斐波那契数列\",30580,null],\"洛谷-B2065\":[\"鸡尾酒疗法\",18324,null],\"洛谷-B2066\":[\"救援\",14783,null],\"洛谷-B2060\":[\"满足条件的数累加\",27464,null],\"洛谷-B2061\":[\"整数的个数\",24973,null],\"洛谷-B2062\":[\"乘方计算\",27597,null],\"ZOJ-3593\":[\"One Person Game\",1571,null],\"洛谷-P1880\":[\"石子合并\",61220,\"NOI1995\"],\"POJ-2387\":[\"Til the Cows Come Home\",23279,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+November\\\"\\u003eUSACO 2004 November\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-85A\":[\"Domino\",1852,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/85\\\"\\u003eYandex.Algorithm 2011: Round 1\\u003c/a\\u003e\"],\"洛谷-P2853\":[\"Cow Picnic S\",13823,\"USACO06DEC\"],\"洛谷-P1887\":[\"乘积最大3\",19201,null],\"洛谷-P1403\":[\"约数研究\",25687,\"AHOI2005\"],\"洛谷-P1645\":[\"序列\",2848,null],\"洛谷-P1644\":[\"跳马问题\",17924,null],\"洛谷-P1765\":[\"手机\",71751,null],\"POJ-3358\":[\"Period of an Infinite Binary Expansion\",857,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dManila+2006\\\"\\u003eManila 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1716\":[\"排列2\",6546,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2007%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A82%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P2615\":[\"神奇的幻方\",87438,\"NOIP2015 提高组\"],\"洛谷-P1888\":[\"三角函数\",93904,null],\"洛谷-P2858\":[\"Treats for the Cows G/S\",12360,\"USACO06FEB\"],\"洛谷-B2056\":[\"求整数的和与均值\",27474,null],\"洛谷-B2057\":[\"最高的分数\",31694,null],\"洛谷-B2058\":[\"奥运奖牌计数\",27286,null],\"洛谷-B2059\":[\"奇数求和\",32394,null],\"洛谷-B2052\":[\"简单计算器\",30796,null],\"洛谷-B2053\":[\"求一元二次方程\",18129,null],\"洛谷-B2054\":[\"求平均年龄\",32977,null],\"洛谷-B2055\":[\"均值\",26907,null],\"洛谷-B2050\":[\"三角形判断\",33628,null],\"洛谷-B2051\":[\"点和正方形的关系\",25068,null],\"POJ-2031\":[\"Building a Space Station\",7343,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2003+Domestic\\\"\\u003eJapan 2003 Domestic\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1061\":[\"青蛙的约会\",23286,\"\\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\":[\"食物链\",25690,\"\\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-1062\":[\"昂贵的聘礼\",15020,\"\\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\"],\"OpenJ_Bailian-2251\":[\"Dungeon Master\",1463,\"Ulm Local 1997\"],\"洛谷-P1775\":[\"石子合并(弱化版)\",21848,null],\"POJ-2111\":[\"Millenium Leapcow\",640,\"\\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\\\"\\u003eUSACO 2003 U S Open\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P1776\":[\"宝物筛选\",28806,null],\"洛谷-P2865\":[\"Roadblocks G\",8524,\"USACO06NOV\"],\"POJ-2478\":[\"Farey Sequence\",7215,\"\\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\"],\"POJ-2236\":[\"Wireless Network\",16778,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly\\\"\\u003ePOJ Monthly\\u003c/a\\u003e,HQM\\u003c/div\\u003e\"],\"POJ-2115\":[\"C Looooops\",8031,\"\\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\"],\"洛谷-P1536\":[\"村村通\",31053,null],\"POJ-1029\":[\"False coin\",6637,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+1998\\\"\\u003eNortheastern Europe 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-939E\":[\"Maximize!\",3423,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/939\\\"\\u003eCodeforces Round 464 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-B2089\":[\"数组逆序重存放\",25567,null],\"洛谷-B2085\":[\"第 n 小的质数\",15133,null],\"洛谷-B2086\":[\"不定方程求解\",11467,null],\"洛谷-B2087\":[\"与指定数字相同的数的个数\",16570,null],\"洛谷-B2088\":[\"计算书费\",15674,null],\"黑暗爆炸-1303\":[\"中位数图\",197,\"CQOI2009\"],\"洛谷-B2081\":[\"与 7 无关的数\",16469,null],\"洛谷-B2082\":[\"数字统计\",16617,null],\"洛谷-B2083\":[\"画矩形\",17337,null],\"洛谷-B2084\":[\"质因数分解\",19728,null],\"洛谷-B2080\":[\"计算多项式的值\",11032,null],\"POJ-2240\":[\"Arbitrage\",9918,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+1996\\\"\\u003eUlm Local 1996\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1973\":[\"Prime Path\",788,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dNWERC2006\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e NWERC2006 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1420\":[\"最长连号\",109899,null],\"洛谷-P1423\":[\"小玉在游泳\",189957,null],\"洛谷-P2512\":[\"糖果传递\",7758,\"HAOI2008\"],\"POJ-2001\":[\"Shortest Prefixes\",8922,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dRocky+Mountain+2004\\\"\\u003eRocky Mountain 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2485\":[\"Highways\",13353,\"\\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\"],\"洛谷-P1422\":[\"小玉家的电费\",228430,null],\"洛谷-P1304\":[\"哥德巴赫猜想\",79948,null],\"洛谷-P1546\":[\"最短网络 Agri-Net\",26527,\"USACO3.1\"],\"洛谷-P1424\":[\"小鱼的航程(改进版)\",171983,null],\"POJ-2488\":[\"A Knight\\u0027s Journey\",16957,\"\\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\",6141,\"\\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\"],\"洛谷-P1548\":[\"棋盘问题\",36622,\"NOIP1997 普及组\"],\"洛谷-P1427\":[\"小鱼的数字游戏\",220396,null],\"洛谷-P1789\":[\"插火把\",56586,\"Mc生存\"],\"洛谷-P1308\":[\"统计单词数\",112382,\"NOIP2011 普及组\"],\"CodeForces-189A\":[\"Cut Ribbon\",67725,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/189\\\"\\u003eCodeforces Round 119 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1307\":[\"数字反转\",177763,\"NOIP2011 普及组\"],\"洛谷-P1428\":[\"小鱼比可爱\",206908,null],\"洛谷-B2078\":[\"含 k 个 3 的数\",19431,null],\"洛谷-B2079\":[\"求出 e 的值\",14502,null],\"洛谷-B2074\":[\"计算星期几\",17483,null],\"洛谷-B2075\":[\"幂的末尾\",15412,null],\"洛谷-B2076\":[\"球弹跳高度的计算\",16971,null],\"洛谷-B2077\":[\"角谷猜想\",20962,null],\"洛谷-B2070\":[\"计算分数加减表达式的值\",14111,null],\"洛谷-B2071\":[\"余数相同问题\",18220,null],\"HDU-6186\":[\"CS Course\",1472,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2017ACM%2FICPC%B9%E3%CE%F7%D1%FB%C7%EB%C8%FC-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%B9%E3%CE%F7%B4%F3%D1%A7%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2017ACM/ICPC广西邀请赛-重现赛(感谢广西大学) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B2072\":[\"分苹果\",20885,null],\"洛谷-B2073\":[\"求小数的某一位\",14619,null],\"HDU-1728\":[\"逃离迷宫\",6130,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%A1%B0%CD%F8%D0%C2%B6%F7%C6%D5%B1%AD%A1%B1%BA%BC%D6%DD%B5%E7%D7%D3%BF%C6%BC%BC%B4%F3%D1%A7%B3%CC%D0%F2%C9%E8%BC%C6%D1%FB%C7%EB%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e “网新恩普杯”杭州电子科技大学程序设计邀请赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2251\":[\"Dungeon Master\",22065,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+1997\\\"\\u003eUlm Local 1997\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-400\":[\"Unix ls\",8402,null],\"POJ-3461\":[\"Oulipo\",16518,\"\\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-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\"],\"洛谷-P1551\":[\"亲戚\",69690,null],\"洛谷-P2882\":[\"Face The Right Way G\",3227,\"USACO07MAR\"],\"POJ-2492\":[\"A Bug\\u0027s Life\",12036,\"\\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\"],\"洛谷-P1550\":[\"Watering Hole G\",8899,\"USACO08OCT\"],\"HDU-1501\":[\"Zipper\",3442,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dPacific+Northwest+2004\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Pacific Northwest 2004 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1553\":[\"数字反转(升级版)\",60966,null],\"POJ-3268\":[\"Silver Cow Party\",14886,\"\\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\"],\"洛谷-P1434\":[\"滑雪\",66305,\"SHOI2002\"],\"洛谷-P1554\":[\"梦中的统计\",99508,null],\"洛谷-P1678\":[\"烦恼的高考志愿\",43947,null],\"洛谷-P1314\":[\"聪明的质监员\",24228,\"NOIP2011 提高组\"],\"洛谷-P1319\":[\"压缩技术\",70193,null],\"洛谷-P9160\":[\"multiset\",260,null],\"HDU-1619\":[\"Unidirectional TSP\",597,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUVA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e UVA \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1320\":[\"压缩技术(续集版)\",45689,null],\"POJ-3278\":[\"Catch That Cow\",40186,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+Open+Silver\\\"\\u003eUSACO 2007 Open Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P1443\":[\"马的遍历\",95236,null],\"洛谷-P3985\":[\"不开心的金明\",4456,null],\"洛谷-P1200\":[\"你的飞碟在这儿 Your Ride Is Here\",127173,\"USACO1.1\"],\"洛谷-P1321\":[\"单词覆盖还原\",54600,null],\"洛谷-P3741\":[\"小果的键盘\",46124,null],\"洛谷-P1205\":[\"方块转换 Transformations\",27874,\"USACO1.2\"],\"洛谷-P2415\":[\"集合求和\",43551,null],\"POJ-3159\":[\"Candies\",7650,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.12.31\\\"\\u003ePOJ Monthly--2006.12.31\\u003c/a\\u003e, Sempr\\u003c/div\\u003e\"],\"洛谷-P4956\":[\"Davor\",55489,\"COCI2017-2018#6\"],\"洛谷-P2419\":[\"Cow Contest S\",10186,\"USACO08JAN\"],\"CodeForces-908B\":[\"New Year and Buggy Bot\",8456,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/908\\\"\\u003eGood Bye 2017\\u003c/a\\u003e\"],\"洛谷-B2096\":[\"直方图\",13590,null],\"洛谷-B2097\":[\"最长平台\",15420,null],\"洛谷-B2098\":[\"整数去重\",19474,null],\"洛谷-B2099\":[\"矩阵交换行\",16407,null],\"洛谷-B2092\":[\"开关灯\",22065,null],\"洛谷-P9050\":[\"Sumy\",418,\"PA2021\"],\"洛谷-B2093\":[\"查找特定的值\",19172,null],\"洛谷-B2094\":[\"不与最大数相同的数字之和\",18065,null],\"洛谷-B2095\":[\"白细胞计数\",13309,null],\"洛谷-B2090\":[\"年龄与疾病\",16177,null],\"POJ-3280\":[\"Cheapest Palindrome\",6642,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+Open+Gold\\\"\\u003eUSACO 2007 Open Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-B2091\":[\"向量点积计算\",15234,null],\"洛谷-P1571\":[\"眼红的Medusa\",19582,null],\"HDU-2611\":[\"Sequence two\",276,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B7%DC%B6%B7%B5%C4%C4%EA%B4%FA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 奋斗的年代 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"OpenJ_Bailian-1088\":[\"滑雪\",7116,\"Don\\u0027t know\"],\"POJ-3243\":[\"Clever Y\",1289,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.07.08\\\"\\u003ePOJ Monthly--2007.07.08\\u003c/a\\u003e, Guo, Huayang\\u003c/div\\u003e\"],\"洛谷-P1579\":[\"哥德巴赫猜想(升级版)\",46726,null],\"HDU-2859\":[\"Phalanx\",2382,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+5+-+Host+by+NUDT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 5 - Host by NUDT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P2669\":[\"金币\",157263,\"NOIP2015 普及组\"],\"洛谷-P1217\":[\"回文质数 Prime Palindromes\",116316,\"USACO1.5\"],\"洛谷-P1219\":[\"八皇后 Checker Challenge\",118397,\"USACO1.5\"],\"OpenJ_Bailian-4116\":[\"拯救行动\",1174,\"\"],\"HDU-2610\":[\"Sequence one\",421,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B7%DC%B6%B7%B5%C4%C4%EA%B4%FA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 奋斗的年代 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"OpenJ_Bailian-4115\":[\"鸣人和佐助\",1377,\"\"],\"洛谷-P9064\":[\"苦竹林\",1860,\"yLOI2023\"],\"洛谷-T219817\":[\"树的重心\",75,null],\"洛谷-T219819\":[\"树的最长路径\",37,null],\"洛谷-T219818\":[\"树的直径\",99,null],\"POJ-1190\":[\"生日蛋糕\",7626,\"\\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\"],\"洛谷-P2550\":[\"彩票摇奖\",80345,\"AHOI2001\"],\"POJ-3253\":[\"Fence Repair\",21133,\"\\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\"],\"洛谷-P1462\":[\"通往奥格瑞玛的道路\",19499,null],\"计蒜客-A2238\":[\"程序设计:找质数\",2754,null],\"洛谷-P1223\":[\"排队接水\",94931,null],\"洛谷-P1102\":[\"A-B 数对\",91446,null],\"洛谷-P2433\":[\"小学数学 N 合一\",83475,\"深基1-2\"],\"HDU-1412\":[\"{A} + {B}\",13677,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2006-5+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2006-5 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1101\":[\"单词方阵\",42538,null],\"洛谷-P1464\":[\"Function\",65475,null],\"洛谷-P3403\":[\"跳楼机\",4902,null],\"AtCoder-abc260_e\":[\"At Least One\",855,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc260\\\"\\u003eAtCoder Beginner Contest 260\\u003c/a\\u003e\"],\"洛谷-P1104\":[\"生日\",57240,null],\"POJ-1077\":[\"Eight\",7874,\"\\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\"],\"计蒜客-T3004\":[\"DD 爱数数\",1136,null],\"洛谷-P1466\":[\"集合 Subset Sums\",11379,\"USACO2.2\"],\"洛谷-P2676\":[\"Bookshelf B\",60750,\"USACO07DEC\"],\"HDU-1417\":[\"Gleaming the Cubes\",254,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM%CA%EE%C6%DA%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A8%D2%BB%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM暑期集训队练习赛(一) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P2437\":[\"蜜蜂路线\",27733,null],\"洛谷-P1106\":[\"删数问题\",53198,null],\"洛谷-P3406\":[\"海底高铁\",15823,null],\"洛谷-P1347\":[\"排序\",10293,null],\"洛谷-P2678\":[\"跳石头\",82764,\"NOIP2015 提高组\"],\"POJ-3259\":[\"Wormholes\",19365,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+December+Gold\\\"\\u003eUSACO 2006 December Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"LightOJ-1074\":[\"Extended Traffic\",2942,null],\"洛谷-P5709\":[\"Apples Prologue / 苹果和虫子\",136741,\"深基2.习6\"],\"洛谷-P1109\":[\"学生分组\",16009,null],\"HDU-1530\":[\"Maximum Clique\",1608,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZOJ+Monthly%2C+February+2003\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ZOJ Monthly, February 2003 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10815\":[\"Andy\\u0027s First Dictionary\",24690,null],\"洛谷-P1230\":[\"智力大冲浪\",11956,null],\"洛谷-P1111\":[\"修复公路\",42126,null],\"洛谷-P1113\":[\"杂务\",29517,null],\"洛谷-P1597\":[\"语句解析\",43241,null],\"洛谷-P5713\":[\"洛谷团队系统\",122900,\"深基3.例5\"],\"洛谷-P1596\":[\"Lake Counting S\",48201,\"USACO10OCT\"],\"洛谷-P2564\":[\"生日礼物\",4053,\"SCOI2009\"],\"洛谷-P5712\":[\"Apples\",135312,\"深基3.例4\"],\"HDU-1789\":[\"Doing Homework again\",10485,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2007%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A810%A3%A9_%D2%D4%B4%CB%B8%D0%D0%BBDOOMIII\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(10)_以此感谢DOOMIII \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1115\":[\"最大子段和\",111664,null],\"洛谷-P1478\":[\"陶陶摘苹果(升级版)\",78571,null],\"洛谷-P5711\":[\"闰年判断\",159328,\"深基3.例3\"],\"洛谷-P1598\":[\"垂直柱状图\",61563,null],\"洛谷-P5710\":[\"数的性质\",141537,\"深基3.例2\"],\"HDU-1428\":[\"漫步校园\",1284,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d+ACM%CA%EE%C6%DA%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A8%C8%FD%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM暑期集训队练习赛(三) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P5717\":[\"三角形分类\",89471,\"深基3.习8\"],\"洛谷-P2327\":[\"扫雷\",7650,\"SCOI2005\"],\"洛谷-B2108\":[\"图像模糊处理\",9582,null],\"洛谷-P5716\":[\"月份天数\",114783,\"深基3.例9\"],\"洛谷-B2109\":[\"统计数字字符个数\",18523,null],\"洛谷-P1119\":[\"灾后重建\",28004,null],\"洛谷-P5715\":[\"三位数排序\",132426,\"深基3.例8\"],\"洛谷-P5714\":[\"肥胖问题\",112963,\"深基3.例7\"],\"洛谷-B2104\":[\"矩阵加法\",15898,null],\"OpenJ_Bailian-1426\":[\"Find The Multiple\",881,\"Dhaka 2002\"],\"洛谷-B2105\":[\"矩阵乘法\",13381,null],\"洛谷-P5719\":[\"分类平均\",115554,\"深基4.例3\"],\"洛谷-B2106\":[\"矩阵转置\",13687,null],\"洛谷-P5718\":[\"找最小值\",159281,\"深基4.例2\"],\"洛谷-B2107\":[\"图像旋转\",11717,null],\"HDU-1541\":[\"Stars\",4437,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUral+Collegiate+Programming+Contest+1999\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Ural Collegiate Programming Contest 1999 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B2100\":[\"同行列对角线的格\",10066,null],\"洛谷-B2101\":[\"计算矩阵边缘元素之和\",16650,null],\"洛谷-B2102\":[\"计算鞍点\",11980,null],\"洛谷-B2103\":[\"图像相似度\",12440,null],\"SPOJ-IITKWPCA\":[\"Niceness of the string\",1345,\"IITK ACA CSE online judge\"],\"UVA-136\":[\"Ugly Numbers\",31823,null],\"洛谷-P5720\":[\"一尺之棰\",122110,\"深基4.例4\"],\"洛谷-P1483\":[\"序列变换\",1890,null],\"洛谷-P5960\":[\"差分约束\",18301,\"模板\"],\"洛谷-P1003\":[\"铺地毯\",154533,\"NOIP2011 提高组\"],\"洛谷-P5724\":[\"求极差 / 最大跨度值\",83185,\"深基4.习5\"],\"洛谷-P1124\":[\"文件压缩\",4181,null],\"Gym-102951D\":[\"Static Range Queries\",608,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102951\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eUSACO Guide Problem Submission\\u003c/a\\u003e\"],\"洛谷-P1002\":[\"过河卒\",184474,\"NOIP2002 普及组\"],\"洛谷-P5723\":[\"质数口袋\",92313,\"深基4.例13\"],\"HDU-1558\":[\"Segment set\",1529,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2006-12+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2006-12 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2647\":[\"Reward\",4533,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D4%F8%CA%C7%BE%AA%BA%E8%D5%D5%D3%B0%C0%B4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 曾是惊鸿照影来 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P5722\":[\"数列求和\",105906,\"深基4.例11\"],\"洛谷-P5721\":[\"数字直角三角形\",101336,\"深基4.例6\"],\"洛谷-P1125\":[\"笨小猴\",104542,\"NOIP2008 提高组\"],\"洛谷-P5728\":[\"旗鼓相当的对手\",83026,\"深基5.例5\"],\"CodeForces-333E\":[\"Summer Earnings\",1170,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/333\\\"\\u003eCodeforces Round 194 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P5727\":[\"冰雹猜想\",104441,\"深基5.例3\"],\"洛谷-P1009\":[\"阶乘之和\",138419,\"NOIP1998 普及组\"],\"洛谷-P5726\":[\"打分\",81464,\"深基4.习9\"],\"洛谷-P5725\":[\"求三角形\",62547,\"深基4.习8\"],\"AtCoder-abc284_d\":[\"Happy New Year 2023 \",4208,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc284\\\"\\u003eAtCoder Beginner Contest 284\\u003c/a\\u003e\"],\"洛谷-P5729\":[\"工艺品制作\",51346,\"深基5.例7\"],\"HDU-1431\":[\"素数回文\",4826,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dzjut\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e zjut \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B3663\":[\"Luogu Academic\",3329,\"语言月赛202209\"],\"洛谷-T219455\":[\"还原二叉树\",163,null],\"洛谷-T219454\":[\"遍历二叉树\",238,null],\"洛谷-P2580\":[\"于是他错误的点名开始了\",32737,null],\"洛谷-P5731\":[\"蛇形方阵\",60571,\"深基5.习6\"],\"洛谷-P5730\":[\"显示屏\",39437,\"深基5.例10\"],\"洛谷-P1135\":[\"奇怪的电梯\",83773,null],\"洛谷-P5735\":[\"距离函数\",74023,\"深基7.例1\"],\"POJ-3169\":[\"Layout\",7273,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+December+Gold\\\"\\u003eUSACO 2005 December Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P5734\":[\"文字处理软件\",48672,\"深基6.例6\"],\"洛谷-P1137\":[\"旅行计划\",14621,null],\"洛谷-P1258\":[\"小车问题\",12214,null],\"洛谷-P2347\":[\"砝码称重\",25545,\"NOIP1996 提高组\"],\"洛谷-P5733\":[\"自动修正\",106797,\"深基6.例1\"],\"POJ-2078\":[\"Matrix\",1696,\"\\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\"],\"洛谷-P5732\":[\"杨辉三角\",80491,\"深基5.习7\"],\"洛谷-P5739\":[\"计算阶乘\",86011,\"深基7.例7\"],\"洛谷-B2009\":[\"计算 (a+b)/c 的值\",66366,null],\"洛谷-P1138\":[\"第 k 小整数\",53457,null],\"洛谷-P5738\":[\"歌唱比赛\",53845,\"深基7.例4\"],\"洛谷-P5737\":[\"闰年展示\",73148,\"深基7.例3\"],\"洛谷-P7912\":[\"小熊的果篮\",13963,\"CSP-J 2021\"],\"洛谷-P5736\":[\"质数筛\",78300,\"深基7.例2\"],\"CodeForces-356C\":[\"Compartments\",1370,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/356\\\"\\u003eCodeforces Round 207 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-B2005\":[\"字符三角形\",161187,null],\"洛谷-B2006\":[\"地球人口承载力估计\",47862,null],\"洛谷-B2007\":[\"A + B 问题\",75465,null],\"洛谷-B2008\":[\"计算 (a+b)×c 的值\",73259,null],\"洛谷-B2001\":[\"入门测试题目\",95324,null],\"洛谷-B2002\":[\"Hello,World!\",244802,null],\"洛谷-B2003\":[\"输出第二个整数\",93922,null],\"洛谷-B2124\":[\"判断字符串是否为回文\",16007,null],\"OpenJ_Bailian-1321\":[\"棋盘问题\",4304,\"蔡错@pku\"],\"洛谷-B2004\":[\"对齐输出\",65799,null],\"洛谷-B2125\":[\"最高分数的学生姓名\",10722,null],\"ZOJ-3537\":[\"Cake\",1577,null],\"洛谷-P5742\":[\"评等级\",45397,\"深基7.例11\"],\"洛谷-P5741\":[\"旗鼓相当的对手 - 加强版\",45329,\"深基7.例10\"],\"洛谷-P1144\":[\"最短路计数\",40095,null],\"洛谷-P5740\":[\"最厉害的学生\",69363,\"深基7.例9\"],\"洛谷-P1022\":[\"计算器的改良\",36036,\"NOIP2000 普及组\"],\"HDU-4725\":[\"The Shortest Path in Nya Graph\",2869,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+ACM%2FICPC+Asia+Regional+Online+%A1%AA%A1%AA+Warmup2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Online —— Warmup2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1025\":[\"数的划分\",73001,\"NOIP2001 提高组\"],\"洛谷-P4414\":[\"ABC\",88136,\"COCI2006-2007#2\"],\"洛谷-P1024\":[\"一元三次方程求解\",82525,\"NOIP2001 提高组\"],\"洛谷-P1387\":[\"最大正方形\",36993,null],\"洛谷-P5745\":[\"区间最大和\",4239,\"深基附B例\"],\"HDU-2669\":[\"Romantic\",4893,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU%C5%AE%C9%FA%D7%A8%B3%A1%B9%AB%BF%AA%C8%FC%A1%AA%A1%AA%CB%AD%CB%B5%C5%AE%D7%D3%B2%BB%C8%E7%C4%D0\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU女生专场公开赛——谁说女子不如男 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1148\":[\"拱猪计分\",2027,null],\"洛谷-P5744\":[\"培训\",48172,\"深基7.习9\"],\"洛谷-P1147\":[\"连续自然数和\",43995,null],\"洛谷-P5743\":[\"猴子吃桃\",65264,\"深基7.习8\"],\"洛谷-B2119\":[\"删除单词后缀\",10231,null],\"洛谷-P1149\":[\"火柴棒等式\",82227,\"NOIP2008 提高组\"],\"HDU-5938\":[\"Four Operations\",1828,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016%C4%EA%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC%A3%A8%BA%BC%D6%DD%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016年中国大学生程序设计竞赛(杭州) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P4779\":[\"单源最短路径(标准版)\",125526,\"模板\"],\"CodeForces-149D\":[\"Coloring Brackets\",4951,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/149\\\"\\u003eCodeforces Round 106 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-B2116\":[\"加密的病历单\",8906,null],\"UVA-10976\":[\"Fractions Again?!\",11313,null],\"洛谷-B2117\":[\"整理药名\",9776,null],\"HDU-1573\":[\"X问题\",2492,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-1+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-1 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1455\":[\"Sticks\",3138,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM%CA%EE%C6%DA%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A8%C6%DF%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM暑期集训队练习赛(七) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1576\":[\"A/B\",10672,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-1+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-1 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B2113\":[\"输出亲朋字符串\",12094,null],\"HDU-4841\":[\"圆桌问题\",4395,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAHOI1999\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e AHOI1999 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1002\":[\"Fire Net\",19799,null],\"CodeForces-1765M\":[\"Minimum LCM\",13531,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1765\\\"\\u003e2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams)\\u003c/a\\u003e\"],\"POJ-3061\":[\"Subsequence\",14660,\"\\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\"],\"洛谷-P1151\":[\"子数整数\",65462,null],\"POJ-3186\":[\"Treats for the Cows\",4865,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+February+Gold+%26+Silver\\\"\\u003eUSACO 2006 February Gold \\u0026amp; Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-670C\":[\"Cinema\",10689,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/670\\\"\\u003eCodeforces Round 350 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2363\":[\"马农\",873,null],\"洛谷-P1031\":[\"均分纸牌\",76197,\"NOIP2002 提高组\"],\"洛谷-P1276\":[\"校门外的树(增强版)\",10962,null],\"洛谷-P1396\":[\"营救\",23385,null],\"HDU-4857\":[\"逃生\",3131,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%231\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1036\":[\"选数\",159985,\"NOIP2002 普及组\"],\"洛谷-P2367\":[\"语文成绩\",33944,null],\"洛谷-P1278\":[\"单词游戏\",3937,null],\"洛谷-P2004\":[\"领地选择\",20913,null],\"洛谷-P1035\":[\"级数求和\",294722,\"NOIP2002 普及组\"],\"洛谷-P1159\":[\"排行榜\",4116,null],\"洛谷-P1037\":[\"产生数\",19255,\"NOIP2002 普及组\"],\"洛谷-P2249\":[\"查找\",110778,\"深基13.例1\"],\"洛谷-P5638\":[\"光骓者的荣耀\",19680,\"CSGRound2\"],\"洛谷-B2027\":[\"计算球的体积\",36392,null],\"洛谷-B2028\":[\"反向输出一个三位数\",46370,null],\"洛谷-B2029\":[\"大象喝水\",104410,null],\"HDU-2553\":[\"N皇后问题\",19999,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+HZNU+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 HZNU Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"OpenJ_Bailian-2797\":[\"最短前缀\",3746,\"翻译自Rocky Mountain 2004\"],\"洛谷-B2023\":[\"空格分隔输出\",35165,null],\"洛谷-B2144\":[\"阿克曼(Ackermann)函数\",12866,null],\"洛谷-B2024\":[\"输出浮点数\",31194,null],\"OpenJ_Bailian-2795\":[\"金银岛\",3103,\"\"],\"洛谷-B2025\":[\"输出字符菱形\",160507,null],\"洛谷-B2146\":[\"Hermite 多项式\",8455,null],\"洛谷-B2026\":[\"计算浮点数相除的余\",28211,null],\"洛谷-B2020\":[\"分糖果\",31626,null],\"洛谷-B2021\":[\"输出保留 3 位小数的浮点数\",44756,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\"],\"洛谷-B2022\":[\"输出保留 12 位小数的浮点数\",40705,null],\"洛谷-T219519\":[\"还原表达式树\",167,null],\"洛谷-P1160\":[\"队列安排\",42545,null],\"洛谷-P2370\":[\"yyy2015c01 的 U 盘\",4676,null],\"洛谷-P1161\":[\"开灯\",72141,null],\"洛谷-P1164\":[\"小A点菜\",76804,null],\"洛谷-P4552\":[\"IncDec Sequence\",11708,\"Poetize6\"],\"HDU-3416\":[\"Marriage Match IV\",1526,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+Monthly+Contest+%A8C+2010.06.05\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.06.05 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1047\":[\"校门外的树\",255496,\"NOIP2005 普及组\"],\"洛谷-P1046\":[\"陶陶摘苹果\",299139,\"NOIP2005 普及组\"],\"洛谷-P1049\":[\"装箱问题\",105520,\"NOIP2001 普及组\"],\"CodeForces-1832B\":[\"Maximum Sum\",20088,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1832\\\"\\u003eEducational Codeforces Round 148 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1048\":[\"采药\",189977,\"NOIP2005 普及组\"],\"洛谷-B2016\":[\"浮点数向零舍入\",39013,null],\"洛谷-B2137\":[\"判决素数个数\",9440,null],\"洛谷-B2017\":[\"打印 ASCII 码\",51332,null],\"洛谷-B2138\":[\"最大质因子序列\",6481,null],\"洛谷-B2018\":[\"打印字符\",46635,null],\"洛谷-B2139\":[\"区间内的真素数\",5749,null],\"洛谷-B2019\":[\"整型与布尔型的转换\",39594,null],\"HDU-1233\":[\"还是畅通工程\",22244,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%B4%F3%BC%C6%CB%E3%BB%FA%D1%D0%BE%BF%C9%FA%B8%B4%CA%D4%C9%CF%BB%FA%BF%BC%CA%D4-2006%C4%EA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙大计算机研究生复试上机考试-2006年 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B2012\":[\"甲流疫情死亡率\",49578,null],\"洛谷-B2133\":[\"我家的门牌号\",8081,null],\"洛谷-T219653\":[\"多关键字排序\",177,null],\"HDU-1232\":[\"畅通工程\",32009,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%B4%F3%BC%C6%CB%E3%BB%FA%D1%D0%BE%BF%C9%FA%B8%B4%CA%D4%C9%CF%BB%FA%BF%BC%CA%D4-2005%C4%EA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙大计算机研究生复试上机考试-2005年 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B2013\":[\"温度表达转化\",48462,null],\"洛谷-B2134\":[\"质数的和与积\",9659,null],\"洛谷-T219652\":[\"排序与编号\",185,null],\"HDU-1114\":[\"Piggy-Bank\",18606,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dCentral+Europe+1999\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Central Europe 1999 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B2014\":[\"与圆相关的计算\",46818,null],\"洛谷-B2135\":[\"单词替换\",7115,null],\"洛谷-T219655\":[\"不同关键字排序\",96,null],\"洛谷-B2015\":[\"计算并联电阻的阻值\",41479,null],\"洛谷-B2136\":[\"素数回文数的个数\",10509,null],\"洛谷-T219654\":[\"排序与位置\",185,null],\"洛谷-B2130\":[\"简单算术表达式求值\",8758,null],\"洛谷-B2010\":[\"带余除法\",63490,null],\"洛谷-B2131\":[\"甲流病人初筛\",9151,null],\"洛谷-B2011\":[\"计算分数的浮点数值\",52052,null],\"洛谷-B2132\":[\"素数对\",10802,null],\"洛谷-P2141\":[\"珠心算测验\",141796,\"NOIP2014 普及组\"],\"洛谷-P8800\":[\"卡牌\",2182,\"蓝桥杯 2022 国 B\"],\"UVA-101\":[\"The Blocks Problem\",22955,null],\"洛谷-P1055\":[\"ISBN 号码\",179947,\"NOIP2008 普及组\"],\"洛谷-P4568\":[\"飞行路线\",16634,\"JLOI2011\"],\"洛谷-P4445\":[\"报名签到\",16794,\"AHOI2018初中组\"],\"洛谷-P1059\":[\"明明的随机数\",192400,\"NOIP2006 普及组\"],\"洛谷-P7714\":[\"排列排序\",2775,\"EZEC-10\"],\"HDU-4992\":[\"Primitive Roots\",296,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%238\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #8 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B2049\":[\"最大数输出\",35517,null],\"HDU-2570\":[\"迷瘴\",5859,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM%B3%CC%D0%F2%C9%E8%BC%C6%C6%DA%C4%A9%BF%BC%CA%D4081230\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM程序设计期末考试081230 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10305\":[\"Ordering Tasks\",23379,null],\"HDU-1241\":[\"Oil Deposits\",26336,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Central+USA+1997\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central USA 1997 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B2045\":[\"晶晶赴约会\",35853,null],\"洛谷-B2046\":[\"骑车与走路\",32398,null],\"HDU-1004\":[\"Let the Balloon Rise\",60312,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZJCPC2004\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ZJCPC2004 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B2047\":[\"分段函数\",28085,null],\"HDU-3664\":[\"Permutation Counting\",866,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Regional+Harbin\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Regional Harbin \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-11754\":[\"Code Feat\",784,null],\"洛谷-B2048\":[\"计算邮资\",29227,null],\"洛谷-B2041\":[\"收集瓶盖赢大奖\",37206,null],\"洛谷-B2042\":[\"判断一个数能否同时被 3 和 5 整除\",40158,null],\"洛谷-T219656\":[\"区间排序\",141,null],\"洛谷-B2043\":[\"判断能否被 3,5,7 整除\",41094,null],\"洛谷-B2044\":[\"有一门课不及格的学生\",37311,null],\"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\"],\"CodeForces-1732C1\":[\"Sheikh (Easy version)\",5650,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1732\\\"\\u003eCodeforces Round 830 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-B2040\":[\"判断是否为两位数\",39468,null],\"洛谷-P1182\":[\"数列分段 Section II\",55100,null],\"洛谷-P1060\":[\"开心的金明\",90378,\"NOIP2006 普及组\"],\"洛谷-P1063\":[\"能量项链\",45803,\"NOIP2006 提高组\"],\"洛谷-P1065\":[\"作业调度方案\",13609,\"NOIP2006 提高组\"],\"洛谷-P3366\":[\"最小生成树\",126586,\"模板\"],\"洛谷-P1064\":[\"金明的预算方案\",45100,\"NOIP2006 提高组\"],\"洛谷-P5662\":[\"纪念品\",24526,\"CSP-J2019\"],\"HDU-1016\":[\"Prime Ring Problem\",25769,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+1996%2C+Shanghai+%28Mainland+China%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 1996, Shanghai (Mainland China) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1258\":[\"Sum It Up\",3388,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙江工业大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1068\":[\"分数线划定\",89913,\"NOIP2009 普及组\"],\"洛谷-P3367\":[\"并查集\",100177,\"模板\"],\"HackerRank-cpp-maps\":[\"Maps-STL\",111808,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/master\\u0027 target\\u003d\\u0027_blank\\u0027\\u003emaster\\u003c/a\\u003e\"],\"洛谷-B2038\":[\"奇偶 ASCII 值判断\",34829,null],\"洛谷-B2039\":[\"整数大小比较\",39509,null],\"HDU-1010\":[\"Tempter of the Bone\",25355,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZJCPC2004\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ZJCPC2004 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"OpenJ_Bailian-3414\":[\"Tower of Hanoi\",31,\"PKU Campus 2008, xfxyjwf\"],\"HDU-2102\":[\"A计划\",7237,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-6+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-6 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1496\":[\"Equations\",2986,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%A1%B02006%D0%A3%D4%B0%CE%C4%BB%AF%BB%EE%B6%AF%D4%C2%A1%B1%D6%AE%A1%B0%D0%A3%C7%EC%B1%AD%A1%B1%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC%F4%DF%BA%BC%D6%DD%B5%E7%D7%D3%BF%C6%BC%BC%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e “2006校园文化活动月”之“校庆杯”大学生程序设计竞赛暨杭州电子科技大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B2035\":[\"判断数正负\",43453,null],\"HDU-1257\":[\"最少拦截系统\",26050,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙江工业大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B2036\":[\"输出绝对值\",39502,null],\"洛谷-B2037\":[\"奇偶数判断\",43826,null],\"洛谷-B2031\":[\"计算三角形面积\",23148,null],\"ZOJ-3469\":[\"Food Delivery\",2195,null],\"洛谷-P2280\":[\"激光炸弹\",19160,\"HNOI2003\"],\"洛谷-P1192\":[\"台阶问题\",41845,null],\"洛谷-P3131\":[\"Subsequences Summing to Sevens S\",11679,\"USACO16JAN\"],\"洛谷-P1195\":[\"口袋的天空\",24610,null],\"洛谷-P1073\":[\"最优贸易\",22316,\"NOIP2009 提高组\"],\"洛谷-P1194\":[\"买礼物\",17364,null],\"洛谷-P1075\":[\"质因数分解\",182763,\"NOIP2012 普及组\"],\"洛谷-P2043\":[\"质因子分解\",20218,null],\"洛谷-P3017\":[\"Brownie Slicing G\",1841,\"USACO11MAR\"],\"HDU-1027\":[\"Ignatius and the Princess II\",9555,\"\"],\"洛谷-P2047\":[\"社交网络\",4428,\"NOI2007\"],\"洛谷-P8828\":[\"直角三角形\",4004,\"传智杯 #3 练习赛\"],\"HDU-1029\":[\"Ignatius and the Princess IV\",21646,\"\"],\"UVA-11572\":[\"Unique Snowflakes\",8921,null],\"HackerRank-vector-erase\":[\"Vector-Erase\",161877,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/master\\u0027 target\\u003d\\u0027_blank\\u0027\\u003emaster\\u003c/a\\u003e\"],\"洛谷-P5318\":[\"查找文献\",30582,\"深基18.例3\"],\"HDU-1262\":[\"寻找素数对\",8632,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙江工业大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1723\":[\"SOLDIERS\",4904,\"\\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-3900\":[\"The Robbery\",276,\"\\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+2009\\\"\\u003eSoutheastern European Regional Programming Contest 2009\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1263\":[\"水果\",6418,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙江工业大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2476\":[\"String painter\",3765,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+Asia+Regional+Chengdu\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 Asia Regional Chengdu \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1024\":[\"Max Sum Plus Plus\",13560,\"\"],\"CodeForces-1881C\":[\"Perfect Square\",15958,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1881\\\"\\u003eCodeforces Round 903 (Div. 3)\\u003c/a\\u003e\"],\"POJ-1847\":[\"Tram\",6433,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCroatia+OI+2002+Regional+-+Juniors\\\"\\u003eCroatia OI 2002 Regional - Juniors\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1260\":[\"Tickets\",6369,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙江工业大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1080\":[\"国王游戏\",29280,\"NOIP2012 提高组\"],\"洛谷-P3383\":[\"线性筛素数\",92689,\"模板\"],\"洛谷-P1083\":[\"借教室\",37742,\"NOIP2012 提高组\"],\"洛谷-P6771\":[\"Space Elevator 太空电梯\",3142,\"USACO05MAR\"],\"洛谷-P1085\":[\"不高兴的津津\",33631,\"NOIP2004 普及组\"],\"洛谷-P3146\":[\"248 G\",17960,\"USACO16OPEN\"],\"洛谷-P1089\":[\"津津的储蓄计划\",204248,\"NOIP2004 提高组\"],\"洛谷-P5322\":[\"排兵布阵\",7294,\"BJOI2019\"],\"洛谷-P3143\":[\"Diamond Collector S\",6410,\"USACO16OPEN\"],\"洛谷-P3385\":[\"负环\",38645,\"模板\"],\"HDU-1159\":[\"Common Subsequence\",22984,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSoutheastern+Europe+2003\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Southeastern Europe 2003 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3579\":[\"Hello Kiki\",1819,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A814%A3%A9%A1%AA%A1%AAHost+by+BJTU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(14)——Host by BJTU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10474\":[\"Where is the Marble?\",27309,null],\"POJ-1611\":[\"The Suspects\",24304,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dAsia+Kaohsiung+2003\\\"\\u003eAsia Kaohsiung 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1272\":[\"小希的迷宫\",17307,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2006-4+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2006-4 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1733\":[\"Parity game\",4849,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCEOI+1999\\\"\\u003eCEOI 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10118\":[\"Free Candies\",1943,null],\"POJ-1976\":[\"A Mini Locomotive\",2107,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+Sharif+2004+Preliminary\\\"\\u003eTehran Sharif 2004 Preliminary\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-T212773\":[\"整数查找\",349,null],\"CodeForces-4C\":[\"Registration System\",90103,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/4\\\"\\u003eCodeforces Beta Round 4 (Div. 2 Only)\\u003c/a\\u003e\"],\"洛谷-P1090\":[\"合并果子 / [USACO06NOV] Fence Repair G\",127266,\"NOIP2004 提高组\"],\"洛谷-P7994\":[\"Air Cownditioning B\",1807,\"USACO21DEC\"],\"洛谷-P1093\":[\"奖学金\",107888,\"NOIP2007 普及组\"],\"洛谷-P8964\":[\"梦幻 | Reopening of Dream\",743,null],\"洛谷-P3275\":[\"糖果\",10677,\"SCOI2011\"],\"洛谷-P3397\":[\"地毯\",49225,null],\"HDU-2018\":[\"母牛的故事\",69295,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dC%D3%EF%D1%D4%B3%CC%D0%F2%C9%E8%BC%C6%C1%B7%CF%B0%A3%A8%C8%FD%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e C语言程序设计练习(三) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2138\":[\"How many prime numbers\",8122,\"\\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\"],\"洛谷-P8847\":[\"1-1 A\",1008,\"JRKSJ R5\"],\"HDU-3342\":[\"Legal or Not\",5662,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+Monthly+Contest+%A8C+2010.03.06\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.03.06 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2912\":[\"Rochambeau\",2112,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBaidu+Star+2006+Preliminary\\\"\\u003eBaidu Star 2006 Preliminary\\u003c/a\\u003e\\r\\u003cbr\\u003eChen, Shixi (xreborner) living in http://fairyair.yeah.net/\\u003c/div\\u003e\"],\"HDU-2010\":[\"水仙花数\",86432,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dC%D3%EF%D1%D4%B3%CC%D0%F2%C9%E8%BC%C6%C1%B7%CF%B0%A3%A8%B6%FE%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e C语言程序设计练习(二) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B3612\":[\"求区间和\",12864,\"深进1.例1\"],\"POJ-1703\":[\"Find them, Catch them\",13398,\"\\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\"],\"洛谷-B3611\":[\"传递闭包\",6825,\"模板\"],\"HDU-1285\":[\"确定比赛名次\",13839,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VII%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VII) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2014\":[\"青年歌手大奖赛_评委会打分\",70520,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dC%D3%EF%D1%D4%B3%CC%D0%F2%C9%E8%BC%C6%C1%B7%CF%B0%A3%A8%C8%FD%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e C语言程序设计练习(三) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2013\":[\"蟠桃记\",78073,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dC%D3%EF%D1%D4%B3%CC%D0%F2%C9%E8%BC%C6%C1%B7%CF%B0%A3%A8%B6%FE%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e C语言程序设计练习(二) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3223\":[\"Decrypt Messages\",119,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Asia+Shanghai+Regional+Contest+Host+by+DHU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Asia Shanghai Regional Contest Host by DHU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2136\":[\"Largest prime factor\",5833,\"\\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\"],\"LightOJ-1422\":[\"Halloween Costumes\",3116,null],\"CodeForces-776B\":[\"Sherlock and his girlfriend\",21127,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/776\\\"\\u003eICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"HDU-1160\":[\"FatMouse\\u0027s Speed\",9503,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZhejiang+University+Training+Contest+2001\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Zhejiang University Training Contest 2001 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P8732\":[\"答疑\",1254,\"蓝桥杯 2020 国 ABC\"],\"洛谷-P5461\":[\"赦免战俘\",46766,null],\"HDU-2029\":[\"Palindromes _easy version\",42684,\"\\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\"],\"洛谷-P8739\":[\"重复字符串\",1614,\"蓝桥杯 2020 国 C\"],\"CodeForces-39J\":[\"Spelling Check\",3171,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/39\\\"\\u003eSchool Team Contest 1 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"计蒜客-T1541\":[\"学姐点名\",575,null],\"CodeForces-1006C\":[\"Three Parts of the Array\",22100,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1006\\\"\\u003eCodeforces Round 498 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1672D\":[\"Cyclic Rotation\",6059,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1672\\\"\\u003eCodeforces Global Round 20\\u003c/a\\u003e\"],\"HDU-1176\":[\"免费馅饼\",21471,\"\"],\"UVA-10214\":[\"Trees in a Wood.\",918,null],\"洛谷-P2089\":[\"烤鸡\",88428,null],\"洛谷-B3637\":[\"最长上升子序列\",25555,null],\"HDU-2032\":[\"杨辉三角\",47122,\"\\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\"],\"HDU-2034\":[\"人见人爱A-B\",34325,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM%B3%CC%D0%F2%C9%E8%BC%C6%C6%DA%C4%A9%BF%BC%CA%D4%A3%A82006%2F06%2F07%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM程序设计期末考试(2006/06/07) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3708\":[\"Recurrent Function\",255,\"\\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, Yaojinyu\\u003c/div\\u003e\"],\"HDU-6514\":[\"Monitor\",1351,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2019%D6%D0%C9%BD%B4%F3%D1%A7%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC%A3%A8%D6%D8%CF%D6%C8%FC%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2019中山大学程序设计竞赛(重现赛) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2037\":[\"今年暑假不AC\",47677,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM%B3%CC%D0%F2%C9%E8%BC%C6%C6%DA%C4%A9%BF%BC%CA%D4%A3%A82006%2F06%2F07%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM程序设计期末考试(2006/06/07) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2739\":[\"Sum of Consecutive Prime Numbers\",15325,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2005\\\"\\u003eJapan 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1069\":[\"Monkey and Banana\",12271,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUniversity+of+Ulm+Local+Contest+1996\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Ulm Local Contest 1996 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-855A\":[\"Tom Riddle\\u0027s Diary\",23787,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/855\\\"\\u003eManthan, Codefest 17\\u003c/a\\u003e\"],\"CodeForces-988B\":[\"Substrings Sort\",19794,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/988\\\"\\u003eCodeforces Round 486 (Div. 3)\\u003c/a\\u003e\"],\"HDU-1180\":[\"诡异的楼梯\",4057,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dGardon-DYGG+Contest+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Gardon-DYGG Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1651\":[\"Multiplication Puzzle\",9055,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2001\\\"\\u003eNortheastern Europe 2001\\u003c/a\\u003e, Far-Eastern Subregion\\u003c/div\\u003e\"],\"POJ-2502\":[\"Subway\",4014,\"\\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\"],\"AtCoder-abc221_d\":[\"Online games\",3103,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc221\\\"\\u003eAtCoder Beginner Contest 221\\u003c/a\\u003e\"],\"HDU-1075\":[\"What Are You Talking About\",8374,\"\"],\"HDU-4585\":[\"Shaolin\",2160,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013ACM-ICPC%BA%BC%D6%DD%C8%FC%C7%F8%C8%AB%B9%FA%D1%FB%C7%EB%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013ACM-ICPC杭州赛区全国邀请赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"SPOJ-ACMCEG2B\":[\"FIGUREFUL\",2777,\"\"],\"洛谷-B3623\":[\"枚举排列\",6807,null],\"POJ-1417\":[\"True Liars\",2107,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2002+Kanazawa\\\"\\u003eJapan 2002 Kanazawa\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1074\":[\"Doing Homework\",6531,\"\"],\"HDU-2042\":[\"不容易系列之二\",39621,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2005%CA%B5%D1%E9%B0%E0%B6%CC%D1%A7%C6%DA%BF%BC%CA%D4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2005实验班短学期考试 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1198\":[\"Farm Irrigation\",4393,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZhejiang+University+Local+Contest+2005\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Zhejiang University Local Contest 2005 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2045\":[\"不容易系列之(3)—— LELE的RPG难题\",30932,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B5%DD%CD%C6%C7%F3%BD%E2%D7%A8%CC%E2%C1%B7%CF%B0%A3%A8For+Beginner%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 递推求解专题练习(For Beginner) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B3625\":[\"迷宫寻路\",12138,null],\"HDU-2044\":[\"一只小蜜蜂...\",41360,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B5%DD%CD%C6%C7%F3%BD%E2%D7%A8%CC%E2%C1%B7%CF%B0%A3%A8For+Beginner%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 递推求解专题练习(For Beginner) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B3624\":[\"猫粮规划\",4217,null],\"HDU-2047\":[\"阿牛的EOF牛肉串\",27598,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B5%DD%CD%C6%C7%F3%BD%E2%D7%A8%CC%E2%C1%B7%CF%B0%A3%A8For+Beginner%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 递推求解专题练习(For Beginner) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2046\":[\"骨牌铺方格\",36226,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B5%DD%CD%C6%C7%F3%BD%E2%D7%A8%CC%E2%C1%B7%CF%B0%A3%A8For+Beginner%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 递推求解专题练习(For Beginner) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1078\":[\"FatMouse and Cheese\",7260,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZhejiang+University+Training+Contest+2001\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Zhejiang University Training Contest 2001 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1400D\":[\"Zigzags\",10011,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1400\\\"\\u003eEducational Codeforces Round 94 (Rated for Div. 2)\\u003c/a\\u003e\"],\"HDU-2049\":[\"不容易系列之(4)——考新郎\",22299,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B5%DD%CD%C6%C7%F3%BD%E2%D7%A8%CC%E2%C1%B7%CF%B0%A3%A8For+Beginner%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 递推求解专题练习(For Beginner) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2048\":[\"神、上帝以及老天爷\",24642,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B5%DD%CD%C6%C7%F3%BD%E2%D7%A8%CC%E2%C1%B7%CF%B0%A3%A8For+Beginner%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 递推求解专题练习(For Beginner) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B3862\":[\"图的遍历(简单版)\",1829,null],\"CodeForces-769C\":[\"Cycle In Maze\",2284,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/769\\\"\\u003eVK Cup 2017 - Qualification 1\\u003c/a\\u003e\"],\"OpenJ_Bailian-2816\":[\"红与黑\",4220,\"1979\"],\"CodeForces-8B\":[\"Obsession with Robots\",4498,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/8\\\"\\u003eCodeforces Beta Round 8\\u003c/a\\u003e\"],\"HDU-2041\":[\"超级楼梯\",48779,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2005%CA%B5%D1%E9%B0%E0%B6%CC%D1%A7%C6%DA%BF%BC%CA%D4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2005实验班短学期考试 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2161\":[\"Primes\",8459,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+%A1%B0Sunline+Cup%A1%B1+National+Invitational+Contest+-+Warm+Up\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 “Sunline Cup” National Invitational Contest - Warm Up \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P6464\":[\"传送门\",3320,\"传智杯 #2 决赛\"],\"洛谷-P5015\":[\"标题统计\",128432,\"NOIP2018 普及组\"],\"洛谷-P3078\":[\"Poker Hands S\",7047,\"USACO13MAR\"],\"POJ-1860\":[\"Currency Exchange\",13135,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2001\\\"\\u003eNortheastern Europe 2001\\u003c/a\\u003e, Northern Subregion\\u003c/div\\u003e\"],\"POJ-1984\":[\"Navigation Nightmare\",2667,\"\\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\"],\"洛谷-P8647\":[\"分巧克力\",11915,\"蓝桥杯 2017 省 AB\"],\"洛谷-P8889\":[\"狠狠地切割 (Hard Version)\",750,\"入门赛 #7\"],\"POJ-1861\":[\"Network\",4946,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2001\\\"\\u003eNortheastern Europe 2001\\u003c/a\\u003e, Northern Subregion\\u003c/div\\u003e\"],\"POJ-1988\":[\"Cube Stacking\",8251,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+U+S+Open\\\"\\u003eUSACO 2004 U S Open\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2054\":[\"A \\u003d\\u003d B ?\",22619,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D0%A3%C7%EC%B1%ADWarm+Up\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 校庆杯Warm Up \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1986\":[\"Distance Queries\",4400,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+February\\\"\\u003eUSACO 2004 February\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1502\":[\"MPI Maelstrom\",8698,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dEast+Central+North+America+1996\\\"\\u003eEast Central North America 1996\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1087\":[\"Super Jumping! Jumping! Jumping!\",24533,\"\"],\"POJ-2955\":[\"Brackets\",8654,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dStanford+Local+2004\\\"\\u003eStanford Local 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"AtCoder-abc014_3\":[\"AtColor\",212,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc014\\\"\\u003eAtCoder Beginner Contest 014\\u003c/a\\u003e\"],\"HDU-1089\":[\"A+B for Input-Output Practice (I)\",97917,\"\"],\"HDU-2050\":[\"折线分割平面\",30584,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B5%DD%CD%C6%C7%F3%BD%E2%D7%A8%CC%E2%C1%B7%CF%B0%A3%A8For+Beginner%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 递推求解专题练习(For Beginner) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P4170\":[\"涂色\",18575,\"CQOI2007\"],\"洛谷-P8775\":[\"青蛙过河\",2274,\"蓝桥杯 2022 省 A\"],\"AtCoder-abc233_d\":[\"Count Interval\",3130,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc233\\\"\\u003eAtCoder Beginner Contest 233\\u003c/a\\u003e\"],\"洛谷-P5143\":[\"攀爬者\",29387,null],\"洛谷-P8772\":[\"求和\",16203,\"蓝桥杯 2022 省 A\"],\"UVA-156\":[\"Ananagrams\",18513,null],\"CodeForces-190A\":[\"Vasya and the Bus\",6161,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/190\\\"\\u003eCodeforces Round 120 (Div. 2)\\u003c/a\\u003e\"],\"POJ-1753\":[\"Flip Game\",18840,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2000\\\"\\u003eNortheastern Europe 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1511\":[\"Invitation Cards\",7950,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCentral+Europe+1998\\\"\\u003eCentral Europe 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1751\":[\"Highways\",6372,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+1999\\\"\\u003eNortheastern Europe 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-B3644\":[\"拓扑排序 / 家谱树\",10990,\"模板\"],\"HDU-3038\":[\"How Many Answers Are Wrong\",7212,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+13+-+Host+by+HIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 13 - Host by HIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5338\":[\"ZZX and Permutations\",278,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+Multi-University+Training+Contest+4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 4 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-B3640\":[\"T3 句子反转\",3551,null],\"洛谷-B3643\":[\"图的存储\",5019,null],\"洛谷-P1909\":[\"买铅笔\",206383,\"NOIP2016 普及组\"],\"HDU-1091\":[\"A+B for Input-Output Practice (III)\",85868,\"\"],\"HDU-1090\":[\"A+B for Input-Output Practice (II)\",93752,\"\"],\"HDU-1093\":[\"A+B for Input-Output Practice (V)\",75160,\"\"],\"HDU-1092\":[\"A+B for Input-Output Practice (IV)\",79896,\"\"],\"ZOJ-2412\":[\"Farm Irrigation\",2064,null],\"洛谷-P4180\":[\"严格次小生成树\",12382,\"BJWC2010\"],\"HDU-1094\":[\"A+B for Input-Output Practice (VI)\",71737,\"\"],\"洛谷-P8667\":[\"递增三元组\",2290,\"蓝桥杯 2018 省 B\"],\"洛谷-P8664\":[\"付账问题\",732,\"蓝桥杯 2018 省 A\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"carits","updateTime":1712751151000,"title":"信息学学习题单","dislikeCnt":1,"content":"## 洛谷T开头的题目打开链接后在链接后面加一个空格再按回车就好了\n\n\n\n\n\n\n\n### 输入与输出\n[problem:HDU-1093][problem:HDU-1092][problem:洛谷-B2005][problem:洛谷-B2001][problem:洛谷-B2006][problem:HDU-1091][problem:HDU-1090][problem:HDU-1094][problem:洛谷-B2007][problem:洛谷-B2002][problem:HDU-1089][problem:洛谷-B2025][problem:洛谷-B2009][problem:洛谷-B2003][problem:洛谷-B2008][problem:洛谷-B2004]\n\n### 分支结构\n[problem:洛谷-P1888][problem:洛谷-P5709][problem:洛谷-B2045][problem:洛谷-B2039][problem:洛谷-B2043][problem:洛谷-B2037][problem:洛谷-B2050][problem:洛谷-B2041][problem:洛谷-B2044][problem:洛谷-P5717][problem:洛谷-B2052][problem:洛谷-B2048][problem:洛谷-P5712][problem:洛谷-P5716][problem:洛谷-P5713][problem:洛谷-B2042][problem:洛谷-P1424][problem:洛谷-B2040][problem:洛谷-B2036][problem:洛谷-P2433][problem:洛谷-B2046][problem:洛谷-P1055][problem:洛谷-P5711][problem:洛谷-P1085][problem:洛谷-B2049][problem:洛谷-P5710][problem:洛谷-P5714][problem:洛谷-P5715][problem:洛谷-P4414][problem:洛谷-P1046][problem:洛谷-B2038][problem:洛谷-P1909][problem:洛谷-P1422][problem:洛谷-B2051][problem:洛谷-B2035][problem:洛谷-B2047]\n\n### 循环结构\n[problem:洛谷-P1420][problem:洛谷-P1217][problem:洛谷-P5718][problem:洛谷-B2082][problem:洛谷-P1009][problem:洛谷-P5722][problem:洛谷-B2087][problem:洛谷-P5721][problem:洛谷-P4956][problem:洛谷-B2074][problem:洛谷-B2069][problem:洛谷-B2060][problem:洛谷-B2084][problem:洛谷-P1035][problem:洛谷-P1980][problem:洛谷-P5719][problem:洛谷-B2073][problem:洛谷-B2066][problem:洛谷-B2070][problem:洛谷-P5724][problem:洛谷-P5723][problem:洛谷-B2081][problem:洛谷-P2669][problem:洛谷-B2058][problem:洛谷-B2065][problem:洛谷-B2064][problem:洛谷-B2059][problem:洛谷-B2072][problem:洛谷-B2085][problem:洛谷-B2080][problem:洛谷-P1307][problem:洛谷-B2061][problem:洛谷-P1075][problem:洛谷-P1423][problem:洛谷-B2088][problem:洛谷-B2075][problem:洛谷-B2076][problem:洛谷-P5720][problem:洛谷-B2067][problem:洛谷-B2086][problem:洛谷-B2079][problem:洛谷-B2062][problem:洛谷-P5726][problem:洛谷-B2071][problem:洛谷-B2057][problem:洛谷-B2078][problem:洛谷-P1720][problem:洛谷-P5725][problem:洛谷-B2063][problem:洛谷-P1089][problem:洛谷-B2083][problem:洛谷-B2068][problem:洛谷-B2077]\n\n### 字符类型与浮点类型\n[problem:洛谷-B2027][problem:洛谷-B2025][problem:洛谷-B2012][problem:洛谷-B2021][problem:洛谷-B2024][problem:洛谷-B2014][problem:洛谷-B2016][problem:洛谷-B2018][problem:洛谷-B2010][problem:洛谷-B2020][problem:洛谷-B2023][problem:洛谷-B2073][problem:洛谷-B2028][problem:洛谷-B2026][problem:洛谷-B2013][problem:洛谷-B2022][problem:洛谷-B2017][problem:洛谷-B2015][problem:洛谷-B2029][problem:洛谷-B2054][problem:洛谷-B2019][problem:洛谷-B2031][problem:洛谷-B2055][problem:洛谷-B2076][problem:洛谷-B2011][problem:洛谷-B2056][problem:洛谷-B2079][problem:洛谷-B2053]\n\n### 数组\n[problem:洛谷-B2091][problem:洛谷-B2107][problem:洛谷-P2615][problem:洛谷-P2911][problem:洛谷-B2092][problem:洛谷-B2104][problem:洛谷-P1428][problem:洛谷-B2101][problem:洛谷-B2109][problem:洛谷-B2100][problem:洛谷-P5727][problem:洛谷-B2096][problem:洛谷-B2099][problem:洛谷-B2105][problem:洛谷-B2097][problem:洛谷-P1047][problem:洛谷-P1319][problem:洛谷-P5728][problem:洛谷-B2106][problem:洛谷-P1205][problem:洛谷-P5731][problem:洛谷-P2141][problem:洛谷-B2098][problem:洛谷-B2095][problem:洛谷-B2102][problem:洛谷-P1789][problem:洛谷-P1161][problem:洛谷-P1320][problem:洛谷-P5729][problem:洛谷-B2090][problem:洛谷-P1554][problem:洛谷-P5730][problem:洛谷-B2093][problem:洛谷-P1427][problem:洛谷-P1614][problem:洛谷-P2550][problem:洛谷-B2094][problem:洛谷-B2089][problem:洛谷-B2103][problem:洛谷-P5732][problem:洛谷-B2108]\n\n### 字符串\n[problem:POJ-3461][problem:洛谷-B2124][problem:洛谷-P8964][problem:洛谷-P5733][problem:洛谷-P1200][problem:HDU-3664][problem:HDU-2010][problem:洛谷-P5015][problem:洛谷-P1553][problem:洛谷-P1597][problem:洛谷-B2116][problem:洛谷-B2113][problem:洛谷-P1914][problem:洛谷-B3663][problem:洛谷-P1598][problem:洛谷-P1957][problem:洛谷-P1321][problem:洛谷-B2119][problem:洛谷-P1308][problem:POJ-2001][problem:洛谷-B2125][problem:洛谷-P3741][problem:洛谷-P9459][problem:洛谷-B2117][problem:洛谷-P1603][problem:洛谷-P1125][problem:洛谷-P5734][problem:洛谷-P1765]\n\n### 函数与结构体\n[problem:洛谷-P2415][problem:洛谷-P1217][problem:洛谷-P5737][problem:洛谷-P5735][problem:洛谷-B2134][problem:洛谷-B2133][problem:洛谷-P5744][problem:洛谷-B2138][problem:洛谷-P5738][problem:洛谷-P5743][problem:洛谷-B2131][problem:洛谷-B2135][problem:洛谷-B2139][problem:洛谷-P1075][problem:洛谷-P5739][problem:洛谷-B2137][problem:洛谷-P1304][problem:洛谷-B2136][problem:洛谷-P5742][problem:洛谷-P5461][problem:洛谷-P5736][problem:洛谷-B2132][problem:洛谷-P5741][problem:洛谷-P5740][problem:洛谷-B2130]\n\n### 枚举和模拟\n[problem:计蒜客-T1541][problem:洛谷-P8680][problem:CodeForces-333E][problem:CodeForces-1400D][problem:洛谷-P2363][problem:CodeForces-1006C][problem:CodeForces-1672D][problem:洛谷-P2280][problem:CodeForces-1881C][problem:CodeForces-724B][problem:洛谷-P8828][problem:洛谷-P1003][problem:POJ-1723][problem:洛谷-P1548][problem:洛谷-P3131][problem:洛谷-P1147][problem:POJ-3061][problem:CodeForces-939E][problem:洛谷-P4552][problem:CodeForces-1732C1][problem:洛谷-P1151][problem:洛谷-P1149][problem:HDU-5338][problem:洛谷-P2437][problem:洛谷-P2564][problem:洛谷-P2089][problem:洛谷-P1059][problem:洛谷-B3623][problem:洛谷-P1276][problem:洛谷-P1278][problem:黑暗爆炸-1303][problem:HDU-5128][problem:HDU-6186][problem:POJ-1753][problem:洛谷-P2327][problem:洛谷-P1025][problem:洛谷-P1148][problem:POJ-1029][problem:洛谷-P1159][problem:CodeForces-356C][problem:洛谷-P1124][problem:CodeForces-825B][problem:洛谷-P1065][problem:UVA-11059][problem:洛谷-P1022][problem:洛谷-P1738][problem:洛谷-P1483][problem:UVA-10976][problem:CodeForces-908B][problem:洛谷-P1512][problem:HDU-5938][problem:CodeForces-869A][problem:POJ-2632]\n\n### STL专项\n[problem:SPOJ-ACMCEG2B][problem:HDU-1412][problem:POJ-3253][problem:HDU-1075][problem:HDU-1257][problem:HDU-5463][problem:SPOJ-IITKWPCA][problem:UVA-136][problem:SPOJ-SORT2D][problem:UVA-101][problem:CodeForces-855A][problem:UVA-156][problem:HDU-4841][problem:HackerRank-cpp-sets][problem:HackerRank-cpp-maps][problem:HackerRank-vector-sort][problem:HackerRank-vector-erase][problem:HDU-2034][problem:HDU-2094][problem:CodeForces-44A][problem:POJ-2259][problem:HDU-1541][problem:HDU-1004][problem:HDU-2054][problem:HDU-1263][problem:UVA-10815][problem:HDU-2014][problem:CodeForces-4C][problem:UVA-10474][problem:HDU-4585][problem:HDU-1716][problem:HDU-1029][problem:CodeForces-988B][problem:UVA-400]\n\n### 贪心\nT开头的题目打开链接后在链接后面加一个空格再按回车就好了\n[problem:HDU-2037][problem:洛谷-P1230][problem:洛谷-P8732][problem:洛谷-P1887][problem:洛谷-P1223][problem:洛谷-P1645][problem:洛谷-P8664][problem:洛谷-P1031][problem:洛谷-P9472][problem:洛谷-P9064][problem:洛谷-P1093][problem:洛谷-T219652][problem:洛谷-P1109][problem:洛谷-T219654][problem:洛谷-P8739][problem:OpenJ_Bailian-4137][problem:洛谷-T219653][problem:洛谷-P2676][problem:洛谷-P1803][problem:HDU-1789][problem:洛谷-P1138][problem:洛谷-P1106][problem:洛谷-P9160][problem:洛谷-P5143][problem:OpenJ_Bailian-2797][problem:洛谷-P4445][problem:洛谷-T219655][problem:洛谷-P2512][problem:洛谷-P1610][problem:OpenJ_Bailian-2795][problem:HDU-2570][problem:洛谷-P1068][problem:洛谷-P1090][problem:洛谷-P1478][problem:洛谷-P1059][problem:洛谷-P6141][problem:洛谷-P1080][problem:洛谷-P9228][problem:洛谷-P1104][problem:洛谷-T219656]\n\n### 递归\n[problem:洛谷-B2064][problem:OpenJ_Bailian-4017][problem:HDU-2046][problem:洛谷-B2146][problem:HDU-2045][problem:HDU-2042][problem:HDU-2013][problem:HDU-2018][problem:HDU-2041][problem:洛谷-B2144][problem:HDU-2044][problem:洛谷-P1464]\n\n### 递推\n[problem:HDU-2084][problem:HDU-2046][problem:HDU-2045][problem:HDU-2048][problem:HDU-2047][problem:HDU-2018][problem:HDU-2050][problem:HDU-2044][problem:HDU-2049]\n\n### 搜索\n[problem:洛谷-P1135][problem:洛谷-P1706][problem:HDU-1010][problem:OpenJ_Bailian-3414][problem:CodeForces-769C][problem:洛谷-P1219][problem:HDU-5025][problem:OpenJ_Bailian-4001][problem:OpenJ_Bailian-4124][problem:洛谷-P1036][problem:洛谷-P1443][problem:洛谷-B3624][problem:洛谷-P1101][problem:HDU-1973][problem:OpenJ_Bailian-4127][problem:洛谷-P1596][problem:OpenJ_Bailian-4123][problem:OpenJ_Bailian-1321][problem:OpenJ_Bailian-3151][problem:OpenJ_Bailian-2816][problem:OpenJ_Bailian-4115][problem:OpenJ_Bailian-2251][problem:洛谷-B3623][problem:OpenJ_Bailian-1426][problem:洛谷-B3625][problem:OpenJ_Bailian-4116][problem:洛谷-P1025]\n\n### 搜索优化\n[problem:HDU-1180][problem:POJ-1321][problem:HDU-1258][problem:HDU-1010][problem:HDU-1501][problem:HDU-4394][problem:HDU-1530][problem:POJ-3900][problem:UVA-10118][problem:HDU-2610][problem:POJ-2251][problem:HDU-2553][problem:HDU-1455][problem:HDU-1728][problem:HDU-1428][problem:ZOJ-1002][problem:POJ-2531][problem:POJ-2111][problem:HDU-1027][problem:POJ-1579][problem:POJ-3280][problem:HDU-2611][problem:ZOJ-2412][problem:HDU-1241][problem:POJ-1190][problem:POJ-2078][problem:POJ-1976][problem:HDU-1619][problem:HDU-2102][problem:POJ-1475][problem:POJ-1011][problem:POJ-1077][problem:HDU-1016][problem:HDU-2089]\n\n### 二分\n[problem:HDU-1496][problem:洛谷-P2678][problem:洛谷-P2249][problem:洛谷-P1258][problem:洛谷-P8667][problem:洛谷-P1824][problem:洛谷-P1873][problem:洛谷-P1024][problem:洛谷-P8775][problem:OpenJ_Bailian-3441][problem:洛谷-P1843][problem:HDU-2199][problem:洛谷-P8647][problem:洛谷-P1571][problem:洛谷-T212773][problem:洛谷-P8800][problem:洛谷-P9455][problem:洛谷-P1678][problem:洛谷-P1102][problem:洛谷-P8847][problem:洛谷-P8889][problem:洛谷-P9050][problem:洛谷-P1182]\n\n### 前缀和差分\n[problem:洛谷-P2367][problem:AtCoder-abc014_3][problem:CSES-1661][problem:洛谷-P8772][problem:洛谷-P3078][problem:洛谷-P2280][problem:洛谷-B3612][problem:洛谷-P2004][problem:HDU-6514][problem:洛谷-P3397][problem:AtCoder-abc233_d][problem:洛谷-P8218][problem:洛谷-P1387][problem:洛谷-P3131][problem:Gym-102951D][problem:AtCoder-abc125_c][problem:洛谷-P1314][problem:洛谷-P4552][problem:CodeForces-1398C][problem:CSES-1660][problem:洛谷-P7149][problem:洛谷-P3406][problem:洛谷-P3017][problem:CodeForces-670C][problem:洛谷-P1083][problem:洛谷-P7994][problem:AtCoder-abc221_d][problem:洛谷-P1969][problem:洛谷-P2882][problem:洛谷-P5638][problem:CSES-1662][problem:洛谷-P1719]\n\n### 双指针\n[problem:CodeForces-85A][problem:CodeForces-39J][problem:洛谷-P1638][problem:洛谷-P5745][problem:UVA-11572][problem:HDU-2029][problem:AtCoder-abc260_e][problem:洛谷-P1102][problem:CodeForces-8B][problem:CodeForces-1450B][problem:HDU-5358][problem:POJ-3061][problem:洛谷-P1147][problem:洛谷-P7714][problem:洛谷-B3640][problem:洛谷-P3143]\n\n### 基础数论(素数)\n[problem:HDU-2136][problem:HDU-2161][problem:计蒜客-A2238][problem:POJ-2739][problem:HDU-1431][problem:HDU-1262][problem:洛谷-P2043][problem:HDU-2098][problem:AtCoder-abc284_d][problem:HDU-1905][problem:计蒜客-T3004][problem:洛谷-P1579][problem:洛谷-P1403][problem:CodeForces-776B][problem:HDU-4497][problem:POJ-3641][problem:HDU-5104][problem:POJ-2689][problem:洛谷-P5736][problem:洛谷-P1865][problem:HDU-2138][problem:洛谷-P3383]\n\n### 线性dp\n[problem:HDU-1260][problem:HDU-1069][problem:HDU-1159][problem:OpenJ_Bailian-1088][problem:HDU-1176][problem:洛谷-P1466][problem:CodeForces-1832B][problem:HDU-2047][problem:洛谷-B3637][problem:HDU-1257][problem:CodeForces-1765M][problem:CodeForces-189A][problem:POJ-1458][problem:洛谷-P1434][problem:洛谷-P1507][problem:洛谷-P3985][problem:POJ-3186][problem:洛谷-P1060][problem:HDU-1087][problem:HDU-1074][problem:CodeForces-190A][problem:洛谷-P2925][problem:洛谷-P2370][problem:HDU-2013][problem:OpenJ_Bailian-4004][problem:POJ-2533][problem:洛谷-P1164][problem:洛谷-P1928][problem:POJ-1015][problem:洛谷-P2347][problem:洛谷-P1115][problem:洛谷-B2064][problem:POJ-1661][problem:HDU-2859][problem:POJ-3616][problem:洛谷-P1064][problem:HDU-1024][problem:HDU-2018][problem:洛谷-P1002][problem:HDU-1160][problem:洛谷-P1048][problem:HDU-2046][problem:HDU-1078][problem:洛谷-P6771][problem:洛谷-P5322][problem:洛谷-P1049][problem:HDU-1114][problem:HDU-2045][problem:洛谷-P1616][problem:HDU-2032][problem:洛谷-P5662][problem:洛谷-P1776][problem:POJ-3666][problem:洛谷-P1644][problem:HDU-1029][problem:洛谷-P1192][problem:洛谷-P1877][problem:洛谷-P1025][problem:HDU-2044][problem:洛谷-P1757]\n\n### 链表\n[problem:洛谷-T218735][problem:洛谷-T218738][problem:洛谷-T218739][problem:洛谷-T218741][problem:洛谷-P1160][problem:洛谷-P7912]\n\n### 树与二叉树\n[problem:洛谷-T219454][problem:洛谷-T219455][problem:洛谷-T219519][problem:洛谷-T219818][problem:洛谷-T219817][problem:洛谷-T219819][problem:洛谷-P8306][problem:洛谷-P2580][problem:洛谷-T306565][problem:洛谷-T306591][problem:洛谷-T306596][problem:洛谷-T306599]\n\n\n### 图论入门\n[problem:POJ-2488][problem:洛谷-B3862][problem:洛谷-B3643][problem:洛谷-P1807][problem:洛谷-P2853][problem:洛谷-P3916][problem:洛谷-P1113][problem:洛谷-P5318][problem:POJ-3278][problem:UVA-1599]\n\n### 拓扑排序\n[problem:洛谷-P1137][problem:HDU-1285][problem:HDU-4857][problem:UVA-10305][problem:洛谷-P1347][problem:洛谷-P1807][problem:HDU-2647][problem:洛谷-B3644][problem:POJ-2367][problem:HDU-3342][problem:POJ-2585][problem:HDU-2094][problem:HDU-1811]\n\n### 最短路\n[problem:洛谷-P3275][problem:POJ-2253][problem:POJ-2387][problem:POJ-1847][problem:POJ-3259][problem:POJ-2502][problem:POJ-2240][problem:洛谷-P6464][problem:洛谷-P3403][problem:POJ-1502][problem:洛谷-P2047][problem:洛谷-P3385][problem:POJ-1062][problem:洛谷-B3611][problem:POJ-3268][problem:洛谷-P1993][problem:POJ-1860][problem:洛谷-P1144][problem:洛谷-P4568][problem:洛谷-P1037][problem:洛谷-P1462][problem:POJ-3159][problem:HDU-4725][problem:洛谷-P5960][problem:洛谷-P1119][problem:POJ-3660][problem:洛谷-P2910][problem:POJ-3169][problem:洛谷-P1875][problem:POJ-1511][problem:洛谷-P2865][problem:LightOJ-1074][problem:洛谷-P1073][problem:HDU-3416][problem:洛谷-P2419][problem:HDU-4370][problem:POJ-1797][problem:洛谷-P4779]\n\n### 并查集\n[problem:POJ-1984][problem:HDU-1272][problem:洛谷-P1546][problem:POJ-1988][problem:HDU-1232][problem:POJ-2236][problem:POJ-2524][problem:POJ-1308][problem:POJ-2492][problem:HDU-1417][problem:洛谷-P1551][problem:洛谷-P2814][problem:POJ-1611][problem:洛谷-P3367][problem:HDU-3038][problem:POJ-1703][problem:POJ-1733][problem:POJ-1417][problem:POJ-1456][problem:HDU-1198][problem:洛谷-P1111][problem:HDU-1811][problem:POJ-2912][problem:POJ-1861][problem:POJ-1986][problem:HDU-1558][problem:POJ-1182][problem:POJ-2560][problem:洛谷-P1536]\n\n### 最小生成树\n[problem:洛谷-P2700][problem:HDU-1272][problem:POJ-3625][problem:HDU-1232][problem:洛谷-P1195][problem:POJ-2377][problem:POJ-1751][problem:HDU-1233][problem:POJ-2485][problem:POJ-3626][problem:洛谷-P1967][problem:洛谷-P1396][problem:POJ-1258][problem:洛谷-P4180][problem:洛谷-P3366][problem:洛谷-P1194][problem:洛谷-P1550][problem:POJ-2031]\n\n### 基础数论(扩展欧几里德 中国剩余定理 线性同余方程)\n[problem:POJ-1808][problem:UVA-11754][problem:HDU-2669][problem:POJ-1284][problem:POJ-1006][problem:URAL-1132][problem:POJ-2417][problem:POJ-3708][problem:UVA-12169][problem:POJ-3243][problem:ZOJ-3593][problem:POJ-3090][problem:UVA-10214][problem:HDU-4992][problem:POJ-2115][problem:POJ-2478][problem:HDU-3223][problem:HDU-1576][problem:HDU-3579][problem:POJ-3358][problem:POJ-2773][problem:POJ-2891][problem:HDU-1573][problem:POJ-1061]\n\n### 区间dp\n[problem:洛谷-P3146][problem:洛谷-P1063][problem:ZOJ-3537][problem:LightOJ-1422][problem:HDU-2476][problem:洛谷-P2858][problem:洛谷-P1775][problem:洛谷-P4170][problem:ZOJ-3469][problem:洛谷-P1880][problem:POJ-1651][problem:HDU-4283][problem:POJ-2955][problem:CodeForces-149D]\n\n","threadId":184423,"likeCnt":10,"createTime":1709446094000,"isWorkbook":true,"viewCnt":1300,"openness":2,"fav":false,"id":4654,"trustable":false}