Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"LibreOJ-2469\":[\"最小方差生成树\",16,\"2018 集训队互测 Day 2\"],\"洛谷-P8306\":[\"字典树\",14683,\"模板\"],\"CodeForces-1364D\":[\"Ehab\\u0027s Last Corollary\",4282,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1364\\\"\\u003eCodeforces Round 649 (Div. 2)\\u003c/a\\u003e\"],\"HDU-2196\":[\"Computer\",6801,\"\"],\"洛谷-P1912\":[\"诗人小G\",3759,\"NOI2009\"],\"UniversalOJ-218\":[\"火车管理\",518,\"UNR #1\"],\"CodeForces-1190B\":[\"Tokitsukaze, CSL and Stone Game\",6416,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1190\\\"\\u003eCodeforces Round 573 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-932F\":[\"Escape Through Leaf\",2739,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/932\\\"\\u003eICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-1340F\":[\"Nastya and CBS\",509,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1340\\\"\\u003eCodeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov!\\u003c/a\\u003e\"],\"洛谷-P4072\":[\"征途\",4572,\"SDOI2016\"],\"洛谷-P5283\":[\"异或粽子\",4724,\"十二省联考 2019\"],\"CodeForces-932G\":[\"Palindrome Partition\",938,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/932\\\"\\u003eICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"洛谷-P5280\":[\"线段树\",1146,\"ZJOI2019\"],\"洛谷-P8435\":[\"点双连通分量\",8432,\"模板\"],\"CodeForces-891C\":[\"Envy\",2415,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/891\\\"\\u003eCodeforces Round 446 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P4195\":[\"扩展 BSGS/exBSGS\",6884,\"模板\"],\"洛谷-P8436\":[\"边双连通分量\",8898,\"模板\"],\"洛谷-P5163\":[\"WD与地图\",663,null],\"洛谷-P5284\":[\"字符串问题\",1331,\"十二省联考 2019\"],\"CodeForces-1420C2\":[\"Pokémon Army (hard version)\",4674,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1420\\\"\\u003eCodeforces Round 672 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P5048\":[\"Yuno loves sqrt technology III\",2926,\"Ynoi2019 模拟赛\"],\"洛谷-P5047\":[\"Yuno loves sqrt technology II\",1998,\"Ynoi2019 模拟赛\"],\"洛谷-P5960\":[\"差分约束\",18301,\"模板\"],\"CodeForces-160D\":[\"Edges in MST\",2691,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/160\\\"\\u003eCodeforces Round 111 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P5046\":[\"Yuno loves sqrt technology I\",1375,\"Ynoi2019 模拟赛\"],\"LibreOJ-6714\":[\"Stupid Product\",114,null],\"洛谷-P4513\":[\"小白逛公园\",11129,null],\"洛谷-P1486\":[\"郁闷的出纳员\",10635,\"NOI2004\"],\"CodeForces-1404E\":[\"Bricks\",1172,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1404\\\"\\u003eCodeforces Round 668 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3308\":[\"LIS\",688,\"SDOI2014\"],\"LibreOJ-3322\":[\"购物计划\",62,\"CCO 2020\"],\"洛谷-P4516\":[\"潜入行动\",3589,\"JSOI2018\"],\"LibreOJ-6277\":[\"数列分块入门 1\",9459,null],\"LibreOJ-6036\":[\"编码\",390,\"雅礼集训 2017 Day4\"],\"CodeForces-1036C\":[\"Classy Numbers\",9318,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1036\\\"\\u003eEducational Codeforces Round 50 (Rated for Div. 2)\\u003c/a\\u003e\"],\"UniversalOJ-228\":[\"基础数据结构练习题\",1567,null],\"CodeForces-1036F\":[\"Relatively Prime Powers\",1464,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1036\\\"\\u003eEducational Codeforces Round 50 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-628D\":[\"Magic Numbers\",6170,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/628\\\"\\u003eEducational Codeforces Round 8\\u003c/a\\u003e\"],\"洛谷-P7114\":[\"字符串匹配\",5719,\"NOIP2020\"],\"黑暗爆炸-3774\":[\"最优选择\",46,\"\"],\"洛谷-P5297\":[\"完美塔防\",237,\"北京省选集训2019\"],\"洛谷-P8204\":[\"tdnmo\",79,\"Ynoi2005\"],\"CodeForces-587F\":[\"Duff is Mad\",1082,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/587\\\"\\u003eCodeforces Round 326 (Div. 1)\\u003c/a\\u003e\"],\"黑暗爆炸-3894\":[\"文理分科\",158,\"\"],\"UniversalOJ-460\":[\"新年的拯救计划\",331,null],\"LibreOJ-6709\":[\"运货\",31,\"RCOI2019\"],\"洛谷-P4762\":[\"Virus synthesis\",1269,\"CERC2014\"],\"CodeForces-280C\":[\"Game on Tree\",3965,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/280\\\"\\u003eCodeforces Round 172 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P1495\":[\"中国剩余定理(CRT)/ 曹冲养猪\",23726,\"模板\"],\"洛谷-P4887\":[\"莫队二次离线(第十四分块(前体))\",2531,\"模板\"],\"Gym-102978I\":[\"Inverse Problem\",351,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102978\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eXXI Open Cup, Grand Prix of Tokyo\\u003c/a\\u003e\"],\"AtCoder-dp_v\":[\"Subtree\",348,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"CodeForces-1209H\":[\"Moving Walkways\",137,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1209\\\"\\u003eCodeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"AtCoder-dp_s\":[\"Digit Sum\",766,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"洛谷-P4768\":[\"归程\",6828,\"NOI2018\"],\"洛谷-P3437\":[\"TET-Tetris 3D\",1382,\"POI2006\"],\"HDU-3507\":[\"Print Article\",4493,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A87%A3%A9%A1%AA%A1%AAHost+by+HIT+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(7)——Host by HIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P3317\":[\"重建\",2196,\"SDOI2014\"],\"Gym-104053L\":[\"Station of Fate\",1265,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104053\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022 China Collegiate Programming Contest (CCPC) Guangzhou Onsite\\u003c/a\\u003e\"],\"LibreOJ-6003\":[\"魔术球\",926,\"网络流 24 题\"],\"CodeForces-1398F\":[\"Controversial Rounds\",1093,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1398\\\"\\u003eEducational Codeforces Round 93 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-833B\":[\"The Bakery\",4791,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/833\\\"\\u003eCodeforces Round 426 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-954F\":[\"Runner\\u0027s Problem\",1031,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/954\\\"\\u003eEducational Codeforces Round 40 (Rated for Div. 2)\\u003c/a\\u003e\"],\"UniversalOJ-671\":[\"诡异操作\",265,\"UNR #5\"],\"黑暗爆炸-3569\":[\"DZY Loves Chinese II\",148,\"By dzydaxueba\"],\"洛谷-P7125\":[\"rsmemq\",267,\"Ynoi2008\"],\"LibreOJ-10035\":[\"Power Strings\",2702,\"一本通 2.1 练习 1\"],\"黑暗爆炸-1143\":[\"祭祀river\",108,\"CTSC2008\"],\"洛谷-P4097\":[\"李超线段树 / [HEOI2013] Segment\",6925,\"模板\"],\"CodeForces-671D\":[\"Roads in Yusland\",1241,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/671\\\"\\u003eCodeforces Round 352 (Div. 1)\\u003c/a\\u003e\"],\"LibreOJ-560\":[\"Menci 的序列\",189,\"LibreOJ Round #9\"],\"Gym-102978F\":[\"Find the LCA\",90,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102978\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eXXI Open Cup, Grand Prix of Tokyo\\u003c/a\\u003e\"],\"洛谷-P3684\":[\"机棚障碍 Hangar Hurdles\",999,\"CERC2016\"],\"洛谷-P8211\":[\"搬砖\",183,\"THUPC2022 初赛\"],\"洛谷-P7123\":[\"Indiana Jones and the Uniform Cave\",65,\"NEERC2016\"],\"CodeForces-55D\":[\"Beautiful numbers\",6034,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/55\\\"\\u003eCodeforces Beta Round 51\\u003c/a\\u003e\"],\"CodeForces-452F\":[\"Permutation\",1506,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/452\\\"\\u003eMemSQL Start[c]UP 2.0 - Round 1\\u003c/a\\u003e\"],\"AtCoder-tdpc_fibonacci\":[\"フィボナッチ\",36,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/tdpc\\\"\\u003eTypical DP Contest\\u003c/a\\u003e\"],\"QOJ-5412\":[\"甩锅\",7,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1092\\\"\\u003e北大集训 2020 Day 4(CTT 2020 Day 4)\\u003c/a\\u003e\"],\"洛谷-P4779\":[\"单源最短路径(标准版)\",125526,\"模板\"],\"洛谷-P3327\":[\"约数个数和\",6132,\"SDOI2015\"],\"CodeForces-1806E\":[\"Tree Master\",2785,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1806\\\"\\u003eCodeforces Round 858 (Div. 2)\\u003c/a\\u003e\"],\"LibreOJ-6254\":[\"最优卡组\",62,null],\"洛谷-P1829\":[\"Crash的数字表格 / JZPTAB\",6370,\"国家集训队\"],\"CodeForces-1288F\":[\"Red-Blue Graph\",536,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1288\\\"\\u003eEducational Codeforces Round 80 (Rated for Div. 2)\\u003c/a\\u003e\"],\"LibreOJ-575\":[\"不等关系\",719,\"LibreOJ NOI Round #2\"],\"黑暗爆炸-2109\":[\"Plane 航空管制\",31,\"Noi2010\"],\"洛谷-P2480\":[\"古代猪文\",5626,\"SDOI2010\"],\"洛谷-P2481\":[\"代码拍卖会\",1012,\"SDOI2010\"],\"洛谷-P3690\":[\"动态树(LCT)\",23243,\"模板\"],\"洛谷-P4782\":[\"2-SAT\",13183,\"模板\"],\"Gym-102759I\":[\"Query On A Tree 17\",156,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102759\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eXXI Open Cup, Grand Prix of Korea\\u003c/a\\u003e\"],\"LibreOJ-3632\":[\"Lovely Dogs\",144,\"2021 集训队互测\"],\"洛谷-P3455\":[\"ZAP-Queries\",7956,\"POI2007\"],\"洛谷-P1955\":[\"程序自动分析\",21644,\"NOI2015\"],\"洛谷-P1835\":[\"素数密度\",13451,null],\"CodeForces-1695E\":[\"Ambiguous Dominoes\",458,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1695\\\"\\u003eCodeforces Round 801 (Div. 2) and EPIC Institute of Technology Round\\u003c/a\\u003e\"],\"CodeForces-1097D\":[\"Makoto and a Blackboard\",2716,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1097\\\"\\u003eHello 2019\\u003c/a\\u003e\"],\"Gym-104160L\":[\"Tavern Chess\",973,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104160\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2022 ICPC Asia Shenyang Regional Contest (The 1st Universal Cup, Stage 1: Shenyang)\\u003c/a\\u003e\"],\"CodeForces-1182E\":[\"Product Oriented Recurrence\",2791,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1182\\\"\\u003eCodeforces Round 566 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1073E\":[\"Segment Sum\",2563,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1073\\\"\\u003eEducational Codeforces Round 53 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-895C\":[\"Square Subsets\",5494,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/895\\\"\\u003eCodeforces Round 448 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2495\":[\"消耗战\",9217,\"SDOI2011\"],\"LibreOJ-2417\":[\"262144\",249,\"USACO 2016 US Open, Platinum\"],\"洛谷-P2375\":[\"动物园\",11059,\"NOI2014\"],\"CodeForces-1517G\":[\"Starry Night Camping\",438,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1517\\\"\\u003eContest 2050 and Codeforces Round 718 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2257\":[\"YY的GCD\",8422,null],\"黑暗爆炸-1391\":[\"order\",232,\"Ceoi2008\"],\"洛谷-P5404\":[\"重复\",262,\"CTS2019\"],\"洛谷-P4555\":[\"最长双回文串\",6227,\"国家集训队\"],\"洛谷-P1962\":[\"斐波那契数列\",22136,null],\"洛谷-P4314\":[\"CPU 监控\",2585,null],\"洛谷-P4556\":[\"雨天的尾巴 /【模板】线段树合并\",11937,\"Vani有约会\"],\"LibreOJ-3089\":[\"奥术神杖\",513,\"BJOI2019\"],\"洛谷-P6619\":[\"冰火战士\",2547,\"省选联考 2020 A/B 卷\"],\"POJ-2348\":[\"Euclid\\u0027s Game\",4210,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2002.09.28\\\"\\u003eWaterloo local 2002.09.28\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-1137B\":[\"Camp Schedule\",6366,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1137\\\"\\u003eCodeforces Round 545 (Div. 1)\\u003c/a\\u003e\"],\"LibreOJ-2552\":[\"假面\",524,\"CTSC2018\"],\"CodeForces-1464E\":[\"No Game No Life\",8,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1464\\\"\\u003eCodeforces Round 692 (Div. 1, based on Technocup 2021 Elimination Round 3)\\u003c/a\\u003e\"],\"CodeForces-1464F\":[\"My Beautiful Madness\",312,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1464\\\"\\u003eCodeforces Round 692 (Div. 1, based on Technocup 2021 Elimination Round 3)\\u003c/a\\u003e\"],\"CodeForces-446C\":[\"DZY Loves Fibonacci Numbers\",3527,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/446\\\"\\u003eCodeforces Round #FF (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P1969\":[\"积木大赛\",37255,\"NOIP2013 提高组\"],\"CodeForces-1096E\":[\"The Top Scorer\",902,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1096\\\"\\u003eEducational Codeforces Round 57 (Rated for Div. 2)\\u003c/a\\u003e\"],\"Gym-104053E\":[\"Elevator\",1051,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104053\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022 China Collegiate Programming Contest (CCPC) Guangzhou Onsite\\u003c/a\\u003e\"],\"黑暗爆炸-3218\":[\"a + b Problem\",115,\"\"],\"Gym-104053H\":[\"GameX\",1104,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104053\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022 China Collegiate Programming Contest (CCPC) Guangzhou Onsite\\u003c/a\\u003e\"],\"黑暗爆炸-4788\":[\"Bipartite Blanket\",45,\"CERC2016\"],\"CodeForces-797F\":[\"Mice and Holes\",1296,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/797\\\"\\u003eEducational Codeforces Round 19\\u003c/a\\u003e\"],\"AtCoder-agc058_c\":[\"Planar Tree\",67,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc058\\\"\\u003eAtCoder Grand Contest 058\\u003c/a\\u003e\"],\"AtCoder-agc058_b\":[\"Adjacent Chmax\",472,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc058\\\"\\u003eAtCoder Grand Contest 058\\u003c/a\\u003e\"],\"洛谷-P7831\":[\"Travelling Merchant\",629,\"CCO2021\"],\"黑暗爆炸-4663\":[\"Hack\",14,\"\"],\"洛谷-P5653\":[\"基础最优化练习题\",260,null],\"洛谷-P2387\":[\"魔法森林\",4764,\"NOI2014\"],\"洛谷-P5410\":[\"扩展 KMP/exKMP(Z 函数)\",9231,\"模板\"],\"洛谷-P2147\":[\"洞穴勘测\",5798,\"SDOI2008\"],\"CodeForces-1746F\":[\"Kazaee\",1550,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1746\\\"\\u003eCodeforces Global Round 23\\u003c/a\\u003e\"],\"洛谷-P5656\":[\"二元一次不定方程 (exgcd)\",7595,\"模板\"],\"洛谷-P3357\":[\"最长k可重线段集问题\",1154,null],\"LibreOJ-6686\":[\"Stupid GCD\",104,null],\"洛谷-P3911\":[\"最小公倍数之和\",1814,null],\"HDU-5960\":[\"Subsequence\",104,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016ACM%2FICPC%D1%C7%D6%DE%C7%F8%C9%F2%D1%F4%D5%BE-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%B6%AB%B1%B1%B4%F3%D1%A7%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P2704\":[\"炮兵阵地\",20673,\"NOI2001\"],\"Baekjoon-20086\":[\"Roller Coaster Railroad\",25,\"\\u003ca href\\u003d\\\"https://creativecommons.org/licenses/by/3.0/\\\"\\u003e\\u003cimg src\\u003d\\\"CDN_BASE_URL/722c0d4d947e96557eb83669a0f035f8?v\\u003d1713148245\\\"\\u003e\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/2\\\"\\u003eOlympiad\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/99\\\"\\u003eInternational Olympiad in Informatics\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/548\\\"\\u003eIOI 2016\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/detail/2334\\\"\\u003eDay 1\\u003c/a\\u003e\\u0026nbsp;2번\"],\"LibreOJ-3176\":[\"景点划分\",333,\"IOI2019\"],\"CodeForces-1221F\":[\"Choose a Square\",1065,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1221\\\"\\u003eEducational Codeforces Round 73 (Rated for Div. 2)\\u003c/a\\u003e\"],\"UniversalOJ-513\":[\"清扫银河\",206,\"UR #19\"],\"CodeForces-838D\":[\"Airplane Arrangements\",948,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/838\\\"\\u003eIndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)\\u003c/a\\u003e\"],\"LibreOJ-2083\":[\"优秀的拆分\",684,\"NOI2016\"],\"CodeChef-FNCS\":[\"Chef and Churu\",878,\"devuy11\"],\"TopCoder-14719\":[\"RatingProgressAward\",55,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d17017\\u0026amp;pm\\u003d14719\\\"\\u003e2017 TCO Algorithm Semifinal 2 - Division I, Level Two\\u003c/a\\u003e\"],\"UniversalOJ-512\":[\"应对方案\",54,\"JOISC2020\"],\"黑暗爆炸-2039\":[\"employ人员雇佣\",39,\"2009国家集训队\"],\"黑暗爆炸-1066\":[\"蜥蜴\",133,\"SCOI2007 Pku 2711 Leapin\\u0027 Lizards\"],\"黑暗爆炸-2034\":[\"最大收益\",23,\"2009国家集训队 版权所有者: 冯齐纬\"],\"洛谷-P7600\":[\"封闭道路\",257,\"APIO2021\"],\"洛谷-P8375\":[\"游戏\",257,\"APIO2022\"],\"洛谷-P3366\":[\"最小生成树\",126586,\"模板\"],\"洛谷-P4213\":[\"杜教筛\",11846,\"模板\"],\"LibreOJ-121\":[\"动态图连通性\",1242,\"离线可过\"],\"洛谷-P3369\":[\"普通平衡树\",112215,\"模板\"],\"AtCoder-arc144_d\":[\"AND OR Equation\",176,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc144\\\"\\u003eAtCoder Regular Contest 144\\u003c/a\\u003e\"],\"洛谷-P5787\":[\"二分图 /【模板】线段树分治\",5347,null],\"洛谷-P8819\":[\"星战\",5275,\"CSP-S 2022\"],\"洛谷-P4219\":[\"大融合\",4287,\"BJOI2014\"],\"洛谷-P3807\":[\"卢卡斯定理/Lucas 定理\",20082,\"模板\"],\"CodeChef-CHEFMOD\":[\"Chef and Modular Sequence\",30,\"rahuldugar\"],\"洛谷-P3805\":[\"manacher\",32625,\"模板\"],\"CodeForces-1842G\":[\"Tenzing and Random Operations\",1014,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1842\\\"\\u003eCodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-607B\":[\"Zuma\",12355,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/607\\\"\\u003eCodeforces Round 336 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P8261\":[\"袜子\",33,\"CTS2022\"],\"CodeForces-739E\":[\"Gosha is hunting\",2275,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/739\\\"\\u003eCodeforces Round 381 (Div. 1)\\u003c/a\\u003e\"],\"Gym-104160D\":[\"DRX vs. T1\",1619,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104160\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2022 ICPC Asia Shenyang Regional Contest (The 1st Universal Cup, Stage 1: Shenyang)\\u003c/a\\u003e\"],\"洛谷-P3376\":[\"网络最大流\",83934,\"模板\"],\"黑暗爆炸-4562\":[\"食物链\",212,\"Haoi2016\"],\"洛谷-P3375\":[\"KMP\",78058,\"模板\"],\"洛谷-P3254\":[\"圆桌问题\",6295,null],\"洛谷-P5431\":[\"模意义下的乘法逆元 2\",8365,\"模板\"],\"AtCoder-arc156_d\":[\"Xor Sum 5\",153,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc156\\\"\\u003eAtCoder Regular Contest 156\\u003c/a\\u003e\"],\"CodeForces-1628D1\":[\"Game on Sum (Easy Version)\",3113,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1628\\\"\\u003eCodeforces Round 767 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P2048\":[\"超级钢琴\",7409,\"NOI2010\"],\"洛谷-P7739\":[\"密码箱\",755,\"NOI2021\"],\"Gym-103960K\":[\"Kalel, the Jumping Frog\",104,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103960\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022-2023 ICPC Brazil Subregional Programming Contest\\u003c/a\\u003e\"],\"洛谷-P3811\":[\"模意义下的乘法逆元\",36384,\"模板\"],\"洛谷-P7736\":[\"路径交点\",1183,\"NOI2021\"],\"洛谷-P7737\":[\"庆典\",896,\"NOI2021\"],\"Gym-103960I\":[\"Intercepting Information\",2414,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103960\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022-2023 ICPC Brazil Subregional Programming Contest\\u003c/a\\u003e\"],\"CodeForces-1215E\":[\"Marbles\",3076,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1215\\\"\\u003eCodeforces Round 585 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-917C\":[\"Pollywog\",424,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/917\\\"\\u003eCodeforces Round 459 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1198D\":[\"Rectangle Painting 1\",3187,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1198\\\"\\u003eCodeforces Round 576 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1380F\":[\"Strange Addition\",804,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1380\\\"\\u003eEducational Codeforces Round 91 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P6091\":[\"原根\",2812,\"模板\"],\"黑暗爆炸-2612\":[\"Sums\",46,\"Poi2003\"],\"Gym-100418C\":[\"Substrings\",70,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100418\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2013-2014 BSUIR Open Programming Championship. Final\\u003c/a\\u003e\"],\"Gym-100418A\":[\"A+-B\",578,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100418\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2013-2014 BSUIR Open Programming Championship. Final\\u003c/a\\u003e\"],\"UniversalOJ-172\":[\"论战捆竹竿\",184,\"WC2016\"],\"洛谷-P6772\":[\"美食家\",2134,\"NOI2020\"],\"QOJ-5254\":[\"Differences\",105,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1070\\\"\\u003e2022-2023 ICPC Central Europe Regional Contest\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/1070?v\\u003d1\\\"\\u003eThe 1st Universal Cup. Stage 8: Slovenia\\u003c/a\\u003e\"],\"黑暗爆炸-1641\":[\"Cow Hurdles 奶牛跨栏\",98,\"Usaco2007 Nov\"],\"洛谷-P3384\":[\"重链剖分/树链剖分\",42706,\"模板\"],\"Gym-100418D\":[\"BOPC\",274,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100418\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2013-2014 BSUIR Open Programming Championship. Final\\u003c/a\\u003e\"],\"洛谷-P3381\":[\"最小费用最大流\",37433,\"模板\"],\"Gym-100418J\":[\"Lucky tickets\",247,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100418\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2013-2014 BSUIR Open Programming Championship. Final\\u003c/a\\u003e\"],\"黑暗爆炸-3144\":[\"切糕\",135,\"Hnoi2013\"],\"洛谷-P3146\":[\"248 G\",17960,\"USACO16OPEN\"],\"Gym-100418H\":[\"Equalize\",109,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100418\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2013-2014 BSUIR Open Programming Championship. Final\\u003c/a\\u003e\"],\"洛谷-P5443\":[\"桥梁\",1140,\"APIO2019\"],\"洛谷-P6774\":[\"时代的眼泪\",482,\"NOI2020\"],\"洛谷-P1880\":[\"石子合并\",61220,\"NOI1995\"],\"洛谷-P6657\":[\"LGV 引理\",1283,\"模板\"],\"POJ-3233\":[\"Matrix Power Series\",9308,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.06.03\\\"\\u003ePOJ Monthly--2007.06.03\\u003c/a\\u003e, Huang, Jinsong\\u003c/div\\u003e\"],\"黑暗爆炸-1070\":[\"修车\",156,\"SCOI2007\"],\"洛谷-P5325\":[\"Min_25 筛\",4871,\"模板\"],\"洛谷-P5446\":[\"绿绿和串串\",1864,\"THUPC2018\"],\"CodeForces-1238E\":[\"Keyboard Purchase\",3117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1238\\\"\\u003eEducational Codeforces Round 74 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P3703\":[\"树点涂色\",2299,\"SDOI2017\"],\"洛谷-P3825\":[\"游戏\",3495,\"NOI2017\"],\"Gym-100257J\":[\"Jigsaw Puzzle\",66,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100257\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2013-2014 ACM-ICPC, NEERC, Moscow Subregional Contest\\u003c/a\\u003e\"],\"Gym-103470E\":[\"Paimon Segment Tree\",148,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103470\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2021 ICPC Asia Nanjing Regional Contest (XXII Open Cup, Grand Prix of Nanjing)\\u003c/a\\u003e\"],\"洛谷-P2617\":[\"Dynamic Rankings\",11570,null],\"CodeForces-438D\":[\"The Child and Sequence\",9316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/438\\\"\\u003eCodeforces Round 250 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-819E\":[\"Mister B and Flight to the Moon\",558,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/819\\\"\\u003eCodeforces Round 421 (Div. 1)\\u003c/a\\u003e\"],\"HDU-6722\":[\"唯一指定树\",34,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2019+%C4%EA%B0%D9%B6%C8%D6%AE%D0%C7%A1%A4%B3%CC%D0%F2%C9%E8%BC%C6%B4%F3%C8%FC+-+%B3%F5%C8%FC%CB%C4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2019 年百度之星·程序设计大赛 - 初赛四 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-915E\":[\"Physical Education Lessons\",4334,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-547D\":[\"Mike and Fish\",2694,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/547\\\"\\u003eCodeforces Round 305 (Div. 1)\\u003c/a\\u003e\"],\"AtCoder-abc170_d\":[\"Not Divisible\",3649,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc170\\\"\\u003eAtCoder Beginner Contest 170\\u003c/a\\u003e\"],\"洛谷-P3391\":[\"文艺平衡树\",29450,\"模板\"],\"CodeForces-741D\":[\"Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths\",2768,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/741\\\"\\u003eCodeforces Round 383 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-765F\":[\"Souvenirs\",2032,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/765\\\"\\u003eCodeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"洛谷-P4121\":[\"双面棋盘\",537,\"WC2005\"],\"洛谷-P4240\":[\"毒瘤之神的考验\",1281,null],\"洛谷-P4003\":[\"无限之环\",1689,null],\"洛谷-P9136\":[\"种苹果\",65,\"THUPC 2023 初赛\"],\"LibreOJ-2840\":[\"糖\",238,\"JOISC 2018 Day 4\"],\"洛谷-P4249\":[\"剪刀石头布\",1646,\"WC2007\"],\"QOJ-5825\":[\"矩阵\",74,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1150\\\"\\u003e2023 年广东省重点中学信息学邀请赛 (GDKOI 2023) 提高组 第一试\\u003c/a\\u003e\"],\"CodeForces-275D\":[\"Zero Tree\",127,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/275\\\"\\u003eCodeforces Round 168 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1479D\":[\"Odd Mineral Resource\",1000,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1479\\\"\\u003eCodeforces Round 700 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3835\":[\"可持久化平衡树\",7712,\"模板\"],\"洛谷-P7515\":[\"矩阵游戏\",2000,\"省选联考 2021 A 卷\"],\"LibreOJ-6401\":[\"yww 与字符串\",208,null],\"洛谷-P3834\":[\"可持久化线段树 2\",39812,\"模板\"],\"CodeForces-401D\":[\"Roman and Numbers\",4470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/401\\\"\\u003eCodeforces Round 235 (Div. 2)\\u003c/a\\u003e\"],\"Gym-101173D\":[\"Dancing Disks\",49,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101173\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2016-2017 ACM-ICPC, Central Europe Regional Contest (CERC 16)\\u003c/a\\u003e\"],\"CodeForces-1770E\":[\"Koxia and Tree\",1322,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1770\\\"\\u003eGood Bye 2022: 2023 is NEAR\\u003c/a\\u003e\"],\"洛谷-B3611\":[\"传递闭包\",6825,\"模板\"],\"POJ-1704\":[\"Georgia and Bob\",4834,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2004.07.18\\\"\\u003ePOJ Monthly--2004.07.18\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-1588F\":[\"Jumping Through the Array\",282,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1588\\\"\\u003eCodeforces Round 755 (Div. 1, based on Technocup 2022 Elimination Round 2)\\u003c/a\\u003e\"],\"UniversalOJ-710\":[\"魔塔 OL\",81,\"北大集训2021\"],\"黑暗爆炸-2879\":[\"美食节\",32,\"Noi2012\"],\"洛谷-P3285\":[\"方伯伯的OJ\",1475,\"SCOI2014\"],\"洛谷-P4011\":[\"孤岛营救问题\",3630,null],\"洛谷-P2197\":[\"Nim 游戏\",16824,\"模板\"],\"Baekjoon-17462\":[\"MST and Rectangles\",7,\"\\u003cli\\u003e문제의 오타를 찾은 사람:\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/user/bjwj5505\\\"\\u003ebjwj5505\\u003c/a\\u003e\\u003c/li\\u003e\\u003cli\\u003e문제를 만든 사람:\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/user/koosaga\\\"\\u003ekoosaga\\u003c/a\\u003e\\u003c/li\\u003e\"],\"洛谷-P3165\":[\"排序机械臂\",2687,\"CQOI2014\"],\"黑暗爆炸-4010\":[\"菜肴制作\",160,\"HNOI2015\"],\"洛谷-B3609\":[\"强连通分量\",3869,\"图论与代数结构 701\"],\"黑暗爆炸-2180\":[\"最小直径生成树\",62,\"\"],\"Gym-103048K\":[\"K-Primes\",600,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103048\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2021 ECNU Campus Invitational Contest\\u003c/a\\u003e\"],\"洛谷-P2633\":[\"Count on a tree\",6252,null],\"洛谷-P5468\":[\"回家路线\",2326,\"NOI2019\"],\"洛谷-P3846\":[\"可爱的质数/【模板】BSGS\",10583,\"TJOI2007\"],\"洛谷-P5904\":[\"HOT-Hotels 加强版\",1913,\"POI2014\"],\"洛谷-P3726\":[\"抛硬币\",722,\"AH2017/HNOI2017\"],\"洛谷-P5903\":[\"树上 K 级祖先\",4451,\"模板\"],\"洛谷-P2757\":[\"等差子序列\",2458,\"国家集训队\"],\"CodeForces-1103C\":[\"Johnny Solving\",833,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1103\\\"\\u003eCodeforces Round 534 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1333E\":[\"Road to 1600\",1506,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1333\\\"\\u003eCodeforces Round 632 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1442D\":[\"Sum\",2132,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1442\\\"\\u003eCodeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final)\\u003c/a\\u003e\"],\"HDU-6184\":[\"Counting Stars\",562,\"\\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\"],\"CodeForces-1280D\":[\"Miss Punyverse\",968,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1280\\\"\\u003eCodeforces Round 607 (Div. 1)\\u003c/a\\u003e\"],\"AtCoder-agc019_f\":[\"Yes or No\",141,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc019\\\"\\u003eAtCoder Grand Contest 019\\u003c/a\\u003e\"],\"CodeForces-666E\":[\"Forensic Examination\",1459,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/666\\\"\\u003eCodeforces Round 349 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-896C\":[\"Willem, Chtholly and Seniorious\",3293,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/896\\\"\\u003eCodeforces Round 449 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3295\":[\"萌萌哒\",3297,\"SCOI2016\"],\"洛谷-P3293\":[\"美味\",3049,\"SCOI2016\"],\"洛谷-P5471\":[\"弹跳\",1603,\"NOI2019\"],\"CodeForces-95E\":[\"Lucky Country\",1699,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/95\\\"\\u003eCodeforces Beta Round 77 (Div. 1 Only)\\u003c/a\\u003e\"],\"洛谷-P2762\":[\"太空飞行计划问题\",5528,null],\"HDU-5306\":[\"Gorgeous Sequence\",2093,\"\\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+2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P2522\":[\"Problem b\",8487,\"HAOI2011\"],\"洛谷-P2766\":[\"最长不下降子序列问题\",5010,null],\"CodeForces-1774F1\":[\"Magician and Pigs (Easy Version)\",1022,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1774\\\"\\u003ePolynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1774F2\":[\"Magician and Pigs (Hard Version)\",644,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1774\\\"\\u003ePolynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1299D\":[\"Around the World\",441,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1299\\\"\\u003eCodeforces Round 618 (Div. 1)\\u003c/a\\u003e\"],\"LibreOJ-6068\":[\"棋盘\",151,\"2017 山东一轮集训 Day4\"],\"SPOJ-DIVCNT3\":[\"Counting Divisors (cube)\",452,\"\"],\"CodeForces-1033C\":[\"Permutation Game\",5649,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1033\\\"\\u003eLyft Level 5 Challenge 2018 - Elimination Round\\u003c/a\\u003e\"],\"LibreOJ-6062\":[\"Pair\",446,\"2017 山东一轮集训 Day2\"],\"CodeForces-1396B\":[\"Stoned Game\",11098,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1396\\\"\\u003eCodeforces Round 666 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-528C\":[\"Data Center Drama\",164,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/528\\\"\\u003eCodeforces Round 296 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1372E\":[\"Omkar and Last Floor\",1034,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1372\\\"\\u003eCodeforces Round 655 (Div. 2)\\u003c/a\\u003e\"],\"Gym-102201J\":[\"Jealous Teachers\",50,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102201\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eMoscow Pre-Finals Workshop 2019. KAIST Contest\\u003c/a\\u003e\"],\"洛谷-P4151\":[\"最大XOR和路径\",4882,\"WC2011\"],\"LibreOJ-10059\":[\"Censoring\",623,\"一本通 2.4 练习 2\"],\"洛谷-P7425\":[\"机场\",110,\"THUPC2017\"],\"洛谷-P8078\":[\"秃子酋长\",1078,\"WC2022\"],\"洛谷-P6577\":[\"二分图最大权完美匹配\",4119,\"模板\"],\"洛谷-P3980\":[\"志愿者招募\",3861,\"NOI2008\"],\"AtCoder-arc141_f\":[\"Well-defined Abbreviation\",15,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc141\\\"\\u003eAtCoder Regular Contest 141\\u003c/a\\u003e\"],\"CodeForces-1109B\":[\"Sasha and One More Name\",4466,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1109\\\"\\u003eCodeforces Round 539 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P1447\":[\"能量采集\",7086,\"NOI2010\"],\"洛谷-P2657\":[\"windy 数\",20761,\"SCOI2009\"],\"洛谷-P2414\":[\"阿狸的打字机\",5002,\"NOI2011\"],\"Gym-103640K\":[\"KIARA is a Recursive Acronym\",1593,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103640\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2021-2022 ACM-ICPC Latin American Regional Programming Contest\\u003c/a\\u003e\"],\"CodeForces-244B\":[\"Undoubtedly Lucky Numbers\",4871,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/244\\\"\\u003eCodeforces Round 150 (Div. 2)\\u003c/a\\u003e\"],\"LibreOJ-6079\":[\"养猫\",170,\"2017 山东一轮集训 Day7\"],\"洛谷-P4719\":[\"\\\"动态 DP\\\"\\u0026动态树分治\",6834,\"模板\"],\"Gym-103640F\":[\"Fields Division\",1244,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103640\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2021-2022 ACM-ICPC Latin American Regional Programming Contest\\u003c/a\\u003e\"],\"Gym-103446K\":[\"Circle of Life\",488,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103446\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2021 ICPC Asia Shanghai Regional Programming Contest\\u003c/a\\u003e\"],\"洛谷-P3628\":[\"特别行动队\",7081,\"APIO2010\"],\"Gym-104460L\":[\"Digit Product\",936,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104460\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2019 ICPC China Shaanxi Provincial Programming Contest\\u003c/a\\u003e\"],\"LibreOJ-2153\":[\"互不侵犯\",1610,\"SCOI2005\"],\"CodeForces-1654E\":[\"Arithmetic Operations\",2009,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1654\\\"\\u003eCodeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round)\\u003c/a\\u003e\"],\"HDU-4348\":[\"To the moon\",1896,\"\\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+5\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 5 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LibreOJ-6076\":[\"三元组\",130,\"2017 山东一轮集训 Day6\"],\"CodeForces-1286D\":[\"LCC\",608,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1286\\\"\\u003eCodeforces Round 612 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1303G\":[\"Sum of Prefix Sums\",778,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1303\\\"\\u003eEducational Codeforces Round 82 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P8880\":[\"无知时诋毁原神\",797,null],\"洛谷-P4168\":[\"蒲公英\",11059,\"Violet\"],\"洛谷-P9058\":[\"rpmtdq\",483,\"Ynoi2004\"],\"洛谷-P4287\":[\"双倍回文\",3820,\"SHOI2011\"],\"洛谷-P2304\":[\"小园丁与老司机\",961,\"NOI2015\"],\"Gym-103861H\":[\"Check Pattern is Good\",19,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103861\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2021 ICPC Asia East Continent Final\\u003c/a\\u003e\"],\"CodeForces-1394C\":[\"Boboniu and String\",975,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1394\\\"\\u003eCodeforces Round 664 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1394D\":[\"Boboniu and Jianghu\",923,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1394\\\"\\u003eCodeforces Round 664 (Div. 1)\\u003c/a\\u003e\"],\"UniversalOJ-117\":[\"欧拉回路\",2855,null],\"LibreOJ-6280\":[\"数列分块入门 4\",6694,null],\"UniversalOJ-476\":[\"重复\",51,\"CTS2019\"],\"CodeForces-1043F\":[\"Make It One\",2316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1043\\\"\\u003eCodeforces Round 519 by Botan Investments\\u003c/a\\u003e\"],\"洛谷-P7560\":[\"フードコート\",341,\"JOISC 2021 Day1\"],\"黑暗爆炸-4977\":[\"跳伞求生\",202,\"[Lydsy1708月赛\"],\"黑暗爆炸-2437\":[\"兔兔与蛋蛋\",26,\"Noi2011 Day2\"],\"Gym-104090C\":[\"No Bug No Game\",910,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104090\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2022 ICPC Asia Hangzhou Regional Programming Contest\\u003c/a\\u003e\"],\"HDU-2609\":[\"How many\",2358,\"\\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\"],\"黑暗爆炸-4974\":[\"字符串大师\",229,\"Lydsy1708月赛\"],\"SPOJ-QTREE5\":[\"Query on a tree V\",2161,\"XunYunbo, modified from ZJOI07\"],\"洛谷-P3402\":[\"可持久化并查集\",8489,null],\"CodeForces-1458C\":[\"Latin Square\",1235,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1458\\\"\\u003eCodeforces Round 691 (Div. 1)\\u003c/a\\u003e\"],\"QOJ-4405\":[\"普罗霍洛夫卡\",18,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/963\\\"\\u003eIOI 2022 中国国家队选拔 第一试 (CTS 2022 Day 1)\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/1167\\\"\\u003e模板训练 2023 Spring\\u003c/a\\u003e\"],\"洛谷-P1587\":[\"循环之美\",4792,\"NOI2016\"],\"LibreOJ-2133\":[\"品酒大会\",632,\"NOI2015\"],\"洛谷-P1347\":[\"排序\",10293,null],\"洛谷-P4735\":[\"最大异或和\",8125,null],\"LibreOJ-2377\":[\"差异\",669,\"AHOI2013\"],\"CodeForces-1178F1\":[\"Short Colorful Strip\",2092,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1178\\\"\\u003eCodeforces Global Round 4\\u003c/a\\u003e\"],\"Gym-104090D\":[\"Money Game\",1752,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104090\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2022 ICPC Asia Hangzhou Regional Programming Contest\\u003c/a\\u003e\"],\"CodeForces-809D\":[\"Hitchhiking in the Baltic States\",850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/809\\\"\\u003eCodeforces Round 415 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1187F\":[\"Expected Square Beauty\",924,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1187\\\"\\u003eEducational Codeforces Round 67 (Rated for Div. 2)\\u003c/a\\u003e\"],\"LibreOJ-6053\":[\"简单的函数\",2282,null],\"Gym-104090I\":[\"Guess Cycle Length\",153,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104090\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2022 ICPC Asia Hangzhou Regional Programming Contest\\u003c/a\\u003e\"],\"CodeForces-1313E\":[\"Concatenation with intersection\",543,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1313\\\"\\u003eCodeforces Round 622 (Div. 2)\\u003c/a\\u003e\"],\"Gym-101234D\":[\"Forest Game\",87,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101234\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2016-2017 National Taiwan University World Final Team Selection Contest\\u003c/a\\u003e\"],\"CodeForces-888G\":[\"Xor-MST\",4387,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/888\\\"\\u003eEducational Codeforces Round 32\\u003c/a\\u003e\"],\"CodeForces-997C\":[\"Sky Full of Stars\",1836,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/997\\\"\\u003eCodeforces Round 493 (Div. 1)\\u003c/a\\u003e\"],\"LibreOJ-537\":[\"DNA 序列\",1793,\"LibreOJ NOIP Round #1\"],\"Baekjoon-13973\":[\"Acrobat\",19,\"\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/2\\\"\\u003eOlympiad\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/94\\\"\\u003eBalkan Olympiad in Informatics\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/detail/1582\\\"\\u003eBOI 2016\\u003c/a\\u003e\\u0026nbsp;6번\\u003cbr\\u003e\\u003cli\\u003e빠진 조건을 찾은 사람:\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/user/kdh9949\\\"\\u003ekdh9949\\u003c/a\\u003e\\u003c/li\\u003e\"],\"洛谷-P6242\":[\"线段树 3(区间最值操作、区间历史最值)\",4596,\"模板\"],\"洛谷-P3772\":[\"游戏\",341,\"CTSC2017\"],\"洛谷-P3773\":[\"吉夫特\",1652,\"CTSC2017\"],\"洛谷-P1352\":[\"没有上司的舞会\",49829,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"hellolin","updateTime":1707920259000,"title":"ZR 2023 Summer C Workbook (Unofficial)","dislikeCnt":0,"content":"\u003cdiv align\u003d\"center\"\u003e\n\u003ch2\u003e\nZR 2023 Summer \u003ca href\u003d\"/\"\u003eA\u003c/a\u003e / \u003ca href\u003d\"/article/3908\"\u003eB\u003c/a\u003e / C / \u003ca href\u003d\"/article/3910\"\u003eD\u003c/a\u003e Workbook\n\u003c/h2\u003e\n\u003ch5\u003e\n\u003ci\u003eUnofficial collection. Made by \u003ca href\u003d\"https://hellolin.cf/\" target\u003d\"_blank\"\u003ehellolin\u003c/a\u003e.\u003c/i\u003e\n\u003c/h5\u003e\n\u003c/div\u003e\n\n---\n\nZR 2023 Summer 集训课程已于 2023.08.15 结束。\n\n除了更新错题漏题之外,本题单将不会增加任何新题目。\n\n**请注意,在 VJudge 上,比赛的提交直到结束后才算入题库提交,所以即使在未结束的比赛中过了某题,下面的列表中也不会显示 AC。**\n\n## Section1 - 数据结构 - Day 1~7\n\n### Day1 - 2023.07.17\n\n- 专题:基础础数据结构及其应⽤(倍增、并查集、RMQ、树状数组、线段树)\n- 讲师:徐锐扬\n- 题目:8 道\n\n[problem:洛谷-P1955]\n[problem:洛谷-P6619]\n[problem:洛谷-P3295]\n[problem:洛谷-P5280]\n[problem:CodeForces-891C]\n[problem:洛谷-P4768]\n[problem:洛谷-P2048]\n[problem:洛谷-P7600]\n\n### Day2 - 2023.07.18\n\n- 专题:线段树进阶扩展(扫描线、动态开点线段树、线段树合并)\n- 讲师:高麟翔\n- 题目:12 道\n\n[problem:洛谷-P4513]\n[problem:CodeForces-446C]\n[problem:洛谷-P2757]\n[problem:CodeForces-452F]\n[problem:洛谷-P3293]\n[problem:洛谷-P4121]\n[problem:CodeForces-1221F]\n[problem:CodeForces-438D]\n[problem:UniversalOJ-228]\n[problem:洛谷-P4556]\n[problem:洛谷-P4097]\n[problem:洛谷-P7560]\n\n### Day3 - 2023.07.19\n\n- 专题:基础分块算法与离线算法(莫队、整体⼆分、时间线段树)\n- 讲师:张家瑞\n- 题目:23 道\n- ![](https://s2.loli.net/2023/07/20/2WmgStbaNPq1JTE.png)\n\n[problem:LibreOJ-6277]\n[problem:LibreOJ-6280]\n[problem:CodeForces-1806E]\n[problem:CodeChef-FNCS]\n[problem:CodeForces-587F]\n[problem:CodeForces-1340F]\n[problem:洛谷-P7125]\n[problem:洛谷-P8204]\n[problem:洛谷-P8211]\n[problem:洛谷-P9136]\n[problem:洛谷-P5443]\n[problem:CodeForces-1588F]\n[problem:UniversalOJ-710]\n[problem:洛谷-P8261]\n[problem:洛谷-P4168]\n[problem:洛谷-P4887]\n[problem:洛谷-P5046]\n[problem:洛谷-P5047]\n[problem:洛谷-P5048]\n[problem:洛谷-P6774]\n[problem:CodeForces-765F]\n[problem:UniversalOJ-671]\n[problem:QOJ-4405]\n[problem:洛谷-P8078]\n[problem:洛谷-P8375]\n\n### Day4 - 2023.07.20\n\n- 专题:平衡树及其应⽤(Splay,Treap)、LCT\n- 讲师:高麟翔\n- 题目:14 道\n\n[problem:洛谷-P3369]\n[problem:洛谷-P3391]\n[problem:洛谷-P1486]\n[problem:洛谷-P3285]\n[problem:洛谷-P3165]\n[problem:CodeForces-915E]\n[problem:CodeForces-896C]\n[problem:CodeForces-809D]\n[problem:洛谷-P7739]\n[problem:洛谷-P3690]\n[problem:洛谷-P2147]\n[problem:洛谷-P2387]\n[problem:洛谷-P4219]\n[problem:洛谷-P3703]\n\n### Day5 - 2023.07.21\n\n- 专题:树上信息维护(树链剖分、可并堆、启发式合并)、可持久化数据结构、点分治 $^\\ddag$\n- 讲师:高麟翔\n- 题目:16 道\n\n[problem:洛谷-P4735]\n[problem:洛谷-P5283]\n[problem:洛谷-P3834]\n[problem:洛谷-P2633]\n[problem:洛谷-P2617]\n[problem:UniversalOJ-218]\n[problem:HDU-4348]\n[problem:洛谷-P3402]\n[problem:洛谷-P4768]\n[problem:洛谷-P3835]\n[problem:LibreOJ-2840]\n[problem:洛谷-P3384]\n[problem:CodeForces-741D]\n[problem:LibreOJ-3632]\n[problem:SPOJ-QTREE5]\n[problem:洛谷-P9058]\n\n### Day6 - 2023.07.22\n\n- 专题:~~点分治、点分树、~~ 虚树、长链剖分、线段树分治 $^\\ddag$\n- 讲师:高麟翔\n- 题目:11 道\n\n[problem:洛谷-P5903]\n[problem:洛谷-P5904]\n[problem:洛谷-P2495]\n[problem:LibreOJ-121]\n[problem:洛谷-P5787]\n[problem:洛谷-P4314]\n[problem:HDU-5306]\n[problem:洛谷-P6242]\n[problem:洛谷-P3437]\n[problem:CodeForces-1464F]\n[problem:Gym-102759I]\n\n### Day7 - 2023.07.23\n\n- 模拟赛。\n- 出题:高麟翔\n- 题目:4 道\n- 时长:3.5 小时\n\n## Section2 - 动态规划 - Day 8~12\n\n### Day8 - 2023.07.24\n\n- 专题:区间 DP、树形 DP\n- 讲师:李昕然\n- 题目:7 + 7 \u003d 14 道\n\n#### 例题\n\n[problem:洛谷-P1880]\n[problem:CodeForces-607B]\n[problem:CodeForces-1178F1]\n[problem:CodeForces-1198D]\n[problem:CodeForces-275D]\n[problem:AtCoder-dp_v]\n[problem:洛谷-P4516]\n\n#### 作业\n\n[problem:洛谷-P3146]\n[problem:LibreOJ-2417]\n[problem:CodeForces-1372E]\n[problem:洛谷-P1352]\n[problem:HDU-2196]\n[problem:CodeForces-1280D]\n[problem:CodeForces-1394D]\n\n### Day9 - 2023.07.25\n\n- 专题:状压 DP、数位 DP\n- 讲师:李昕然\n- 题目:7 + 8 \u003d 15 道\n\n#### 例题\n\n[problem:洛谷-P2704]\n[problem:CodeForces-895C]\n[problem:CodeForces-1215E]\n[problem:CodeForces-1299D]\n[problem:洛谷-P2657]\n[problem:CodeForces-628D]\n[problem:CodeForces-244B]\n\n\n#### 作业\n\n[problem:LibreOJ-2153]\n[problem:CodeForces-401D]\n[problem:CodeForces-1238E]\n[problem:AtCoder-dp_s]\n[problem:CodeForces-1036C]\n[problem:CodeForces-55D]\n[problem:CodeForces-1073E]\n[problem:Gym-100257J]\n\n### Day10 - 2023.07.26\n\n- 专题:dp优化(四边形不等式、斜率优化、决策单调性、CDQ分治、数据结构)\n- 讲师:李昕然\n- 题目:9 + 4 \u003d 13 道\n\n#### 例题\n\n[problem:CodeForces-797F]\n[problem:洛谷-P1912]\n[problem:HDU-3507]\n[problem:洛谷-P5468]\n[problem:CodeForces-1442D]\n[problem:CodeForces-1398F]\n[problem:CodeForces-95E]\n[problem:AtCoder-agc019_f]\n[problem:CodeForces-739E]\n\n#### 作业\n\n[problem:洛谷-P4072]\n[problem:洛谷-P3628]\n[problem:CodeForces-932F]\n[problem:CodeForces-833B]\n\n### Day11 - 2023.07.27\n\n- 专题:矩阵乘法dp、常系数齐次线性递推 $^\\dag$、动态dp $^\\dag$\n- 讲师:李昕然\n- 题目:10 + 3 \u003d 13 道\n\n#### 例题\n\n[problem:洛谷-P1962]\n[problem:AtCoder-tdpc_fibonacci]\n[problem:洛谷-P4719]\n[problem:POJ-3233]\n[problem:CodeForces-917C]\n[problem:洛谷-P6772]\n[problem:CodeForces-1420C2]\n[problem:Gym-103470E]\n[problem:CodeForces-1182E]\n[problem:CodeForces-1286D]\n\n#### 作业\n\n[problem:CodeForces-1380F]\n[problem:CodeForces-1458C]\n[problem:CodeForces-954F]\n\n### Day12 - 2023.07.28\n\n- 欢乐 ACM 赛(CD)。\n- [比赛链接](/contest/570501)\n- 整理:徐锐扬\n- 题目:11 道\n- 时长:5 小时\n\n[problem:Gym-100418H]\n[problem:Gym-104090D]\n[problem:Gym-100418A]\n[problem:Gym-100418C]\n[problem:Gym-104160D]\n[problem:Gym-104090C]\n[problem:Gym-100418D]\n[problem:Gym-103960K]\n[problem:Gym-100418J]\n[problem:Gym-104160L]\n[problem:Gym-103960I]\n\n## Section3 - 数学、数论 - Day13~19\n\n### Day13 - 2023.07.29\n\n- 专题:乘法逆元、同余、exgcd、线性代数基础、BSGS $^\\ddag$、原根 $^\\ddag$\n- 讲师:叶子川\n- 题目:13 道\n\n[problem:洛谷-P3811]\n[problem:洛谷-P5431]\n[problem:洛谷-P5656]\n[problem:洛谷-P1495]\n[problem:洛谷-P2480]\n[problem:洛谷-P3807]\n[problem:洛谷-P3773]\n[problem:洛谷-P3846]\n[problem:AtCoder-arc156_d]\n[problem:洛谷-P4195]\n[problem:洛谷-P6091]\n[problem:Gym-104090I]\n[problem:CodeChef-CHEFMOD] BONUS\n\n### Day14 - 2023.07.30\n\n- 专题:筛法(埃⽒筛、线性筛、杜教筛、Powerful Number 筛 $^{\\dag \\ddag}$、 min25筛 $^\\dag$)、莫⽐乌斯反演、狄利克雷卷积\n- 讲师:罗恺\n- 题目:17 道\n\n[problem:洛谷-P1835]\n[problem:AtCoder-abc170_d]\n[problem:洛谷-P3455]\n[problem:洛谷-P2522]\n[problem:洛谷-P3911]\n[problem:洛谷-P2257]\n[problem:洛谷-P1447]\n[problem:洛谷-P1829]\n[problem:洛谷-P3327]\n[problem:洛谷-P4240]\n[problem:洛谷-P4213]\n[problem:洛谷-P5325]\n[problem:LibreOJ-6053]\n[problem:SPOJ-DIVCNT3]\n[problem:LibreOJ-6714]\n[problem:LibreOJ-6686]\n[problem:洛谷-P1587]\n\n### Day15 - 2023.07.31\n\n- 专题:组合数学(容斥原理、树prufer序、Matrix-Tree定理、LGV引理 $^\\dag$)\n- 讲师:王泽远\n- 题目:11 道\n\n[problem:CodeForces-838D]\n[problem:CodeForces-1036F]\n[problem:CodeForces-1043F]\n[problem:CodeForces-997C]\n[problem:CodeForces-1096E]\n[problem:LibreOJ-575]\n[problem:洛谷-P3317]\n[problem:QOJ-5412]\n[problem:洛谷-P7736]\n[problem:洛谷-P6657]\n[problem:洛谷-P7737]\n\n### Day16 - 2023.08.01\n\n- 专题:概率期望、多项式、⽣成函数\n- 讲师:吕秋实\n- 题目:6 道\n\n[problem:CodeForces-280C]\n[problem:Gym-101234D]\n[problem:CodeForces-1097D]\n[problem:CodeForces-1187F]\n[problem:LibreOJ-2552]\n[problem:CodeForces-1842G]\n\n### Day17 - 2023.08.02\n\n- 专题:博弈论、SG函数\n- 讲师:吕秋实\n- 题目:8 道\n\n[problem:POJ-2348]\n[problem:CodeForces-1033C]\n[problem:CodeForces-1396B]\n[problem:CodeForces-1190B]\n[problem:洛谷-P2197]\n[problem:POJ-1704]\n[problem:CodeForces-1464E]\n[problem:CodeForces-1628D1]\n\n- 附加模拟赛。\n- 出题:不知道\n- 题目:3 道\n- 时长:3 小时\n\n### Day18 - 2023.08.03\n\n- 专题:构造\n- 讲师:吕秋实\n- 题目:理论上是 10 道\n\n[problem:洛谷-P8880]\n[problem:CodeForces-819E]\n[problem:UniversalOJ-460]\n[problem:Gym-101173D]\n[problem:Gym-103446K]\n[problem:CodeForces-1695E]\n\n### Day19 - 2023.08.04\n\n- 模拟赛。\n- 出题:吕秋实\n- 题目:4 道\n- 时长:3.5 小时\n\n## Section4 - 字符串 - Day20~24\n\n### Day20 - 2023.08.05\n\n- 专题:基础字符串算法(Hash、Trie、最小表示法、KMP、Manacher)\n- 讲师:吕秋实\n- 题目:12 道\n\n[problem:CodeForces-1109B]\n[problem:洛谷-P2757]\n[problem:洛谷-P8306]\n[problem:CodeForces-888G]\n[problem:HDU-2609]\n[problem:洛谷-P3805]\n[problem:洛谷-P4287]\n[problem:洛谷-P5446]\n[problem:洛谷-P3375]\n[problem:洛谷-P5410]\n[problem:CodeForces-1137B]\n[problem:洛谷-P2375]\n\n### Day21 - 2023.08.06\n\n- 专题:进阶算法(扩展KMP、AC自动机、回文树)\n- 讲师:yny\n- 题目:16 道\n\n[problem:黑暗爆炸-4974]\n[problem:LibreOJ-10035]\n[problem:洛谷-P2375]\n[problem:洛谷-P7114]\n[problem:LibreOJ-537]\n[problem:LibreOJ-10059]\n[problem:洛谷-P2414]\n[problem:AtCoder-arc141_f]\n[problem:洛谷-P4555]\n[problem:洛谷-P4287]\n[problem:洛谷-P4762]\n[problem:CodeForces-932G]\n[problem:LibreOJ-3089]\n[problem:CodeForces-1313E]\n[problem:UniversalOJ-172]\n[problem:UniversalOJ-476]\n\n### Day22 - 2023.08.07\n\n- 专题:后缀数组与后缀⾃动机(⼴义 SAM $^\\dag$)\n- 讲师:yny\n- 题目:5 道\n\n[problem:LibreOJ-2377]\n[problem:LibreOJ-2083]\n[problem:LibreOJ-2133]\n[problem:LibreOJ-6401]\n[problem:CodeForces-666E]\n\n### Day23 - 2023.08.08\n\n- 专题:趣题(杂题)选做\n- 讲师:yny\n- 题目:14 道\n\n[problem:洛谷-P5404]\n[problem:洛谷-P3980]\n[problem:AtCoder-arc144_d]\n[problem:AtCoder-agc058_b]\n[problem:LibreOJ-560]\n[problem:AtCoder-agc058_c]\n[problem:LibreOJ-6709]\n[problem:洛谷-P2481]\n[problem:洛谷-P3772]\n[problem:洛谷-P3726]\n[problem:CodeForces-1774F1]\n[problem:CodeForces-1774F2]\n[problem:CodeForces-1770E]\n[problem:CodeForces-1654E]\n\n- 附加模拟赛。\n- 出题:不知道\n- 题目:3 道\n- 时长:3 小时\n\n### Day24 - 2023.08.09\n\n- 欢乐 ACM 赛(ABCD)。\n- [比赛链接](/contest/573830)\n- 整理:hwy\n- 题目:12 道\n- 时长:5 小时\n\n[problem:Gym-104053E]\n[problem:Gym-104053H]\n[problem:Gym-104053L]\n[problem:CodeForces-1394C]\n[problem:Gym-103640K]\n[problem:Gym-103048K]\n[problem:Gym-103640F]\n[problem:CodeForces-1303G]\n[problem:Gym-102978F]\n[problem:CodeForces-1333E]\n[problem:Gym-102978I]\n[problem:Gym-104460L]\n\n## Section5 - 图论 - Day25~30\n\n### Day25 - 2023.08.10\n\n- 专题:基础图论(拓扑排序、最短路、最小⽣成树、强连通、双连通、Tarjan 算法)\n- 讲师:dcx\n- 题目:28 道\n\n[problem:洛谷-P4151]\n[problem:UniversalOJ-513]\n[problem:CodeForces-528C]\n[problem:黑暗爆炸-3569]\n[problem:洛谷-P1347]\n[problem:黑暗爆炸-4562]\n[problem:黑暗爆炸-2109]\n[problem:黑暗爆炸-4010]\n[problem:洛谷-P7831]\n[problem:洛谷-P5284]\n[problem:洛谷-P4779]\n[problem:洛谷-P5471]\n[problem:UniversalOJ-512]\n[problem:黑暗爆炸-1641]\n[problem:洛谷-B3611]\n[problem:洛谷-P3366]\n[problem:CodeForces-888G]\n[problem:Baekjoon-17462]\n[problem:HDU-6722]\n[problem:黑暗爆炸-2180]\n[problem:LibreOJ-2469]\n[problem:洛谷-P3684]\n[problem:洛谷-P4768]\n[problem:洛谷-P8435]\n[problem:洛谷-P8436]\n[problem:洛谷-B3609]\n[problem:CodeForces-160D]\n[problem:洛谷-P7123]\n\n### Day26 - 2023.08.11\n\n- 专题:同余 BFS、差分约束、2-SAT、Tarjan LCA、欧拉回路、三四元环、最小树形图\n- 讲师:dcx\n- 题目:18 道\n\n[problem:UniversalOJ-117]\n[problem:CodeForces-547D]\n[problem:Baekjoon-20086]\n[problem:Baekjoon-13973]\n[problem:洛谷-P4782]\n[problem:洛谷-P3825]\n[problem:LibreOJ-6036]\n[problem:洛谷-P5297]\n[problem:黑暗爆炸-2612]\n[problem:洛谷-P5960]\n[problem:洛谷-P7515]\n[problem:洛谷-P1969]\n[problem:HDU-6184]\n[problem:LibreOJ-6076]\n[problem:HDU-5960]\n[problem:LibreOJ-6254]\n[problem:LibreOJ-3322]\n[problem:洛谷-P5163]\n\n### Day27 - 2023.08.12\n\n- 专题:二分图匹配(匈牙利算法、KM 算法)、网络流算法(EK、Dinic、费用流)\n- 讲师:dcx\n- 题目:23 题\n\n[problem:黑暗爆炸-1143]\n[problem:黑暗爆炸-2437]\n[problem:LibreOJ-6062]\n[problem:黑暗爆炸-4788]\n[problem:洛谷-P6577]\n[problem:洛谷-P3376]\n[problem:洛谷-P2766]\n[problem:洛谷-P3254]\n[problem:黑暗爆炸-1066]\n[problem:LibreOJ-6003]\n[problem:CodeForces-1404E]\n[problem:洛谷-P2762]\n[problem:黑暗爆炸-1391]\n[problem:黑暗爆炸-3144]\n[problem:黑暗爆炸-4663] 若显示 N/A 直接点即可\n[problem:TopCoder-14719]\n[problem:黑暗爆炸-3894]\n[problem:黑暗爆炸-3774]\n[problem:黑暗爆炸-2039]\n[problem:黑暗爆炸-3218]\n[problem:CodeForces-1517G]\n[problem:Gym-103861H]\n[problem:洛谷-P3381]\n\n### Day28 - 2023.08.13\n\n- 专题:线性规划与对偶、网络流建模、增流退流、上下界流 $^\\dag$\n- 讲师:dcx\n- 题目:20 道\n\n[problem:洛谷-P3357]\n[problem:洛谷-P7425]\n[problem:LibreOJ-6079]\n[problem:LibreOJ-6068]\n[problem:黑暗爆炸-1070]\n[problem:黑暗爆炸-2879]\n[problem:洛谷-P4249]\n[problem:洛谷-P4003]\n[problem:CodeForces-1288F]\n[problem:洛谷-P2304]\n[problem:洛谷-P3980]\n[problem:洛谷-P3308]\n[problem:CodeForces-671D]\n[problem:黑暗爆炸-2034]\n[problem:黑暗爆炸-5326] 缺题\n[problem:CodeForces-1209H]\n[problem:洛谷-P5653]\n[problem:黑暗爆炸-4977]\n[problem:洛谷-P4011]\n[problem:Gym-102201J]\n\n- 附加模拟赛。\n- 出题:不知道\n- 题目:5 道\n- 时长:3 小时\n\n### Day29 - 2023.08.14\n\n- 专题:杂题选讲\n- 讲师:叶子川\n- 题目:8 道\n\n[problem:CodeForces-1364D]\n[problem:CodeForces-1103C]\n[problem:LibreOJ-3176]\n[problem:QOJ-5254]\n[problem:CodeForces-1746F]\n[problem:CodeForces-1479D]\n[problem:洛谷-P8819]\n[problem:QOJ-5825]\n\n### Day30 - 2023.08.15\n\n- 模拟赛(CD 联考)。\n- 出题:花花\n- 题目:4 道\n- 时长:4 小时\n\n\n---\n\n**后注**\n\n$^\\dag$: 带有此标记的内容是选讲内容。 \n$^\\ddag$: 带有此标记的内容是附加内容(若标记单独出现,并非选讲)。如果被标记的内容在之后的课程中出现,会使用\u003cdel\u003e删除线\u003c/del\u003e划去。\n\n---\n\n\u003cdiv align\u003d\"center\"\u003e\n\u003ci\u003eCopyright 2023 - 2024 \u003ca href\u003d\"https://hellolin.cf/\"\u003ehellolin\u003c/a\u003e.\u003c/i\u003e\n\u003cbr/\u003e\n\u003c/div\u003e","threadId":151996,"likeCnt":29,"createTime":1689842569000,"isWorkbook":true,"viewCnt":7353,"openness":2,"fav":false,"id":3852,"trustable":false}