Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"洛谷-P1115\":[\"最大子段和\",111664,null],\"洛谷-P1357\":[\"花园\",2149,null],\"洛谷-P2567\":[\"幸运数字\",2244,\"SCOI2010\"],\"洛谷-P2324\":[\"骑士精神\",10729,\"SCOI2005\"],\"洛谷-P2447\":[\"外星千足虫\",2803,\"SDOI2010\"],\"洛谷-P2568\":[\"GCD\",8434,null],\"洛谷-P1119\":[\"灾后重建\",28004,null],\"洛谷-P5836\":[\"Milk Visits S\",8464,\"USACO19DEC\"],\"洛谷-P1912\":[\"诗人小G\",3759,\"NOI2009\"],\"洛谷-P6492\":[\"STEP\",3169,\"COCI2010-2011#6\"],\"洛谷-P4071\":[\"排列计数\",7756,\"SDOI2016\"],\"洛谷-P1481\":[\"魔族密码\",7654,null],\"UVA-11181\":[\"Probability|Given\",2407,null],\"洛谷-P1120\":[\"小木棍\",26973,null],\"洛谷-P2572\":[\"序列操作\",7311,\"SCOI2010\"],\"洛谷-P4630\":[\"铁人两项\",3071,\"APIO2018\"],\"洛谷-P1122\":[\"最大子树和\",21727,null],\"洛谷-P5960\":[\"差分约束\",18301,\"模板\"],\"洛谷-P2455\":[\"线性方程组\",7258,\"SDOI2006\"],\"洛谷-P4513\":[\"小白逛公园\",11129,null],\"洛谷-P1002\":[\"过河卒\",184474,\"NOIP2002 普及组\"],\"洛谷-P1004\":[\"方格取数\",71552,\"NOIP2000 提高组\"],\"洛谷-P2216\":[\"理想的正方形\",12560,\"HAOI2007\"],\"洛谷-P1801\":[\"黑匣子\",15572,null],\"洛谷-P1802\":[\"5 倍经验日\",35511,null],\"CodeForces-1000E\":[\"We Need More Bosses\",4250,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1000\\\"\\u003eEducational Codeforces Round 46 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1278F\":[\"Cards\",1887,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1278\\\"\\u003eEducational Codeforces Round 78 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2580\":[\"于是他错误的点名开始了\",32737,null],\"洛谷-P2341\":[\"受欢迎的牛 G\",28897,\"USACO03FALL / HAOI2006\"],\"洛谷-P2583\":[\"地铁间谍\",880,null],\"洛谷-P2340\":[\"Cow Exhibition G\",6949,\"USACO03FALL\"],\"CodeForces-280C\":[\"Game on Tree\",3963,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/280\\\"\\u003eCodeforces Round 172 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P1496\":[\"火烧赤壁\",16561,null],\"洛谷-P2585\":[\"三色二叉树\",6365,\"ZJOI2006\"],\"洛谷-P7112\":[\"行列式求值\",4256,\"模板\"],\"洛谷-P1253\":[\"扶苏的问题\",8807,null],\"洛谷-P1495\":[\"中国剩余定理(CRT)/ 曹冲养猪\",23726,\"模板\"],\"洛谷-P2345\":[\"MooFest G\",7684,\"USACO04OPEN\"],\"洛谷-P1379\":[\"八数码难题\",28875,null],\"洛谷-P1257\":[\"平面上的最接近点对\",15937,null],\"洛谷-P2346\":[\"四子连棋\",1881,null],\"洛谷-P7910\":[\"插入排序\",24264,\"CSP-J 2021\"],\"洛谷-P4408\":[\"逃学的小孩\",4775,\"NOI2003\"],\"洛谷-P1816\":[\"忠诚\",25235,null],\"洛谷-P1939\":[\"矩阵加速(数列)\",17153,null],\"CodeForces-1120D\":[\"Power Tree\",1348,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1120\\\"\\u003eCodeforces Round 543 (Div. 1, based on Technocup 2019 Final Round)\\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\"],\"洛谷-P4093\":[\"序列\",2200,\"HEOI2016/TJOI2016\"],\"洛谷-P4099\":[\"SAO\",1577,\"HEOI2013\"],\"洛谷-P1140\":[\"相似基因\",12508,null],\"洛谷-P2350\":[\"外星人\",835,\"HAOI2012\"],\"洛谷-P2473\":[\"奖励关\",4659,\"SCOI2008\"],\"洛谷-P3200\":[\"有趣的数列\",2891,\"HNOI2009\"],\"洛谷-P1020\":[\"导弹拦截\",76670,\"NOIP1999 提高组\"],\"洛谷-P1262\":[\"间谍网络\",11089,null],\"洛谷-P4653\":[\"Sure Bet\",1600,\"CEOI2017\"],\"洛谷-P1144\":[\"最短路计数\",40095,null],\"洛谷-P2111\":[\"考场奇遇\",928,null],\"洛谷-P3205\":[\"合唱队\",12442,\"HNOI2010\"],\"洛谷-P2910\":[\"Clear And Present Danger S\",13872,\"USACO08OPEN\"],\"洛谷-P5507\":[\"机关\",2030,null],\"洛谷-P5505\":[\"分特产\",1897,\"JSOI2011\"],\"CodeForces-1209E2\":[\"Rotate Columns (hard version)\",1979,\"\\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\"],\"洛谷-P1395\":[\"会议\",9450,null],\"洛谷-P1273\":[\"有线电视网\",15596,null],\"洛谷-P2483\":[\"k 短路 / [SDOI2010] 魔法猪学院\",3016,\"模板\"],\"洛谷-P4782\":[\"2-SAT\",13183,\"模板\"],\"洛谷-P3572\":[\"PTA-Little Bird\",4475,\"POI2014\"],\"洛谷-P1396\":[\"营救\",23385,null],\"洛谷-P3694\":[\"邦邦的大合唱站队\",4233,null],\"洛谷-P1036\":[\"选数\",159984,\"NOIP2002 普及组\"],\"洛谷-P2367\":[\"语文成绩\",33944,null],\"洛谷-P2004\":[\"领地选择\",20913,null],\"洛谷-P3216\":[\"数学作业\",2909,\"HNOI2011\"],\"洛谷-P1037\":[\"产生数\",19255,\"NOIP2002 普及组\"],\"洛谷-P1950\":[\"长方形\",3776,null],\"洛谷-P3214\":[\"卡农\",3082,\"HNOI2011\"],\"洛谷-P1955\":[\"程序自动分析\",21644,\"NOI2015\"],\"洛谷-P1833\":[\"樱花\",19589,null],\"洛谷-P2922\":[\"Secret Message G\",6650,\"USACO08DEC\"],\"洛谷-P4549\":[\"裴蜀定理\",16667,\"模板\"],\"CodeForces-1332E\":[\"Height All the Same\",3709,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1332\\\"\\u003eCodeforces Round 630 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1714\":[\"切蛋糕\",13639,null],\"洛谷-P1719\":[\"最大加权矩形\",28551,null],\"CodeForces-912E\":[\"Prime Gift\",1605,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/912\\\"\\u003eCodeforces Round 456 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1040\":[\"加分二叉树\",32164,\"NOIP2003 提高组\"],\"洛谷-P1164\":[\"小A点菜\",76804,null],\"洛谷-P5522\":[\"棠梨煎雪\",1025,\"yLOI2019\"],\"洛谷-P3223\":[\"排队\",2773,\"HNOI2012\"],\"洛谷-P3586\":[\"LOG\",2935,\"POI2015\"],\"洛谷-P1045\":[\"麦森数\",31400,\"NOIP2003 普及组\"],\"洛谷-P1287\":[\"盒子与球\",7876,null],\"洛谷-P4551\":[\"最长异或路径\",12186,null],\"洛谷-P5520\":[\"青原樱\",5770,\"yLOI2019\"],\"洛谷-P1044\":[\"栈\",73136,\"NOIP2003 普及组\"],\"洛谷-P2254\":[\"瑰丽华尔兹\",4020,\"NOI2005\"],\"洛谷-P4310\":[\"绝世好题\",8257,null],\"洛谷-P4552\":[\"IncDec Sequence\",11708,\"Poetize6\"],\"洛谷-P1168\":[\"中位数\",32157,null],\"洛谷-P2015\":[\"二叉苹果树\",23727,null],\"洛谷-P4799\":[\"世界冰球锦标赛\",7359,\"CEOI2015 Day2\"],\"洛谷-P2014\":[\"选课\",33985,\"CTSC1997\"],\"洛谷-P3469\":[\"BLO-Blockade\",8611,\"POI2008\"],\"洛谷-P4316\":[\"绿豆蛙的归宿\",9518,null],\"洛谷-P1049\":[\"装箱问题\",105520,\"NOIP2001 普及组\"],\"洛谷-P1962\":[\"斐波那契数列\",22136,null],\"洛谷-P1048\":[\"采药\",189976,\"NOIP2005 普及组\"],\"洛谷-P2016\":[\"战略游戏\",16273,null],\"洛谷-P3467\":[\"PLA-Postering\",4276,\"POI2008\"],\"洛谷-P1600\":[\"天天爱跑步\",10945,\"NOIP2016 提高组\"],\"洛谷-P1966\":[\"火柴排队\",21818,\"NOIP2013 提高组\"],\"洛谷-P3228\":[\"数列\",776,\"HNOI2013\"],\"洛谷-P1967\":[\"货车运输\",29583,\"NOIP2013 提高组\"],\"洛谷-P1725\":[\"琪露诺\",14014,null],\"洛谷-P2261\":[\"余数求和\",15065,\"CQOI2007\"],\"洛谷-P1177\":[\"排序\",243547,\"模板\"],\"洛谷-P1297\":[\"单选错位\",6189,\"国家集训队\"],\"洛谷-P1850\":[\"换教室\",14281,\"NOIP2016 提高组\"],\"洛谷-P4568\":[\"飞行路线\",16634,\"JLOI2011\"],\"洛谷-P5536\":[\"核心城市\",4529,\"XR-3\"],\"洛谷-P1973\":[\"NOI 嘉年华\",1794,\"NOI2011\"],\"洛谷-P1854\":[\"花店橱窗布置\",10523,null],\"洛谷-P2822\":[\"组合数问题\",27739,\"NOIP2016 提高组\"],\"洛谷-P2700\":[\"逐个击破\",3551,null],\"洛谷-P1613\":[\"跑路\",14410,null],\"洛谷-P1616\":[\"疯狂的采药\",87399,null],\"CodeForces-1245D\":[\"Shichikuji and Power Grid\",7432,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1245\\\"\\u003eCodeforces Round 597 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2704\":[\"炮兵阵地\",20673,\"NOI2001\"],\"洛谷-P2827\":[\"蚯蚓\",15648,\"NOIP2016 提高组\"],\"洛谷-P2392\":[\"kkksc03考前临时抱佛脚\",42622,null],\"洛谷-P1063\":[\"能量项链\",45803,\"NOIP2006 提高组\"],\"洛谷-P2152\":[\"SuperGCD\",8629,\"SDOI2009\"],\"洛谷-P2151\":[\"HH去散步\",2370,\"SDOI2009\"],\"洛谷-P3366\":[\"最小生成树\",126586,\"模板\"],\"洛谷-P1064\":[\"金明的预算方案\",45100,\"NOIP2006 提高组\"],\"洛谷-P2032\":[\"扫描\",17145,null],\"洛谷-P5664\":[\"Emiya 家今天的饭\",8645,\"CSP-S2019\"],\"洛谷-P7167\":[\"Fountain\",2957,\"eJOI2020 Day1\"],\"洛谷-P2155\":[\"沙拉公主的困惑\",3097,\"SDOI2008\"],\"洛谷-P3369\":[\"普通平衡树\",112215,\"模板\"],\"洛谷-P2158\":[\"仪仗队\",19340,\"SDOI2008\"],\"CodeForces-11D\":[\"A Simple Task\",5079,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/11\\\"\\u003eCodeforces Beta Round 11\\u003c/a\\u003e\"],\"洛谷-P3128\":[\"Max Flow P\",15269,\"USACO15DEC\"],\"洛谷-P2278\":[\"操作系统\",4727,\"HNOI2003\"],\"洛谷-P2831\":[\"愤怒的小鸟\",14248,\"NOIP2016 提高组\"],\"洛谷-P3368\":[\"树状数组 2\",60861,\"模板\"],\"洛谷-P5666\":[\"树的重心\",3419,\"CSP-S2019\"],\"洛谷-P3800\":[\"Power收集\",2305,null],\"洛谷-P1629\":[\"邮递员送信\",25527,null],\"洛谷-P2839\":[\"middle\",3371,\"国家集训队\"],\"CodeForces-607B\":[\"Zuma\",12355,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/607\\\"\\u003eCodeforces Round 336 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P2719\":[\"搞笑世界杯\",3980,null],\"洛谷-P1070\":[\"道路游戏\",8140,\"NOIP2009 普及组\"],\"洛谷-P3372\":[\"线段树 1\",157579,\"模板\"],\"洛谷-P2161\":[\"会场预约\",4512,\"SHOI2009\"],\"洛谷-P3373\":[\"线段树 2\",65997,\"模板\"],\"洛谷-P1195\":[\"口袋的天空\",24610,null],\"洛谷-P1074\":[\"靶形数独\",18574,\"NOIP2009 提高组\"],\"洛谷-P3371\":[\"单源最短路径(弱化版)\",123368,\"模板\"],\"洛谷-P1073\":[\"最优贸易\",22316,\"NOIP2009 提高组\"],\"洛谷-P1194\":[\"买礼物\",17364,null],\"洛谷-P2285\":[\"打鼹鼠\",7354,\"HNOI2004\"],\"洛谷-P4587\":[\"神秘数\",2608,\"FJOI2016\"],\"洛谷-P3374\":[\"树状数组 1\",95497,\"模板\"],\"洛谷-P1078\":[\"文化之旅\",11583,\"NOIP2012 普及组\"],\"洛谷-P2167\":[\"Bill的挑战\",1963,\"SDOI2009\"],\"洛谷-P4342\":[\"Polygon\",5761,\"IOI1998\"],\"洛谷-P1077\":[\"摆花\",54503,\"NOIP2012 普及组\"],\"洛谷-P1993\":[\"小 K 的农场\",15874,null],\"洛谷-P3017\":[\"Brownie Slicing G\",1841,\"USACO11MAR\"],\"洛谷-P6648\":[\"Triangle: The Data Structure\",547,\"CCC2019\"],\"洛谷-P2047\":[\"社交网络\",4428,\"NOI2007\"],\"洛谷-P2168\":[\"荷马史诗\",8288,\"NOI2015\"],\"洛谷-P2960\":[\"Invasion of the Milkweed G\",1801,\"USACO09OCT\"],\"洛谷-P3810\":[\"三维偏序(陌上花开)\",17770,\"模板\"],\"洛谷-P1874\":[\"快速求和\",3405,null],\"洛谷-P3378\":[\"堆\",59502,\"模板\"],\"洛谷-P1631\":[\"序列合并\",20482,null],\"洛谷-P5677\":[\"配对统计\",2071,\"GZOI2017\"],\"洛谷-P3379\":[\"最近公共祖先(LCA)\",124438,\"模板\"],\"UVA-11572\":[\"Unique Snowflakes\",8921,null],\"洛谷-P1875\":[\"佳佳的魔法药水\",2697,null],\"洛谷-P3811\":[\"模意义下的乘法逆元\",36384,\"模板\"],\"洛谷-P7737\":[\"庆典\",896,\"NOI2021\"],\"洛谷-P1638\":[\"逛画展\",23184,null],\"洛谷-P1516\":[\"青蛙的约会\",20176,null],\"洛谷-P1637\":[\"三元上升子序列\",9329,null],\"洛谷-P1879\":[\"Corn Fields G\",21399,\"USACO06NOV\"],\"洛谷-P3380\":[\"树套树\",10775,\"模板\"],\"洛谷-P1083\":[\"借教室\",37742,\"NOIP2012 提高组\"],\"洛谷-P6772\":[\"美食家\",2134,\"NOI2020\"],\"CodeForces-960F\":[\"Pathwalks\",2850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/960\\\"\\u003eDivide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"洛谷-P1082\":[\"同余方程\",47670,\"NOIP2012 提高组\"],\"洛谷-P2052\":[\"道路修建\",7724,\"NOI2011\"],\"洛谷-P4592\":[\"异或\",1979,\"TJOI2018\"],\"洛谷-P3387\":[\"缩点\",37236,\"模板\"],\"洛谷-P3146\":[\"248 G\",17960,\"USACO16OPEN\"],\"洛谷-P3388\":[\"割点(割顶)\",42092,\"模板\"],\"洛谷-P3143\":[\"Diamond Collector S\",6410,\"USACO16OPEN\"],\"洛谷-P3385\":[\"负环\",38644,\"模板\"],\"洛谷-P1880\":[\"石子合并\",61220,\"NOI1995\"],\"洛谷-P4910\":[\"帕秋莉的手环\",1196,null],\"洛谷-P3029\":[\"Cow Lineup S\",3312,\"USACO11NOV\"],\"洛谷-P3147\":[\"262144 P\",7140,\"USACO16OPEN\"],\"洛谷-P1763\":[\"埃及分数\",4060,null],\"洛谷-P1884\":[\"Overplanting S\",3677,\"USACO12FEB\"],\"洛谷-P2973\":[\"Driving Out the Piggies G\",1187,\"USACO10HOL\"],\"洛谷-P2613\":[\"有理数取余\",12955,\"模板\"],\"洛谷-P1886\":[\"滑动窗口 /【模板】单调队列\",67967,null],\"洛谷-P3825\":[\"游戏\",3495,\"NOI2017\"],\"洛谷-P2617\":[\"Dynamic Rankings\",11570,null],\"洛谷-P1090\":[\"合并果子 / [USACO06NOV] Fence Repair G\",127266,\"NOIP2004 提高组\"],\"CodeForces-632D\":[\"Longest Subsequence\",3661,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/632\\\"\\u003eEducational Codeforces Round 9\\u003c/a\\u003e\"],\"洛谷-P1091\":[\"合唱队形\",66776,\"NOIP2004 提高组\"],\"洛谷-P7072\":[\"直播获奖\",43254,\"CSP-J2020\"],\"洛谷-P4484\":[\"最长上升子序列\",1626,\"BJWC2018\"],\"洛谷-P3398\":[\"仓鼠找 sugar\",9734,null],\"洛谷-P7077\":[\"函数调用\",5189,\"CSP-S2020\"],\"洛谷-P3157\":[\"动态逆序对\",8495,\"CQOI2011\"],\"洛谷-P5455\":[\"弗雷兹的玩具商店\",104,\"THUPC2018\"],\"洛谷-P2860\":[\"Redundant Paths G\",5981,\"USACO06JAN\"],\"洛谷-P3275\":[\"糖果\",10655,\"SCOI2011\"],\"洛谷-P1099\":[\"树网的核\",10850,\"NOIP2007 提高组\"],\"洛谷-P3397\":[\"地毯\",49225,null],\"洛谷-P3953\":[\"逛公园\",10558,\"NOIP2017 提高组\"],\"洛谷-P1896\":[\"互不侵犯\",28403,\"SCOI2005\"],\"洛谷-P1654\":[\"OSU!\",7127,null],\"洛谷-P1775\":[\"石子合并(弱化版)\",21669,null],\"洛谷-P2622\":[\"关灯问题II\",6412,null],\"洛谷-P2863\":[\"The Cow Prom S\",15767,\"USACO06JAN\"],\"洛谷-P1656\":[\"炸铁路\",11717,null],\"洛谷-P2866\":[\"Bad Hair Day S\",11331,\"USACO06NOV\"],\"洛谷-P2865\":[\"Roadblocks G\",8524,\"USACO06NOV\"],\"洛谷-P2986\":[\"Great Cow Gathering G\",8764,\"USACO10MAR\"],\"洛谷-P7516\":[\"图函数\",1636,\"省选联考 2021 A/B 卷\"],\"洛谷-P3834\":[\"可持久化线段树 2\",39812,\"模板\"],\"洛谷-B3612\":[\"求区间和\",12864,\"深进1.例1\"],\"洛谷-B3611\":[\"传递闭包\",6825,\"模板\"],\"洛谷-P3959\":[\"宝藏\",14219,\"NOIP2017 提高组\"],\"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\"],\"洛谷-P2196\":[\"挖地雷\",32504,\"NOIP1996 提高组\"],\"洛谷-P5588\":[\"小猪佩奇爬树\",1120,null],\"洛谷-P3168\":[\"任务查询系统\",4478,\"CQOI2015\"],\"AtCoder-agc023_e\":[\"Inversions\",63,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc023\\\"\\u003eAtCoder Grand Contest 023\\u003c/a\\u003e\"],\"洛谷-P4375\":[\"Out of Sorts G\",1470,\"USACO18OPEN\"],\"洛谷-P3842\":[\"线段\",9035,\"TJOI2007\"],\"洛谷-P4139\":[\"上帝与集合的正确用法\",7015,null],\"洛谷-P1541\":[\"乌龟棋\",34236,\"NOIP2010 提高组\"],\"洛谷-P4017\":[\"最大食物链计数\",34847,null],\"洛谷-P5468\":[\"回家路线\",2326,\"NOI2019\"],\"洛谷-P2513\":[\"逆序对数列\",6004,\"HAOI2009\"],\"洛谷-P2758\":[\"编辑距离\",27975,null],\"洛谷-P4933\":[\"大师\",9367,null],\"洛谷-P2515\":[\"软件安装\",5369,\"HAOI2010\"],\"洛谷-P5908\":[\"猫猫和企鹅\",5966,null],\"洛谷-P4819\":[\"杀人游戏\",2666,\"中山市选\"],\"CodeForces-708E\":[\"Student\\u0027s Camp\",1041,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/708\\\"\\u003eAIM Tech Round 3 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3293\":[\"美味\",3049,\"SCOI2016\"],\"洛谷-P2085\":[\"最小函数值\",16786,null],\"洛谷-P2880\":[\"Balanced Lineup G\",23336,\"USACO07JAN\"],\"洛谷-P4147\":[\"玉蟾宫\",9589,null],\"洛谷-P2761\":[\"软件补丁问题\",2838,null],\"洛谷-P2882\":[\"Face The Right Way G\",3227,\"USACO07MAR\"],\"洛谷-P1550\":[\"Watering Hole G\",8899,\"USACO08OCT\"],\"洛谷-P4145\":[\"上帝造题的七分钟 2 / 花神游历各国\",16184,null],\"洛谷-P4942\":[\"小凯的数字\",9358,null],\"洛谷-P2520\":[\"向量\",1279,\"HAOI2011\"],\"洛谷-P1434\":[\"滑雪\",66305,\"SHOI2002\"],\"洛谷-P1313\":[\"计算系数\",21466,\"NOIP2011 提高组\"],\"洛谷-P4027\":[\"货币兑换\",2768,\"NOI2007\"],\"洛谷-P1312\":[\"Mayan 游戏\",8762,\"NOIP2011 提高组\"],\"洛谷-P1433\":[\"吃奶酪\",31344,null],\"洛谷-P1435\":[\"回文字串\",13129,\"IOI2000\"],\"洛谷-P1314\":[\"聪明的质监员\",24228,\"NOIP2011 提高组\"],\"洛谷-P1438\":[\"无聊的数列\",11197,null],\"洛谷-P1558\":[\"色板游戏\",6154,null],\"Gym-101002H\":[\"Jewel Thief\",118,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101002\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2016 North American Invitational Programming Contest\\u003c/a\\u003e\"],\"洛谷-P1439\":[\"最长公共子序列\",41235,\"模板\"],\"CodeForces-487E\":[\"Tourists\",2333,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/487\\\"\\u003eCodeforces Round 278 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3861\":[\"拆分\",587,null],\"洛谷-P1441\":[\"砝码称重\",11771,null],\"洛谷-P4155\":[\"国旗计划\",3883,\"SCOI2015\"],\"洛谷-P4035\":[\"球形空间产生器\",7126,\"JSOI2008\"],\"洛谷-P2532\":[\"树屋阶梯\",3484,\"AHOI2012\"],\"洛谷-P3623\":[\"免费道路\",2039,\"APIO2008\"],\"洛谷-P5369\":[\"最大前缀和\",1339,\"PKUSC2018\"],\"洛谷-P2415\":[\"集合求和\",43551,null],\"AtCoder-arc081_d\":[\"Flip and Rectangles\",127,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc081\\\"\\u003eAtCoder Regular Contest 081\\u003c/a\\u003e\"],\"洛谷-P2656\":[\"采蘑菇\",3513,null],\"洛谷-P2419\":[\"Cow Contest S\",10186,\"USACO08JAN\"],\"洛谷-P3509\":[\"ZAB-Frog\",1778,\"POI2010\"],\"AtCoder-arc066_d\":[\"Contest with Drinks Hard\",25,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc066\\\"\\u003eAtCoder Regular Contest 066\\u003c/a\\u003e\"],\"CodeForces-757B\":[\"Bash\\u0027s Big Day\",11099,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/757\\\"\\u003eCodecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"洛谷-P6464\":[\"传送门\",3291,\"传智杯 #2 决赛\"],\"洛谷-P3197\":[\"越狱\",17538,\"HNOI2008\"],\"洛谷-P6583\":[\"回首过去\",842,null],\"洛谷-P3195\":[\"玩具装箱\",13077,\"HNOI2008\"],\"洛谷-P1450\":[\"硬币购物\",8089,\"HAOI2008\"],\"洛谷-P4045\":[\"密码\",657,\"JSOI2009\"],\"洛谷-P3870\":[\"开关\",13989,\"TJOI2009\"],\"洛谷-P2421\":[\"荒岛野人\",3382,\"NOI2002\"],\"洛谷-P4602\":[\"混合果汁\",2431,\"CTSC2018\"],\"洛谷-P2303\":[\"Longge 的问题\",6233,\"SDOI2012\"],\"洛谷-P1216\":[\"[IOI1994]数字三角形 Number Triangles\",115003,\"USACO1.5\"],\"洛谷-P3879\":[\"阅读理解\",15454,\"TJOI2010\"],\"洛谷-P5937\":[\"Parity Game\",3292,\"CEOI1999\"],\"洛谷-P1578\":[\"奶牛浴场\",1821,null],\"洛谷-P3517\":[\"WYK-Plot\",183,\"POI2011\"],\"洛谷-P4606\":[\"战略游戏\",2327,\"SDOI2018\"],\"洛谷-P4290\":[\"玩具取名\",3696,\"HAOI2008\"],\"洛谷-P4170\":[\"涂色\",18575,\"CQOI2007\"],\"CodeForces-582A\":[\"GCD Table\",7961,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/582\\\"\\u003eCodeforces Round 323 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P4053\":[\"建筑抢修\",7822,\"JSOI2007\"],\"洛谷-P2671\":[\"求和\",19565,\"NOIP2015 普及组\"],\"洛谷-P7562\":[\"イベント巡り 2 (Event Hopping 2)\",368,\"JOISC 2021 Day4\"],\"洛谷-P5025\":[\"炸弹\",2686,\"SNOI2017\"],\"洛谷-P1220\":[\"关路灯\",20540,null],\"洛谷-P1462\":[\"通往奥格瑞玛的道路\",19454,null],\"洛谷-P1102\":[\"A-B 数对\",91446,null],\"洛谷-P3403\":[\"跳楼机\",4902,null],\"洛谷-P2679\":[\"子串\",15586,\"NOIP2015 提高组\"],\"洛谷-P3406\":[\"海底高铁\",15823,null],\"洛谷-P3648\":[\"序列分割\",4068,\"APIO2014\"],\"洛谷-P1226\":[\"快速幂\",107134,\"模板\"],\"洛谷-P4735\":[\"最大异或和\",8125,null],\"洛谷-P1228\":[\"地毯填补问题\",13861,null],\"洛谷-P1349\":[\"广义斐波那契数列\",7505,null],\"CodeForces-19D\":[\"Points\",2534,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/19\\\"\\u003eCodeforces Beta Round 19\\u003c/a\\u003e\"],\"洛谷-P1904\":[\"天际线\",3595,null],\"洛谷-P1908\":[\"逆序对\",101434,null],\"CodeForces-525E\":[\"Anya and Cubes\",3078,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/525\\\"\\u003eCodeforces Round 297 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P4180\":[\"严格次小生成树\",12382,\"BJWC2010\"],\"CodeForces-961G\":[\"Partitions\",1381,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/961\\\"\\u003eEducational Codeforces Round 41 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2680\":[\"运输计划\",16377,\"NOIP2015 提高组\"],\"洛谷-P1351\":[\"联合权值\",18661,\"NOIP2014 提高组\"],\"CodeForces-472D\":[\"Design Tutorial: Inverse the Problem\",5466,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/472\\\"\\u003eCodeforces Round 270\\u003c/a\\u003e\"],\"洛谷-P1471\":[\"方差\",8830,null],\"洛谷-P1352\":[\"没有上司的舞会\",49829,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"wloving","updateTime":1677153500000,"title":"《深入浅出程序设计竞赛 进阶篇》题单","dislikeCnt":0,"content":"## 第一章 常见优化技巧\n\n### 1.1 双指针法\n\n[problem:洛谷-P1102]\n[problem:洛谷-P1638]\n[problem:洛谷-P1115]\n\n### 1.2 空间换时间\n[problem:洛谷-P7072]\n[problem:洛谷-P2671]\n[problem:洛谷-P4147]\n\n### 1.3 单调栈\n[problem:洛谷-P2866]\n[problem:洛谷-P1950]\n\n\n### 1.4 单调队列\n[problem:洛谷-P2032]\n[problem:洛谷-P2216]\n\n### 1.5 额外加练\n[problem:UVA-11572]\n[problem:洛谷-P4653]\n[problem:洛谷-P3143]\n[problem:洛谷-P7910]\n[problem:洛谷-P1578]\n[problem:洛谷-P3467]\n[problem:洛谷-P1886]\n[problem:洛谷-P2880]\n[problem:洛谷-P1714]\n[problem:洛谷-P1725]\n\n## 第二章 前缀和、差分与离散化\n\n### 2.1 前缀和与二维前缀和\n\n[problem:洛谷-B3612]\n[problem:洛谷-P1719]\n[problem:洛谷-P1314]\n\n### 2.2 差分\n [problem:洛谷-P2367]\n[problem:洛谷-P3397]\n\n### 2.3 离散化\n\n [problem:洛谷-P1496]\n [problem:洛谷-P1955]\n [problem:洛谷-P1884]\n\n### 2.4 额外加练\n\n[problem:洛谷-P2004]\n[problem:洛谷-P3017]\n [problem:洛谷-P3406]\n[problem:洛谷-P1083]\n [problem:洛谷-P2882]\n[problem:洛谷-P4552]\n[problem:洛谷-P3029]\n [problem:洛谷-P1904]\n [problem:洛谷-P4375]\n [problem:洛谷-P5937]\n## 第三章 分治与倍增\n\n### 3.1 归并排序与快速幂\n\n[problem:洛谷-P1177]\n[problem:洛谷-P1908]\n[problem:洛谷-P1966]\n[problem:洛谷-P1226]\n[problem:洛谷-P1045]\n### 3.2 其它序列上的分治\n[problem:洛谷-P1115]\n\n### 3.3 倍增与ST表\n[problem:洛谷-P2880]\n[problem:洛谷-P7167]\n\n### 3.4 额外练习\n[problem:洛谷-P2415]\n[problem:洛谷-P1257]\n[problem:洛谷-P1228]\n[problem:洛谷-P2345]\n[problem:洛谷-P3509]\n[problem:洛谷-P3517]\n[problem:洛谷-P4155]\n[problem:洛谷-P1816]\n[problem:洛谷-P6648]\n[problem:洛谷-P7562]\n\n## 第四章 进阶搜索\n\n### 4.1 状态剪枝\n[problem:洛谷-P1036]\n[problem:洛谷-P1433]\n[problem:洛谷-P1120]\n\n### 4.2 迭代加深与双向搜索\n[problem:洛谷-P1763]\n[problem:CodeForces-525E]\n[problem:洛谷-P1379]\n\n### 4.3 启发式搜索\n[problem:洛谷-P5507]\n[problem:洛谷-P2324]\n\n### 4.4 额外加练\n[problem:洛谷-P1074]\n[problem:洛谷-P1312]\n[problem:洛谷-P3959]\n[problem:洛谷-P2960]\n[problem:CodeForces-912E]\n[problem:洛谷-P2346]\n[problem:洛谷-P4799]\n[problem:洛谷-P2483]\n[problem:洛谷-P1078]\n## 第五章 二叉堆\n\n### 5.1 二叉堆的实现\n[problem:洛谷-P3378]\n[problem:洛谷-P1177]\n\n### 5.2 优先队列\n[problem:洛谷-P1090]\n[problem:洛谷-P2168]\n[problem:洛谷-P2827]\n\n\n### 5.3 额外练习\n[problem:洛谷-P1801]\n[problem:洛谷-P1168]\n[problem:洛谷-P1631]\n[problem:洛谷-P4053]\n[problem:洛谷-P2085]\n[problem:洛谷-P2278]\n\n## 第六章 线段树\n\n### 6.1 线段树的建立与操作\n[problem:洛谷-P3372]\n\n### 6.2 线段树的应用\n[problem:洛谷-P3870]\n[problem:洛谷-P1438]\n[problem:洛谷-P1253]\n[problem:洛谷-P3373]\n[problem:洛谷-P4513]\n\n### 6.3 权值线段树\n[problem:洛谷-P1908]\n\n### 6.4 额外加练\n[problem:洛谷-P1816]\n[problem:洛谷-P1471]\n[problem:洛谷-P6492]\n[problem:洛谷-P1637]\n[problem:洛谷-P1558]\n[problem:洛谷-P5522]\n[problem:洛谷-P4145]\n[problem:洛谷-P2572]\n[problem:CodeForces-19D]\n\n## 第七章 树状数组与字典树\n\n### 7.1 树状数组\n[problem:洛谷-P3374]\n[problem:洛谷-P3368]\n[problem:洛谷-P1908]\n### 7.2 字典树\n[problem:洛谷-P1481]\n[problem:洛谷-P2580]\n[problem:洛谷-P4551]\n[problem:洛谷-P2583]\n\n### 7.3 额外加练\n[problem:洛谷-P1966]\n[problem:洛谷-P5677]\n[problem:洛谷-P2161]\n[problem:洛谷-P3586]\n[problem:洛谷-P2922]\n[problem:洛谷-P3879]\n[problem:洛谷-P4735]\n[problem:洛谷-P4592]\n[problem:洛谷-P3369]\n\n## 第八章 线段树的进阶用法\n\n### 8.1 可持久化线段树\n[problem:洛谷-P3834]\n[problem:洛谷-P4587]\n\n### 8.2 树状数组套权值线段树\n[problem:洛谷-P3380]\n[problem:洛谷-P3810]\n\n### 8.3 额外加练\n[problem:洛谷-P4093]\n[problem:洛谷-P3157]\n[problem:洛谷-P3293]\n[problem:CodeForces-960F]\n[problem:洛谷-P2617]\n[problem:洛谷-P3168]\n[problem:洛谷-P2839]\n[problem:洛谷-P4602]\n[problem:洛谷-P5455]\n\n## 第九章 树\n\n### 9.1 树的性质与遍历\n[problem:洛谷-P5908]\n\n### 9.2 树的直径与重心\n[problem:洛谷-P1099]\n[problem:洛谷-P1395]\n\n### 9.3 最近公共祖先\n[problem:洛谷-P3379]\n[problem:洛谷-P3128]\n\n### 9.4 额外加练\n[problem:洛谷-P2052]\n[problem:洛谷-P5666]\n[problem:洛谷-P5588]\n[problem:洛谷-P5536]\n[problem:洛谷-P5836]\n[problem:洛谷-P1351]\n[problem:洛谷-P4408]\n[problem:洛谷-P3398]\n[problem:洛谷-P2680]\n[problem:洛谷-P1600]\n\n## 第十章 最短路\n\n### 10.1 单源最短路径\n[problem:洛谷-P3371]\n[problem:洛谷-P4568]\n[problem:洛谷-P1629]\n### 10.2 负环与差分约束\n[problem:洛谷-P3385]\n[problem:洛谷-P5960]\n### 10.3 次短路\n[problem:洛谷-P2865]\n\n### 10.4 多源最短路径与传递背包\n[problem:洛谷-P2910]\n[problem:洛谷-B3611]\n### 10.5 额外加练\n[problem:洛谷-P1144]\n[problem:洛谷-P1875]\n[problem:洛谷-P1462]\n[problem:洛谷-P1073]\n[problem:洛谷-P1993]\n[problem:洛谷-P3275]\n[problem:洛谷-P6464]\n[problem:洛谷-P3403]\n[problem:洛谷-P1119]\n[problem:洛谷-P1037]\n[problem:洛谷-P2419]\n[problem:洛谷-P2047]\n## 第十一章 最小生成树\n\n### 11.1 最小生成树及其应用\n[problem:洛谷-P3366]\n[problem:洛谷-P1194]\n[problem:CodeForces-472D]\n### 11.2 次小生成树\n[problem:洛谷-P4180]\n### 11.3 额外加练\n[problem:洛谷-P1396]\n[problem:洛谷-P1195]\n[problem:洛谷-P1550]\n[problem:洛谷-P1967]\n[problem:洛谷-P2700]\n[problem:CodeForces-1245D]\n[problem:洛谷-P3623]\n[problem:CodeForces-1120D]\n\n## 第十二章 连通性问题\n\n### 12.1 无向图的边双连通性\n[problem:洛谷-P1656]\n[problem:洛谷-P2860]\n\n### 12.2 无向图的点双连通性\n[problem:洛谷-P3388]\n[problem:洛谷-P4630]\n\n### 12.3 有向图的强连通性\n[problem:洛谷-P2863]\n[problem:洛谷-P3387]\n[problem:洛谷-P4782]\n\n### 12.4 额外加练\n[problem:CodeForces-1000E]\n[problem:洛谷-P3469]\n[problem:洛谷-P4606]\n[problem:CodeForces-487E]\n[problem:洛谷-P1262]\n[problem:洛谷-P2341]\n[problem:洛谷-P5025]\n[problem:洛谷-P3825]\n[problem:洛谷-P4819]\n[problem:洛谷-P7737]\n\n## 第十三章 动态规划的引入\n\n### 13.1 什么是动态规划\n[problem:洛谷-P1216]\n### 13.2 状态、转移与有向无环图\n[problem:洛谷-P1048]\n[problem:洛谷-P2196]\n\n### 13.3 拓扑序与记忆化搜索\n[problem:洛谷-P1434]\n[problem:洛谷-P4017]\n### 13.4 动态规划的解法\n[problem:洛谷-P1115]\n\n### 13.5 额外加练\n[problem:洛谷-P1802]\n[problem:洛谷-P1002]\n[problem:洛谷-P1049]\n[problem:洛谷-P1616]\n[problem:洛谷-P1164]\n[problem:洛谷-P1077]\n[problem:洛谷-P3842]\n[problem:洛谷-P1064]\n[problem:洛谷-P2392]\n\n## 第十四章 线性状态动态规划\n\n### 14.1 单序列问题\n[problem:洛谷-P1020]\n[problem:洛谷-P2285]\n[problem:洛谷-P1725]\n[problem:洛谷-P4933]\n[problem:洛谷-P1874]\n\n### 14.2 多序列问题\n[problem:洛谷-P2758]\n[problem:洛谷-P1439]\n[problem:洛谷-P2679]\n\n### 14.3 高维问题\n[problem:洛谷-P1004]\n\n### 14.4 额外加练\n[problem:洛谷-P1091]\n[problem:洛谷-P1435]\n[problem:洛谷-P1854]\n[problem:洛谷-P1833]\n[problem:洛谷-P2340]\n[problem:洛谷-P1541]\n[problem:洛谷-P4310]\n[problem:洛谷-P3147]\n\n## 第十五章 区间与环形动态规划\n\n### 15.1 区间动态规划\n[problem:洛谷-P1435]\n[problem:洛谷-P1775]\n[problem:CodeForces-607B]\n[problem:洛谷-P3205]\n\n### 15.2 环形动态规划\n[problem:洛谷-P1880]\n\n### 15.3 额外加练\n[problem:洛谷-P1140]\n[problem:洛谷-P4170]\n[problem:洛谷-P4290]\n[problem:洛谷-P3146]\n[problem:洛谷-P1063]\n[problem:洛谷-P1070]\n[problem:洛谷-P4342]\n[problem:洛谷-P1220]\n## 第十六章 树与图上的动态规划\n\n### 16.1 树上动态规划\n[problem:洛谷-P1352]\n[problem:洛谷-P2015]\n[problem:洛谷-P2014]\n\n### 16.2 图上动态规划\n[problem:洛谷-P1613]\n[problem:洛谷-P6772]\n[problem:洛谷-P4316]\n[problem:洛谷-P2656]\n\n### 16.3 额外加练\n[problem:洛谷-P1040]\n[problem:洛谷-P1122]\n[problem:洛谷-P2016]\n[problem:洛谷-P2585]\n[problem:洛谷-P1273]\n[problem:洛谷-P2515]\n[problem:洛谷-P2986]\n[problem:洛谷-P3953]\n[problem:洛谷-P7077]\n[problem:洛谷-P7516]\n\n## 第十七章 状态压缩动态规划\n\n### 17.1 状态压缩是什么\n[problem:洛谷-P1896]\n[problem:洛谷-P2622]\n\n### 17.2 状态压缩的一般技巧\n[problem:CodeForces-11D]\n[problem:洛谷-P3959]\n[problem:洛谷-P4484]\n\n### 17.3 状态压缩与其他算法的交叉应用\n[problem:洛谷-P1357]\n[problem:洛谷-P1450]\n\n### 17.4 额外加练\n[problem:洛谷-P3694]\n[problem:洛谷-P1441]\n[problem:洛谷-P1879]\n[problem:洛谷-P2704]\n[problem:洛谷-P2831]\n[problem:洛谷-P4045]\n[problem:AtCoder-agc023_e]\n[problem:CodeForces-1209E2]\n[problem:洛谷-P5369]\n[problem:洛谷-P2761]\n[problem:洛谷-P2473]\n[problem:洛谷-P2167]\n## 第十八章 动态规划的设计与优化\n\n### 18.1 如何优化转移\n[problem:CodeForces-708E]\n[problem:洛谷-P3800]\n[problem:CodeForces-833B]\n[problem:洛谷-P3648]\n[problem:洛谷-P4027]\n\n### 18.2 额外加练\n[problem:AtCoder-arc081_d]\n[problem:洛谷-P2513]\n[problem:洛谷-P4099]\n[problem:Gym-101002H]\n[problem:洛谷-P3572]\n[problem:洛谷-P2254]\n[problem:洛谷-P2350]\n[problem:洛谷-P1973]\n[problem:洛谷-P1912]\n[problem:洛谷-P3195]\n[problem:洛谷-P5468]\n[problem:AtCoder-arc066_d]\n\n## 第十九章 进阶数论\n\n### 19.1 模意义下的数和运算\n[problem:洛谷-P1516]\n\n### 19.2 乘法逆元\n[problem:洛谷-P4942]\n[problem:洛谷-P3811]\n\n### 19.3 同余方程与中国剩余定理\n[problem:洛谷-P1495]\n\n### 19.4 线性筛与积性函数\n[problem:洛谷-P3861]\n\n### 19.5 欧拉函数\n[problem:洛谷-P2568]\n[problem:洛谷-P2303]\n\n### 19.6 额外加练\n[problem:洛谷-P1082]\n[problem:洛谷-P4549]\n[problem:洛谷-P2421]\n[problem:洛谷-P2613]\n[problem:CodeForces-757B]\n[problem:CodeForces-776B]\n[problem:洛谷-P2155]\n[problem:洛谷-P2152]\n[problem:CodeForces-632D]\n[problem:CodeForces-582A]\n[problem:洛谷-P2261]\n[problem:洛谷-P2158]\n[problem:洛谷-P6583]\n[problem:洛谷-P4139]\n\n## 第二十章 组合数学与计数\n\n### 20.1 集合与容斥原理\n[problem:洛谷-P3197]\n[problem:洛谷-P5664]\n[problem:洛谷-P1287]\n[problem:洛谷-P1450]\n\n### 20.2 常见的组合计数方法\n[problem:洛谷-P5520]\n[problem:洛谷-P4071]\n\n### 20.3 二项式定理\n[problem:洛谷-P1313]\n[problem:CodeForces-1332E]\n\n### 20.4 卡特兰数与斯特林数\n[problem:洛谷-P1044]\n[problem:洛谷-P1287]\n### 20.5 额外加练\n[problem:洛谷-P2567]\n[problem:洛谷-P5505]\n[problem:洛谷-P3223]\n[problem:洛谷-P2822]\n[problem:洛谷-P3214]\n[problem:洛谷-P2532]\n[problem:洛谷-P3200]\n[problem:CodeForces-1278F]\n[problem:洛谷-P3228]\n[problem:CodeForces-961G]\n\n## 第二十一章 概率与统计\n\n### 21.1 概率模型\n[problem:洛谷-P2719]\n### 21.2 数学期望\n[problem:洛谷-P1654]\n[problem:CodeForces-280C]\n\n### 21.3 额外加练\n\n[problem:UVA-11181]\n[problem:洛谷-P4316]\n[problem:洛谷-P1297]\n[problem:洛谷-P2111]\n[problem:洛谷-P1850]\n\n## 第二十二章 基础线性代数\n\n### 22.1 向量与矩阵变换\n[problem:洛谷-P1962]\n\n### 22.2 高斯消元\n[problem:洛谷-P2455]\n\n### 22.3 额外加练\n[problem:洛谷-P2520]\n[problem:洛谷-P1349]\n[problem:洛谷-P1939]\n[problem:洛谷-P2447]\n[problem:洛谷-P7112]\n[problem:洛谷-P3216]\n[problem:洛谷-P4910]\n[problem:洛谷-P2151]\n[problem:洛谷-P4035]\n[problem:洛谷-P2973]\n","threadId":137710,"likeCnt":12,"createTime":1676958763000,"isWorkbook":true,"viewCnt":3837,"openness":2,"fav":false,"id":3470,"trustable":false}