|
|
1150 |
ATarc150b
[ARC150B] Make Divisible
|
4 / 14 |
9 |
|
|
1151 |
ATarc150c
[ARC150C] Path and Subsequence
|
1 / 1 |
10 |
|
|
1144 |
ATarc151b
[ARC151B] A < AP
|
1 / 1 |
10 |
|
|
245 |
ATarc152b
[ARC152B] Pass on Path
|
1 / 1 |
10 |
|
|
136 |
ATarc154c
[ARC154C] Roller
|
1 / 1 |
10 |
|
|
128 |
ATarc155a
[ARC155A] ST and TS Palindrome
|
1 / 1 |
10 |
|
|
129 |
ATarc155b
[ARC155B] Abs Abs Function
|
1 / 1 |
10 |
|
|
151 |
ATarc156b
[ARC156B] Mex on Blackboard
|
2 / 3 |
10 |
|
|
169 |
ATarc157b
[ARC157B] XYYYX
|
1 / 1 |
10 |
|
|
153 |
ATarc157c
[ARC157C] YY Square
|
1 / 1 |
10 |
|
|
162 |
ATarc158b
[ARC158B] Sum-Product Ratio
|
1 / 1 |
10 |
|
|
163 |
ATarc158c
[ARC158C] All Pair Digit Sums
|
2 / 2 |
10 |
|
|
156 |
ATarc159b
[ARC159B] GCD Subtraction
|
1 / 1 |
10 |
|
|
232 |
ATarc160b
[ARC160B] Triple Pair
|
1 / 1 |
10 |
|
|
233 |
ATarc160c
[ARC160C] Power Up
|
1 / 1 |
10 |
|
|
227 |
ATarc161c
[ARC161C] Dyed by Majority (Odd Tree)
|
3 / 8 |
10 |
|
|
228 |
ATarc161d
[ARC161D] Everywhere is Sparser than Whole (Construction)
|
0 / 1 |
10 |
|
|
221 |
ATarc162c
[ARC162C] Mex Game on Tree
|
1 / 1 |
10 |
|
|
215 |
ATarc163c
[ARC163C] Harmonic Mean
|
3 / 3 |
10 |
|
|
209 |
ATarc164c
[ARC164C] Reversible Card Game
|
1 / 1 |
10 |
|
|
202 |
ATarc165b
[ARC165B] Sliding Window Sort 2
|
6 / 41 |
8 |
|
|
203 |
ATarc165c
[ARC165C] Social Distance on Graph
|
5 / 27 |
8 |
|
|
1171 |
ATarc168b
[ARC168B] Arbitrary Nim
|
1 / 1 |
10 |
|
|
11516 |
ATarc169b
[ARC169B] Subsegments with Small Sums
|
1 / 3 |
10 |
|
|
1159 |
ATarc171b
[ARC171B] Chmax
|
14 / 63 |
7 |
|
|
1224 |
ATarc172a
[ARC172A] Chocolate
|
1 / 1 |
10 |
|
|
1225 |
ATarc172b
[ARC172B] AtCoder Language
|
2 / 2 |
10 |
|
|
1226 |
ATarc172c
[ARC172C] Election
|
1 / 1 |
10 |
|
|
1218 |
ATarc173a
[ARC173A] Neq Number
|
1 / 1 |
10 |
|
|
1219 |
ATarc173b
[ARC173B] Make Many Triangles
|
1 / 1 |
10 |
|
|
1215 |
ATarc174d
[ARC174D] Digit vs Square Root
|
1 / 1 |
10 |
|
|
2540 |
ATarc176a
[ARC176A] 01 Matrix Again
|
1 / 1 |
10 |
|
|
2541 |
ATarc176b
[ARC176B] Simple Math 4
|
1 / 1 |
10 |
|
|
1260 |
ATarc178b
[ARC178B] 1 + 6 = 7
|
2 / 9 |
10 |
|
|
1250 |
ATarc179b
[ARC179B] Between B and B
|
4 / 7 |
10 |
|
|
1238 |
ATarc181b
[ARC181B] Annoying String Problem
|
2 / 7 |
10 |
|
|
1239 |
ATarc181c
[ARC181C] Row and Column Order
|
2 / 3 |
10 |
|
|
1529 |
ATdpf
*【动态规划:区间二维一边推】最长公共子序列2️⃣LCS
|
30 / 122 |
7 |
|
|
1585 |
ATdpi
Coins
|
28 / 100 |
6 |
|
|
1589 |
ATdpj
Sushi
|
10 / 65 |
8 |
|
|
1682 |
ATdpm
Candies
|
21 / 43 |
4 |
|
|
1722 |
ATdpo
Matching
|
18 / 43 |
5 |
|
|
1898 |
ATdpq
Flowers
|
9 / 28 |
7 |
|
|
1908 |
ATdpr
Walk
|
7 / 17 |
8 |
|
|
9072 |
ATfps24b
Tuple of Integers
|
2 / 2 |
10 |
|
|
9073 |
ATfps24c
Sequence
|
1 / 3 |
10 |
|
|
9074 |
ATfps24d
Sequence 2
|
1 / 3 |
10 |
|
|
9075 |
ATfps24e
Sequence 3
|
1 / 2 |
10 |
|
|
9077 |
ATfps24g
Coin
|
1 / 2 |
10 |
|
|
9082 |
ATfps24l
Permutation 2
|
2 / 3 |
10 |
|
|
9093 |
ATfps24w
Cycle
|
1 / 3 |
10 |
|
|
2213 |
CF865D
A39【反悔贪心】 Buy Low Sell High
|
32 / 196 |
8 |
|
|
267 |
CF915E
C48 【线段树动态开点】 一维区间修改+区间询问(改)
|
36 / 331 |
9 |
|
|
614 |
CF1312E
*【动态规划:状态设计DP】Array Shrinking
|
1 / 3 |
10 |
|
|
1419 |
CF1324F
E86 换根DP Maximum White Subtree
|
22 / 39 |
3 |
|
|
12505 |
CF1915G
D78 分层图最短路 Dijkstra 算法 CF1915G Bicycles
|
4 / 7 |
10 |
|
|
5 |
P1004
*【C++语言:选择结构(if)】else if(视频)
|
391 / 1737 |
7 |
|
|
6 |
P1005
*【C++语言:选择结构(if)】逻辑运算符&&(并且)(视频)
|
383 / 1617 |
7 |
|
|
7 |
P1006
*【C++语言:选择结构(if)】逻辑运算符 || (或者)(视频)
|
366 / 1401 |
7 |
|
|
14 |
P1012
*【C++语言:for+if】奇数求和(视频)
|
340 / 1605 |
7 |
|
|
15 |
P1013
*【C++语言:for+if】数组中的最大值(视频)
|
328 / 1496 |
7 |
|
|
27 |
P1018
*【C++语言:函数】最大公约数gcd(视频)
|
244 / 894 |
6 |
|
|
33 |
P1020
*【C++语言:两重for】完美数(视频)
|
298 / 1247 |
7 |
|
|
34 |
P1021
*【C++语言:两重for】打印菱形(视频)
|
280 / 1003 |
6 |
|
|
39 |
P1026
*【C++语言:选择结构(if)】逻辑运算符综合 II[判断闰年(升级版)]
|
128 / 346 |
5 |
|
|
45 |
P1032
*【递归】组合(视频)
|
137 / 513 |
7 |
|
|
62 |
P1034
*【递归】已知先序和中序求后序(视频)
|
111 / 527 |
7 |
|
|
79 |
P1038
*【递归】加法分解方案1
|
81 / 297 |
6 |
|
|
81 |
P1040
*【递归】素数圈
|
90 / 240 |
5 |
|
|
84 |
P1043
*【递归】乘法分解方案
|
50 / 132 |
5 |
|
|
93 |
P1052
A02 *【模拟:高精度】A-B
|
110 / 610 |
8 |
|
|
105 |
P1063
*【动态规划:区间一维一边推】美元和马克
|
90 / 235 |
5 |
|
|
108 |
P1064
E03E04*【动态规划:区间一维一边推】最长上升子序列
|
98 / 433 |
7 |
|
|
147 |
P1069
*【动态规划:区间二维一边推】顺序对齐
|
46 / 124 |
5 |
|
|
239 |
P1073
*【动态规划:区间三维一边推】最长公共子序列3️⃣
|
50 / 135 |
5 |
|
|
246 |
P1078
*【动态规划:状态设计DP】不重叠线段的最大长度和[scy]
|
49 / 138 |
5 |
|
|
250 |
P1082
*【动态规划:状态设计DP】火车票
|
32 / 52 |
2 |
|
|
311 |
P1119
*【网络流(难度:S7)】牛挤奶
|
34 / 78 |
4 |
|
|
313 |
P1121
*【最小费用流】游农场[Farm Tour, USACO03Feb]
|
25 / 70 |
5 |
|
|
317 |
P1124
*【二分图:最大匹配】地鼠[Waterloolocal2001]
|
68 / 380 |
8 |
|
|
320 |
P1126
*【二分图:最小覆盖】[USACO05NOV] Asteroids G
|
46 / 124 |
5 |
|
|
321 |
P1127
*【树形DP:树的重心】树的重心
|
71 / 281 |
7 |
|
|
325 |
P1131
G16 裴蜀定理[P4549] 【模板】裴蜀定理
|
22 / 184 |
8 |
|
|
350 |
P1153
G17*【扩展欧几里得:解不定方程】Ax+By=K
|
68 / 426 |
8 |
|
|
353 |
P1156
G21*【高次同余方程:BSGS】高次同余方程
|
70 / 368 |
8 |
|
|
366 |
P1169
G59_2 台阶型 Nim游戏*【博弈SG】阶梯nim练习1[POJ1704]Georgia and Bob
|
49 / 141 |
5 |
|
|
368 |
P1171
G60*【博弈SG】练习1:在图中求SG
|
16 / 51 |
6 |
|
|
372 |
P1175
*【单调队列:二维DP】猴子吃香蕉[GDKOI2007改编]
|
29 / 102 |
6 |
|
|
382 |
P1185
*【一般图:带权最大匹配】一般图最大权匹配
|
4 / 12 |
9 |
|
|
434 |
P1212
G50 叉积应用 线线关系*【计算几何:叉积】判断线段相交[POJ2653]
|
20 / 84 |
7 |
|
|
435 |
P1213
*【计算几何:叉积】多边形的面积
|
23 / 58 |
5 |
|
|
444 |
P1220
*【模拟(难度:5)】康托展开及其逆运算
|
51 / 140 |
5 |
|
|
464 |
P1239
G40*【莫比乌斯反演:杜教筛2】i*j*gcd(i,j)求和2 [P3768]简单的数学题(没数据)
|
8 / 27 |
7 |
|
|
465 |
P1240
*【RMQ】区间出现次数最多的数[POJ3368]
|
39 / 190 |
7 |
|
|
478 |
P1253
数列分块出门
|
9 / 29 |
7 |
|
|
485 |
P1260
*【模拟】A*B2️⃣(压位)
|
58 / 442 |
8 |
|
|
490 |
P1265
G35*【组合数:指数生成函数】水果的排列[HDU1521]
|
37 / 319 |
8 |
|
|
493 |
P1268
G57_3 自适应辛普森积分【计算几何】自适应辛普森法 2[P4526]
|
13 / 30 |
5 |
|
|
499 |
P1274
*【矩阵乘法】5:地雷
|
16 / 32 |
5 |
|
|
503 |
P1278
F01 最小表示法【模板题】
|
44 / 294 |
8 |