|
|
2474 |
ATarc137b
[ARC137B] Count 1's
|
1 / 1 |
10 |
|
|
524 |
ATarc138a
[ARC138A] Larger Score
|
1 / 1 |
10 |
|
|
525 |
ATarc138b
[ARC138B] 01 Generation
|
1 / 1 |
10 |
|
|
7819 |
ATarc140a
[ARC140A] Right String
|
1 / 1 |
10 |
|
|
7820 |
ATarc140b
[ARC140B] Shorten ARC
|
1 / 1 |
10 |
|
|
7825 |
ATarc141a
[ARC141A] Periodic Number
|
1 / 2 |
10 |
|
|
7826 |
ATarc141b
[ARC141B] Increasing Prefix XOR
|
1 / 4 |
10 |
|
|
7844 |
ATarc144b
[ARC144B] Gift Tax
|
1 / 1 |
10 |
|
|
172 |
ATarc145b
[ARC145B] AB Game
|
1 / 1 |
10 |
|
|
177 |
ATarc146a
[ARC146A] Three Cards
|
1 / 1 |
10 |
|
|
184 |
ATarc147b
[ARC147B] Swap to Sort
|
1 / 1 |
10 |
|
|
190 |
ATarc148b
[ARC148B] dp
|
1 / 1 |
10 |
|
|
623 |
ATarc149a
[ARC149A] Repdigit Number
|
1 / 1 |
10 |
|
|
1149 |
ATarc150a
[ARC150A] Continuous 1
|
1 / 1 |
10 |
|
|
135 |
ATarc154b
[ARC154B] New Place
|
1 / 1 |
10 |
|
|
161 |
ATarc158a
[ARC158A] +3 +5 +7
|
4 / 10 |
9 |
|
|
231 |
ATarc160a
[ARC160A] Reverse and Count
|
1 / 1 |
10 |
|
|
220 |
ATarc162b
[ARC162B] Insertion Sort 2
|
0 / 1 |
10 |
|
|
214 |
ATarc163b
[ARC163B] Favorite Game
|
1 / 1 |
10 |
|
|
208 |
ATarc164b
[ARC164B] Switching Travel
|
1 / 1 |
10 |
|
|
1182 |
ATarc166a
[ARC166A] Replace C or Swap AB
|
1 / 1 |
10 |
|
|
1183 |
ATarc166b
[ARC166B] Make Multiples
|
1 / 1 |
10 |
|
|
1177 |
ATarc167b
[ARC167B] Product of Divisors
|
1 / 1 |
10 |
|
|
11519 |
ATarc169a
[ARC169A] Please Sign
|
1 / 1 |
10 |
|
|
1164 |
ATarc170a
[ARC170A] Yet Another AB Problem
|
14 / 59 |
7 |
|
|
1165 |
ATarc170b
[ARC170B] Arithmetic Progression Subsequence
|
1 / 1 |
10 |
|
|
48 |
ATarc174b
[ARC174B] Bought Review
|
1 / 1 |
10 |
|
|
2546 |
ATarc175a
[ARC175A] Spoon Taking Problem
|
1 / 3 |
10 |
|
|
2547 |
ATarc175b
[ARC175B] Parenthesis Arrangement
|
1 / 1 |
10 |
|
|
2536 |
ATarc177c
[ARC177C] Routing
|
1 / 1 |
10 |
|
|
1255 |
ATarc178a
[ARC178A] Good Permutation 2
|
1 / 1 |
10 |
|
|
1249 |
ATarc179a
[ARC179A] Partition
|
10 / 39 |
7 |
|
|
1243 |
ATarc180a
[ARC180A] ABA and BAB
|
1 / 1 |
10 |
|
|
1237 |
ATarc181a
[ARC181A] Sort Left and Right
|
8 / 28 |
7 |
|
|
1231 |
ATarc182a
[ARC182A] Chmax Rush!
|
1 / 2 |
10 |
|
|
1232 |
ATarc182b
[ARC182B] |{floor(A_i/2^k)}|
|
1 / 2 |
10 |
|
|
1893 |
ATarc183a
[ARC183A] Median of Good Sequences
|
4 / 4 |
10 |
|
|
1155 |
ATdpc
Vacation
|
49 / 100 |
4 |
|
|
1493 |
ATdpe
Knapsack 2
|
29 / 104 |
6 |
|
|
1582 |
ATdpg
Longest Path
|
19 / 55 |
6 |
|
|
1678 |
ATdpk
Stones
|
23 / 78 |
6 |
|
|
1681 |
ATdpl
Deque
|
21 / 67 |
6 |
|
|
1695 |
ATdpn
Slimes
|
23 / 79 |
6 |
|
|
1852 |
ATdpp
Independent Set
|
19 / 67 |
6 |
|
|
12510 |
CF59E
D101 BFS最短路 CF59E Shortest Path
|
2 / 3 |
10 |
|
|
40 |
CF1850G
*【STL：map】The Morning Star
|
70 / 160 |
4 |
|
|
645 |
CF1974C
*【STL：map】Beautiful Triple Pairs
|
32 / 68 |
4 |
|
|
8 |
P1007
*【C++语言：选择结构（if）】逻辑运算符综合[判断闰年]（视频）
|
363 / 1580 |
7 |
|
|
18 |
P1016
*【C++语言：函数】判断回文数
|
179 / 747 |
7 |
|
|
30 |
P1019
*【C++语言：两重for】杨辉三角形（视频）
|
299 / 1551 |
7 |
|
|
35 |
P1022
*【C++语言：循环结构（while）】位数和（视频）
|
280 / 898 |
6 |
|
|
36 |
P1023
*【C++语言：循环结构（while）】角谷猜想（视频）
|
195 / 1032 |
8 |
|
|
38 |
P1025
*【模拟】自守数
|
173 / 376 |
4 |
|
|
47 |
P1033
*【递归】组合+判断素数（视频）
|
123 / 543 |
7 |
|
|
78 |
P1037
*【递归】矩阵路线2
|
73 / 280 |
7 |
|
|
86 |
P1045
G15 威尔逊定理 [hdu2973] YAPTCHA
|
58 / 140 |
5 |
|
|
98 |
P1056
*【背包：填满型01背包】多个背包一样大
|
86 / 219 |
5 |
|
|
97 |
P1057
E08_1*【背包：价值填满型01背包】[NOIP 2005 普及组] 采药
|
105 / 496 |
7 |
|
|
100 |
P1058
E09_1*【背包：价值填满型完全背包】山洞宝石2
|
96 / 347 |
6 |
|
|
103 |
P1061
*【背包：匹配型背包】匹配字符串（题号1061）
|
58 / 102 |
3 |
|
|
125 |
P1065
*【动态规划：区间一维一边推】合唱队形[NOIP提高组2004 输出修改版]
|
78 / 190 |
5 |
|
|
242 |
P1076
*【动态规划：状态设计DP】最大的算式
|
62 / 157 |
5 |
|
|
251 |
P1083
*【动态规划：区间一维一边推】零件分组
|
49 / 102 |
4 |
|
|
23 |
P1106
*【动态规划：区间中间推】[NOIP 2003 提高组] 加分二叉树
|
52 / 145 |
5 |
|
|
25 |
P1108
E18*【树形DP：树上背包】选课[CTSC1997]
|
54 / 167 |
6 |
|
|
302 |
P1110
E17*【树形DP：相邻点互斥】有根树最大不相邻点权和[没有上司的舞会]
|
81 / 385 |
7 |
|
|
303 |
P1111
*【树形DP：相邻点兼容】保护所有点[SDOI2006] 保安站岗
|
59 / 305 |
7 |
|
|
304 |
P1112
*【树形DP：相邻点兼容】保护所有边[战略游戏]
|
34 / 290 |
8 |
|
|
305 |
P1113
*【树形DP：树的中心】树的中心[scy]
|
79 / 390 |
7 |
|
|
306 |
P1114
E75*【树形DP：树上背包】多叉苹果树【scy改编ural1018二叉苹果树】
|
57 / 176 |
6 |
|
|
315 |
P1122
D25*【二分图：最大匹配】二分图最大匹配[scy]
|
86 / 618 |
8 |
|
|
316 |
P1123
*【二分图：最大匹配】上课[POJ2239]
|
72 / 183 |
5 |
|
|
333 |
P1140
*【斜率优化】土地征用 [USACO08MAR] Land Acquisition G
|
39 / 135 |
6 |
|
|
351 |
P1154
G18*【扩展欧几里得：解同余方程】模板ax=b(mod m)
|
55 / 278 |
7 |
|
|
355 |
P1158
G09*【线性筛：欧拉函数】线性筛求欧拉函数
|
54 / 184 |
6 |
|
|
357 |
P1160
*【线性筛：欧拉函数】法雷级数
|
33 / 53 |
2 |
|
|
363 |
P1166
G58_2 尼姆（Nim）游戏*【博弈SG】Nim取石子游戏3[P1247微改]
|
51 / 195 |
7 |
|
|
364 |
P1167
*【博弈SG】模型一：翻转硬币(元问题)
|
49 / 120 |
5 |
|
|
365 |
P1168
G59_1 台阶型 Nim游戏*【博弈SG】模型二：阶梯nim(元问题)
|
49 / 199 |
7 |
|
|
379 |
P1182
*【组合数：拓展Lucas定理】扩展卢卡斯定理/exLucas
|
8 / 17 |
7 |
|
|
380 |
P1183
【数论基础（难度：5）】欧拉函数应用：原根
|
13 / 23 |
5 |
|
|
386 |
P1189
G60_2 有向图游戏 SG函数*【博弈论】[poj2960]S-Nim
|
11 / 30 |
6 |
|
|
390 |
P1193
*【博弈SG】练习3：A Funny Stone Game（未解决）
|
5 / 6 |
10 |
|
|
396 |
P1199
【排序最高境界题】松式基排
|
4 / 25 |
8 |
|
|
402 |
P1205
*【高斯消元】线性方程组[scy]
|
52 / 207 |
7 |
|
|
406 |
P1209
*【计算几何：扫描线】矩形面积交
|
8 / 12 |
8 |
|
|
407 |
P1210
D01*【拓扑（难度：3）】大学选课
|
64 / 185 |
6 |
|
|
439 |
P1215
G54_4 半平面交 双端队列【计算几何】求半平面交的面积
|
24 / 140 |
8 |
|
|
451 |
P1227
*【矩阵树】无向图生成树计数[scy]
|
24 / 69 |
6 |
|
|
452 |
P1228
*【关键路径】点燃图
|
30 / 62 |
4 |
|
|
453 |
P1229
*【欧拉路径】欧拉回路
|
27 / 128 |
7 |
|
|
454 |
P1230
*【哈密顿路径】哈密顿路径[scy]
|
27 / 66 |
5 |
|
|
458 |
P1233
笛卡尔树(模版)
|
1 / 2 |
10 |
|
|
468 |
P1243
*【组合数：可重复排列】可重复排列
|
47 / 242 |
7 |
|
|
505 |
P1280
【一维除法分块加速】商求和[scy]
|
72 / 221 |
6 |
|
|
506 |
P1281
*【莫比乌斯反演】gcd(i,j)=1的对数[scy]+题解
|
48 / 312 |
8 |
|
|
532 |
P1309
G11*【线性筛】线性筛求约数和
|
62 / 210 |
6 |
|
|
534 |
P1311
[NOIP普及组2002]过河卒
|
10 / 13 |
7 |
|
|
335 |
P1313
[NOIP普及组2003]数字游戏
|
3 / 4 |
10 |
|
|
114 |
P1318
*【递归】FBI树[NOIP普及组2004]
|
50 / 127 |
5 |
