|
|
9344 |
ATarc104b
[ARC104B] DNA Sequence
|
1 / 2 |
10 |
|
|
9338 |
ATarc105b
[ARC105B] MAX-=min
|
1 / 1 |
10 |
|
|
9326 |
ATarc107b
[ARC107B] Quadruple
|
1 / 2 |
10 |
|
|
9320 |
ATarc108b
[ARC108B] Abbreviate Fox
|
1 / 1 |
10 |
|
|
9314 |
ATarc109b
[ARC109B] log
|
1 / 1 |
10 |
|
|
9308 |
ATarc110b
[ARC110B] Many 110
|
1 / 1 |
10 |
|
|
9290 |
ATarc113b
[ARC113B] A^B^C
|
18 / 49 |
5 |
|
|
9277 |
ATarc115a
[ARC115A] Two Choices
|
1 / 1 |
10 |
|
|
9278 |
ATarc115b
[ARC115B] Plus Matrix
|
1 / 4 |
10 |
|
|
9266 |
ATarc117b
[ARC117B] ARC Wrecker
|
1 / 1 |
10 |
|
|
9259 |
ATarc118a
[ARC118A] Tax Included Price
|
1 / 1 |
10 |
|
|
9240 |
ATarc121a
[ARC121A] 2nd Greatest Distance
|
1 / 1 |
10 |
|
|
9229 |
ATarc123b
[ARC123B] Increasing Triples
|
1 / 1 |
10 |
|
|
9222 |
ATarc124a
[ARC124A] LR Constraints
|
1 / 1 |
10 |
|
|
9216 |
ATarc125a
[ARC125A] Dial Up
|
1 / 1 |
10 |
|
|
9210 |
ATarc126a
[ARC126A] Make 10
|
1 / 1 |
10 |
|
|
9198 |
ATarc128a
[ARC128A] Gold and Silver
|
1 / 1 |
10 |
|
|
2516 |
ATarc130b
[ARC130B] Colorful Lines
|
11 / 37 |
6 |
|
|
2503 |
ATarc132a
[ARC132A] Permutation Grid
|
2 / 2 |
10 |
|
|
2497 |
ATarc133a
[ARC133A] Erase by Value
|
1 / 1 |
10 |
|
|
2485 |
ATarc135a
[ARC135A] Floor, Ceil - Decomposition
|
3 / 24 |
9 |
|
|
526 |
ATarc139a
[ARC139A] Trailing Zeros
|
7 / 40 |
8 |
|
|
7831 |
ATarc142a
[ARC142A] Reverse and Minimize
|
1 / 2 |
10 |
|
|
7832 |
ATarc142b
[ARC142B] Unbalanced Squares
|
1 / 1 |
10 |
|
|
7813 |
ATarc145a
[ARC145A] AB Palindrome
|
1 / 1 |
10 |
|
|
183 |
ATarc147a
[ARC147A] Max Mod Min
|
1 / 1 |
10 |
|
|
189 |
ATarc148a
[ARC148A] mod M
|
1 / 1 |
10 |
|
|
1143 |
ATarc151a
[ARC151A] Equal Hamming Distances
|
1 / 1 |
10 |
|
|
140 |
ATarc153a
[ARC153A] AABCDDEFE
|
1 / 1 |
10 |
|
|
134 |
ATarc154a
[ARC154A] Swap Digit
|
1 / 1 |
10 |
|
|
150 |
ATarc156a
[ARC156A] Non-Adjacent Flip
|
1 / 1 |
10 |
|
|
168 |
ATarc157a
[ARC157A] XXYYX
|
1 / 3 |
10 |
|
|
237 |
ATarc159a
[ARC159A] Copy and Paste Graph
|
1 / 1 |
10 |
|
|
225 |
ATarc161a
[ARC161A] Make M
|
1 / 1 |
10 |
|
|
226 |
ATarc161b
[ARC161B] Exactly Three Bits
|
2 / 2 |
10 |
|
|
219 |
ATarc162a
[ARC162A] Ekiden Race
|
1 / 1 |
10 |
|
|
213 |
ATarc163a
[ARC163A] Divide String
|
1 / 1 |
10 |
|
|
207 |
ATarc164a
[ARC164A] Ternary Decomposition
|
2 / 13 |
9 |
|
|
201 |
ATarc165a
[ARC165A] Sum equals LCM
|
15 / 44 |
6 |
|
|
1176 |
ATarc167a
[ARC167A] Toasts for Breakfast Party
|
2 / 2 |
10 |
|
|
1170 |
ATarc168a
[ARC168A] <Inversion>
|
2 / 5 |
10 |
|
|
1158 |
ATarc171a
[ARC171A] No Attacking
|
2 / 3 |
10 |
|
|
46 |
ATarc174a
[ARC174A] A Multiply
|
2 / 3 |
10 |
|
|
1879 |
ATarc177a
[ARC177A] Exchange
|
14 / 17 |
5 |
|
|
2535 |
ATarc177b
[ARC177B] Puzzle of Lamps
|
3 / 3 |
10 |
|
|
875 |
ATdpa
Frog 1
|
43 / 121 |
5 |
|
|
1132 |
ATdpb
Frog 2
|
54 / 126 |
4 |
|
|
1228 |
ATdpd
Knapsack 1
|
26 / 125 |
7 |
|
|
1583 |
ATdph
Grid 1
|
20 / 76 |
7 |
|
|
318 |
CF613D
C23*【虚树】树上特定点集不连通 Kingdom and its Cities
|
81 / 762 |
9 |
|
|
26 |
CF1926C
【模拟(难度:8)】区间的数字和[CF1926C数据增强版]
|
85 / 323 |
7 |
|
|
3 |
P1002
*【C++语言:实数运算】求平均值和乘积(视频)
|
412 / 2595 |
8 |
|
|
4 |
P1003
*【C++语言:选择结构(if)】判断正负(视频)
|
401 / 1959 |
7 |
|
|
9 |
P1008
*【C++语言:循环结构(for)】求和(视频)
|
365 / 1788 |
7 |
|
|
10 |
P1009
*【C++语言:循环结构(for)】阶乘(视频)
|
354 / 2382 |
8 |
|
|
11 |
P1010
*【C++语言:循环结构(for)】分数求和(视频)
|
345 / 1945 |
8 |
|
|
13 |
P1011
*【C++语言:循环结构(for)】数组求平均值(视频)
|
340 / 1979 |
8 |
|
|
16 |
P1014
*【C++语言:for+if】统计个数(视频)
|
323 / 1645 |
7 |
|
|
17 |
P1015
*【C++语言:函数】质数筛选(视频)
|
138 / 1576 |
9 |
|
|
37 |
P1024
*【C++语言:函数】亲密数(视频)
|
207 / 940 |
7 |
|
|
41 |
P1028
*【C++语言:两重for】勾股数(视频)
|
233 / 901 |
7 |
|
|
42 |
P1029
【C++语言:模拟】螺旋矩阵(视频)
|
202 / 851 |
7 |
|
|
43 |
P1030
【C++语言:模拟】蛇形矩阵(视频)
|
178 / 547 |
6 |
|
|
44 |
P1031
*【递归】全排列(视频)
|
162 / 835 |
7 |
|
|
77 |
P1036
*【递归】出栈方案统计[NOIP普及组2003](视频)
|
112 / 337 |
6 |
|
|
83 |
P1042
*【递归】平分石头2
|
55 / 206 |
7 |
|
|
85 |
P1044
*【递归】简单数谜
|
59 / 198 |
6 |
|
|
89 |
P1048
*【宽搜(难度:S4)】巧妙取量
|
61 / 309 |
7 |
|
|
90 |
P1049
*【宽搜(难度:4)】海上救援任务
|
45 / 67 |
1 |
|
|
92 |
P1051
A01 *【模拟:高精度】A+B
|
139 / 1157 |
8 |
|
|
96 |
P1055
E08_2*【背包:填满型01背包】[NOIP 2001 普及组] 装箱问题
|
121 / 605 |
7 |
|
|
101 |
P1059
E76*【树形DP:树上背包】[NOIP2006 提高组] 金明的预算方案
|
59 / 136 |
4 |
|
|
102 |
P1060
*【背包练习】最小车费
|
66 / 106 |
2 |
|
|
104 |
P1062
*【背包:匹配型背包】找单词(题号1062)
|
55 / 108 |
3 |
|
|
145 |
P1067
*【动态规划:区间一维一边推】乘积最大
|
43 / 114 |
5 |
|
|
146 |
P1068
E5*【动态规划:区间二维一边推】最长公共子序列1️⃣
|
85 / 354 |
7 |
|
|
155 |
P1071
*【动态规划:区间二维一边推】相似基因
|
44 / 69 |
2 |
|
|
238 |
P1072
D01 拓扑排序【模版】
|
75 / 358 |
7 |
|
|
241 |
P1075
G44*【组合数:错排】错位排列
|
76 / 295 |
7 |
|
|
243 |
P1077
*【动态规划:状态设计DP】筷子
|
65 / 172 |
5 |
|
|
247 |
P1079
*【动态规划:状态设计DP】喂牛
|
38 / 73 |
3 |
|
|
254 |
P1086
*【动态规划:状态设计DP】僵尸大战植物
|
32 / 77 |
5 |
|
|
255 |
P1087
*【背包:二维01背包】潜水员
|
62 / 170 |
5 |
|
|
264 |
P1091
D130 最小生成树 Kruskal 算法 P1550 [USACO08OCT] Watering Hole G
|
52 / 85 |
2 |
|
|
266 |
P1093
*【并查集】删边问题
|
91 / 177 |
3 |
|
|
271 |
P1098
*【树状数组)】破坏环形公路
|
44 / 99 |
4 |
|
|
300 |
P1104
*【扫描线】城市的地平线[USACO07OPEN] City Horizon S
|
50 / 162 |
6 |
|
|
260 |
P1109
E78 *【树形DP:树上背包】有线电视网
|
49 / 149 |
6 |
|
|
308 |
P1116
*【网络流】晚餐[USACO07OPEN] Dining G
|
66 / 271 |
7 |
|
|
319 |
P1125
*【二分图:最小覆盖】二分图最小覆盖[scy]
|
52 / 138 |
5 |
|
|
340 |
P1143
*【排序】绝对值排序[scy]
|
98 / 378 |
7 |
|
|
342 |
P1145
*【排序】大整数排序[scy]
|
78 / 308 |
7 |
|
|
343 |
P1146
【字符串基础】字符串基本操作
|
129 / 571 |
7 |
|
|
344 |
P1147
D14*【强连通SCC】强连通模板[scy]
|
68 / 339 |
7 |
|
|
354 |
P1157
G08*【线性筛】线性筛素数
|
134 / 762 |
8 |
|
|
359 |
P1162
D12_0【树链剖分】树结构求极值和修改
|
79 / 521 |
8 |
|
|
362 |
P1165
*【一般图:最大匹配】带花树算法[scy]
|
19 / 93 |
7 |
|
|
373 |
P1176
*【单调队列】子矩阵的最大面积(子矩阵中最大值与最小值的差<=C)
|
21 / 87 |
7 |
|
|
374 |
P1177
F03*【KMP】子串是否出现[scy]
|
72 / 428 |
8 |
|
|
375 |
P1178
F04*【EXKMP】最长共同前缀长度 元问题
|
28 / 112 |
7 |