Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"洛谷-P4943\":[\"密室\",1478,null],\"洛谷-P1873\":[\"EKO / 砍树\",76153,\"COCI 2011/2012 #5\"],\"洛谷-P2249\":[\"查找\",110778,\"深基13.例1\"],\"洛谷-P1314\":[\"聪明的质监员\",24228,\"NOIP2011 提高组\"],\"洛谷-P2568\":[\"GCD\",8434,null],\"洛谷-P1119\":[\"灾后重建\",28004,null],\"洛谷-P5318\":[\"查找文献\",30582,\"深基18.例3\"],\"AtCoder-abc311_d\":[\"Grid Ice Floor\",3485,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc311\\\"\\u003eToyota Programming Contest 2023#4(AtCoder Beginner Contest 311)\\u003c/a\\u003e\"],\"洛谷-P1439\":[\"最长公共子序列\",41235,\"模板\"],\"CodeForces-1300C\":[\"Anu Has a Function\",223,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1300\\\"\\u003eCodeforces Round 618 (Div. 2)\\u003c/a\\u003e\"],\"UVA-10004\":[\"Bicoloring\",26229,null],\"CodeForces-1093D\":[\"Beautiful Graph\",8784,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1093\\\"\\u003eEducational Codeforces Round 56 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-U208323\":[\"埃氏筛质数\",269,null],\"洛谷-P1083\":[\"借教室\",37742,\"NOIP2012 提高组\"],\"洛谷-P1160\":[\"队列安排\",42545,null],\"UVA-1343\":[\"The Rotation Game\",1350,null],\"洛谷-P1082\":[\"同余方程\",47670,\"NOIP2012 提高组\"],\"洛谷-P8875\":[\"G-二人的花纹纸游戏\",111,\"传智杯 #5 初赛\"],\"洛谷-P1360\":[\"Gold Balanced Lineup G\",1798,\"USACO07MAR\"],\"洛谷-P4751\":[\"\\\"动态DP\\\"\\u0026动态树分治(加强版)\",1796,\"模板\"],\"洛谷-P4554\":[\"小明的游戏\",3646,null],\"洛谷-P8795\":[\"选素数\",499,\"蓝桥杯 2022 国 A\"],\"洛谷-P1440\":[\"求m区间内的最小值\",26875,null],\"洛谷-P1880\":[\"石子合并\",61220,\"NOI1995\"],\"洛谷-P2573\":[\"滑雪\",2764,\"SCOI2012\"],\"洛谷-P5603\":[\"小 C 与桌游\",1055,null],\"CodeForces-1630A\":[\"And Matching\",14197,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1630\\\"\\u003eCodeforces Round 768 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P2853\":[\"Cow Picnic S\",13823,\"USACO06DEC\"],\"CodeForces-1537F\":[\"Figure Fixing\",2392,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1537\\\"\\u003eCodeforces Round 726 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1601\":[\"A+B Problem(高精)\",173998,null],\"洛谷-P1127\":[\"词链\",5691,null],\"洛谷-P1725\":[\"琪露诺\",14014,null],\"洛谷-P4718\":[\"Pollard-Rho\",11141,\"模板\"],\"洛谷-P1807\":[\"最长路\",24754,null],\"洛谷-P1608\":[\"路径统计\",7093,null],\"CodeForces-741C\":[\"Arpa’s overnight party and Mehrdad’s silent entering\",2516,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/741\\\"\\u003eCodeforces Round 383 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P1093\":[\"奖学金\",107888,\"NOIP2007 普及组\"],\"CodeForces-1829E\":[\"The Lakes\",18735,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1829\\\"\\u003eCodeforces Round 871 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1849C\":[\"Binary String Copying\",9911,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1849\\\"\\u003eEducational Codeforces Round 152 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P3398\":[\"仓鼠找 sugar\",9734,null],\"AtCoder-abc248_d\":[\"Range Count Query\",3799,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc248\\\"\\u003eUNIQUE VISION Programming Contest 2022(AtCoder Beginner Contest 248)\\u003c/a\\u003e\"],\"洛谷-P9772\":[\"网格染色\",550,\"HUSTFC 2023\"],\"CodeForces-1843D\":[\"Apple Tree\",17428,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1843\\\"\\u003eCodeforces Round 881 (Div. 3)\\u003c/a\\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\"],\"洛谷-P1332\":[\"血色先锋队\",18277,null],\"洛谷-P5019\":[\"铺设道路\",52596,\"NOIP2018 提高组\"],\"洛谷-P1137\":[\"旅行计划\",14621,null],\"洛谷-P5656\":[\"二元一次不定方程 (exgcd)\",7595,\"模板\"],\"洛谷-P1379\":[\"八数码难题\",28875,null],\"洛谷-P3912\":[\"素数个数\",25106,null],\"CodeForces-166D\":[\"Shoe Store\",376,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/166\\\"\\u003eCodeforces Round 113 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2901\":[\"Cow Jogging G\",1748,\"USACO08MAR\"],\"洛谷-P1219\":[\"八皇后 Checker Challenge\",118397,\"USACO1.5\"],\"CodeForces-356A\":[\"Knight Tournament\",13859,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/356\\\"\\u003eCodeforces Round 207 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P2629\":[\"好消息,坏消息\",6298,null],\"CodeForces-1443C\":[\"The Delivery Dilemma\",15636,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1443\\\"\\u003eCodeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final)\\u003c/a\\u003e\"],\"洛谷-B3695\":[\"集合运算 3\",578,null],\"CodeForces-1722G\":[\"Even-Odd XOR\",10579,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1722\\\"\\u003eCodeforces Round 817 (Div. 4)\\u003c/a\\u003e\"],\"洛谷-B3694\":[\"数列离散化\",2300,null],\"洛谷-P9583\":[\"涂色\",1333,\"MXOI Round 1\"],\"CodeForces-1848B\":[\"Vika and the Bridge\",13411,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1848\\\"\\u003eCodeforces Round 885 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1020\":[\"导弹拦截\",76670,\"NOIP1999 提高组\"],\"洛谷-P1265\":[\"公路修建\",11984,null],\"洛谷-P1220\":[\"关路灯\",20540,null],\"洛谷-P1024\":[\"一元三次方程求解\",82525,\"NOIP2001 提高组\"],\"洛谷-P3128\":[\"Max Flow P\",15269,\"USACO15DEC\"],\"CodeForces-460C\":[\"Present\",6822,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/460\\\"\\u003eCodeforces Round 262 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-T159080\":[\"分解质因数\",130,null],\"HDU-2503\":[\"a/b + c/d\",10783,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%A1%B6ACM%B3%CC%D0%F2%C9%E8%BC%C6%A1%B7%B6%CC%D1%A7%C6%DA%BF%BC%CA%D4_%C8%ED%BC%FE%B9%A4%B3%CC%BC%B0%C6%E4%CB%FB%D7%A8%D2%B5\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 《ACM程序设计》短学期考试_软件工程及其他专业 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P4017\":[\"最大食物链计数\",34847,null],\"洛谷-P2434\":[\"区间\",4877,\"SDOI2005\"],\"CodeForces-1118D2\":[\"Coffee and Coursework (Hard Version)\",6286,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1118\\\"\\u003eCodeforces Round 540 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1139E\":[\"Maximize Mex\",1807,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1139\\\"\\u003eCodeforces Round 548 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1304\":[\"哥德巴赫猜想\",79948,null],\"洛谷-B3605\":[\"二分图匹配\",1791,\"图论与代数结构 401\"],\"洛谷-P2758\":[\"编辑距离\",27975,null],\"CodeForces-1199C\":[\"MP3\",148,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1199\\\"\\u003eCodeforces Round 576 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P5905\":[\"全源最短路(Johnson)\",7419,\"模板\"],\"CodeForces-1850E\":[\"Cardboard for Pictures\",20980,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1850\\\"\\u003eCodeforces Round 886 (Div. 4)\\u003c/a\\u003e\"],\"洛谷-B3643\":[\"图的存储\",5019,null],\"CodeForces-1676F\":[\"Longest Strike\",16075,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1676\\\"\\u003eCodeforces Round 790 (Div. 4)\\u003c/a\\u003e\"],\"UVA-529\":[\"Addition Chains\",2109,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\"],\"洛谷-P2280\":[\"激光炸弹\",19160,\"HNOI2003\"],\"CodeForces-1815A\":[\"Ian and Array Sorting\",13439,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1815\\\"\\u003eCodeforces Round 865 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-T277380\":[\"牛牛的猜球游戏\",26,null],\"洛谷-P2281\":[\"多项式的加法和乘法\",51,\"HNOI2003\"],\"洛谷-P1195\":[\"口袋的天空\",24610,null],\"洛谷-P1194\":[\"买礼物\",17364,null],\"CodeForces-670C\":[\"Cinema\",10689,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/670\\\"\\u003eCodeforces Round 350 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1395\":[\"会议\",9450,null],\"洛谷-P3178\":[\"树上操作\",11845,\"HAOI2015\"],\"洛谷-P2285\":[\"打鼹鼠\",7354,\"HNOI2004\"],\"洛谷-P4144\":[\"大河的序列\",943,null],\"洛谷-P9236\":[\"异或和之和\",1772,\"蓝桥杯 2023 省 A\"],\"洛谷-P2441\":[\"角色属性树\",1884,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"cls1277","updateTime":1699459399000,"title":"CUGACM训练题单","dislikeCnt":0,"content":"**【01】前缀和与差分**\n\n[problem:洛谷-P9236] [problem:洛谷-P5019] [problem:洛谷-P2280] [problem:洛谷-P2281] [problem:洛谷-P8875] [problem:洛谷-P1314] [problem:洛谷-P1083] [problem:洛谷-P1360] [problem:洛谷-P2629] [problem:洛谷-T277380]\n\n**【01】素数:约数、筛选素数、素性测试、质因数分解、exGCD**\n\n[problem:HDU-2138] [problem:洛谷-P2441] [problem:洛谷-P8795] [problem:洛谷-P4718] [problem:洛谷-P5656] [problem:洛谷-P1082] [problem:洛谷-P2568] [problem:洛谷-P1304] [problem:HDU-2503] [problem:洛谷-T159080] [problem:洛谷-U208323] [problem:洛谷-P3912]\n\n**【02】排序、二分、高精度**\n\n[problem:CodeForces-1118D2] [problem:CodeForces-460C] [problem:CodeForces-1850E] [problem:CodeForces-1849C] [problem:CodeForces-1848B] [problem:CodeForces-1815A] [problem:CodeForces-1443C] [problem:AtCoder-abc248_d] [problem:洛谷-P2249] [problem:洛谷-P1873] [problem:洛谷-P1024] [problem:洛谷-P1093] [problem:洛谷-P1601] \n\n**【02】位运算、离散化、区间合并**\n\n[problem:CodeForces-1676F] [problem:洛谷-B3694] [problem:CodeForces-1199C] [problem:CodeForces-1300C] [problem:CodeForces-1630A] [problem:CodeForces-670C] [problem:CodeForces-356A] [problem:CodeForces-1722G] [problem:洛谷-B3695] [problem:洛谷-P4144] \n\n**【03】链表与邻接表(树与图的存储)、树与图的遍历**\n\n[problem:洛谷-P1160] [problem:洛谷-P3398] [problem:洛谷-P3178] [problem:洛谷-P3128] [problem:洛谷-P1395] [problem:洛谷-P1807] [problem:洛谷-P5318] [problem:洛谷-P2853] [problem:洛谷-B3643] [problem:洛谷-P1127] \n\n**【04】DFS与BFS、迭代加深、双端队列广搜等扩展**\n\n[problem:UVA-529] [problem:CodeForces-1829E] [problem:CodeForces-1843D] [problem:洛谷-P4554] [problem:洛谷-P2901] [problem:AtCoder-abc311_d] [problem:UVA-1343] [problem:CodeForces-525E] [problem:洛谷-P1379] [problem:洛谷-P1219] \n\n**【05】最短路、拓扑排序、最小生成树**\n\n[problem:洛谷-P1119] [problem:洛谷-P1608] [problem:洛谷-P1137] [problem:洛谷-P1194] [problem:洛谷-P4017] [problem:洛谷-P1195] [problem:洛谷-P5905] [problem:洛谷-P2573] [problem:洛谷-P4943] [problem:洛谷-P1265] [problem:洛谷-P5603] \n\n**【06】二分图:染色法、匈牙利算法**\n\n[problem:CodeForces-1139E] [problem:CodeForces-1537F] [problem:CodeForces-1093D] [problem:CodeForces-166D] [problem:CodeForces-741C] [problem:UVA-10004] [problem:洛谷-B3605] [problem:洛谷-P9772] [problem:洛谷-P9583] [problem:洛谷-P1332] \n\n**【07】栈与队列(单调队列、单调栈)、堆**\n\n**【08】快速幂、欧拉函数、逆元**\n\n**【09】中国剩余定理、高斯消元**\n\n**【10】组合计数、容斥原理**\n\n**【11】简单博弈论**\n\n**【12】背包问题、记忆化搜索**\n\n**【13】线性DP、区间DP**\n\n[problem:洛谷-P1440] [problem:洛谷-P1880] [problem:洛谷-P4751] [problem:洛谷-P2434] [problem:洛谷-P1220] [problem:洛谷-P1020] [problem:洛谷-P2285] [problem:洛谷-P1725] [problem:洛谷-P1439] [problem:洛谷-P2758] \n\n**【14】计数类DP、数位DP**\n\n**【15】状态压缩DP、树形DP**\n\n**【16】并查集、线段树和树状数组**\n\n**【17】kmp、Trie、Hash表**\n\n**【18】贪心和时空复杂度分析**","threadId":175614,"likeCnt":3,"createTime":1699458034000,"isWorkbook":true,"viewCnt":540,"openness":2,"fav":false,"id":4259,"trustable":false}