ID 题目 显示标签 隐藏标签 AC / 尝试 难度
7829 ATarc141e   [ARC141E] Sliding Edge on Torus 0 / 0 (无)
7834 ATarc142d   [ARC142D] Deterministic Placing 1 / 1 10
7841 ATarc143e   [ARC143E] Reversi 1 / 1 10
7810 ATarc144d   [ARC144D] AND OR Equation 1 / 1 10
7812 ATarc144f   [ARC144F] Arithmetic Sequence Nim 1 / 1 10
179 ATarc146c   [ARC146C] Even XOR 1 / 1 10
180 ATarc146d   [ARC146D] >=< 1 / 1 10
181 ATarc146e   [ARC146E] Simple Speed 1 / 1 10
187 ATarc147e   [ARC147E] Examination 1 / 1 10
193 ATarc148e   [ARC148E] ≥ K 1 / 1 10
196 ATarc149d   [ARC149D] Simultaneous Sugoroku 1 / 1 10
197 ATarc149e   [ARC149E] Sliding Window Sort 1 / 1 10
1152 ATarc150d   [ARC150D] Removing Gacha 1 / 1 10
1147 ATarc151e   [ARC151E] Keep Being Substring 1 / 1 10
1141 ATarc152e   [ARC152E] Xor Annihilation 2 / 2 10
143 ATarc153d   [ARC153D] Sum of Sum of Digits 1 / 1 10
131 ATarc155d   [ARC155D] Avoid Coprime Game 1 / 1 10
1290 ATarc156d   [ARC156D] Xor Sum 5 1 / 1 10
154 ATarc157d   [ARC157D] YY Garden 1 / 1 10
148 ATarc157e   [ARC157E] XXYX Binary Tree 1 / 1 10
164 ATarc158d   [ARC158D] Equation 1 / 1 10
166 ATarc158e   [ARC158E] All Pair Shortest Paths 1 / 1 10
160 ATarc159f   [ARC159F] Good Division 1 / 1 10
234 ATarc160d   [ARC160D] Mahjong 1 / 1 10
235 ATarc160e   [ARC160E] Make Biconnected 0 / 1 10
236 ATarc160f   [ARC160F] Count Sorted Arrays 1 / 1 10
222 ATarc162d   [ARC162D] Smallest Vertices 1 / 1 10
223 ATarc162e   [ARC162E] Strange Constraints 1 / 1 10
224 ATarc162f   [ARC162F] Montage 1 / 1 10
216 ATarc163d   [ARC163D] Sum of SCC 1 / 1 10
211 ATarc164e   [ARC164E] Segment-Tree Optimization 1 / 1 10
204 ATarc165d   [ARC165D] Substring Comparison 3 / 80 10
205 ATarc165e   [ARC165E] Random Isolation 8 / 31 7
206 ATarc165f   [ARC165F] Make Adjacent 6 / 44 8
1178 ATarc167c   [ARC167C] MST on Line++ 1 / 1 10
1180 ATarc167e   [ARC167E] One Square in a Triangle 0 / 1 10
1174 ATarc168e   [ARC168E] Subsegments with Large Sums 1 / 1 10
11518 ATarc169d   [ARC169D] Add to Make a Permutation 1 / 2 10
1168 ATarc170e   [ARC170E] BDFS 1 / 1 10
1160 ATarc171c   [ARC171C] Swap on Tree 11 / 60 8
1162 ATarc171e   [ARC171E] Rookhopper's Tour 1 / 1 10
1227 ATarc172d   [ARC172D] Distance Ranking 1 / 1 10
1156 ATarc172e   [ARC172E] Last 9 Digits 1 / 2 10
1221 ATarc173d   [ARC173D] Bracket Walk 1 / 1 10
1222 ATarc173e   [ARC173E] Rearrange and Adjacent XOR 1 / 1 10
1216 ATarc174e   [ARC174E] Existence Counting 1 / 1 10
2543 ATarc176d   [ARC176D] Swap Permutation 1 / 1 10
2537 ATarc177d   [ARC177D] Earthquakes 1 / 1 10
2538 ATarc177e   [ARC177E] Wrong Scoreboard 1 / 1 10
1262 ATarc178d   [ARC178D] Delete Range Mex 1 / 1 10
1252 ATarc179d   [ARC179D] Portable Gate 3 / 13 9
1253 ATarc179e   [ARC179E] Rectangle Concatenation 1 / 1 10
1246 ATarc180d   [ARC180D] Division into 3 1 / 1 10
1233 ATarc182c   [ARC182C] Sum of Number of Divisors of Product 1 / 2 10
1897 ATarc183d   [ARC183D] Keep Perfectly Matched 1 / 1 10
1229 ATarc183e   [ARC183E] Ascendant Descendant 1 / 1 10
6673 ATarc212f   [ARC212F] Add Integer 3 / 8 10
2200 ATdpw   Intervals 3 / 8 10
9079 ATfps24i   Score 1 / 3 10
9080 ATfps24j   Sugoroku 1 / 2 10
9084 ATfps24n   Coin 2 1 / 2 10
9085 ATfps24o   Rooted Tree 1 / 1 10
9087 ATfps24q   Dice 1 / 2 10
9088 ATfps24r   R - Random Walk 1 / 2 10
1886 CF341D   C95【二维树状数组+差分】二维区间异或修改+区间求异或和Iahub and Xors 10 / 68 8
430 CF601E   C139【线段树分治+01背包】A Museum Robbery 18 / 32 4
1119 CF932F   C122【李超树合并+DP】Escape Through Leaf 27 / 35 1
12491 CF986F   D126 同余最短路 Dijkstra 算法 CF986F Oppa Funcan Style Remastered 1 / 2 9
356 CF1100F   G69*【前缀线性基+贪心】区间异或和最大 Ivan and Burgers 39 / 150 7
74 CF1303G   *【李超线段树+点分治】Sum of Prefix Sums 2 / 12 10
2220 CF1814F   C132【线段树分治+并查集】 Communication Towers 2 / 4 10
1442 CF1830D   E81 树上背包 Mex Tree 2 / 145 10
252 P1084   *【动态规划:状态设计DP】任务安排1 39 / 70 3
309 P1117   *【网络流(难度:S7)】路径中的最长边最小 [USACO05FEB] Secret Milking Machine G 48 / 146 6
370 P1173   E43*【单调队列】连续m个至少选一个的最小总和[烽火传递] 76 / 278 6
446 P1222   *【仙人掌】无向连通图的支撑子图个数[SHOI2006]仙人掌 6 / 34 8
448 P1224   G46*【组合数:第二类斯特林数(斯特林子集数)】第二类斯特林数 21 / 94 7
455 P1231   *【递归】图的涂色 17 / 26 4
457 P1232   划分树(模版) 1 / 3 10
489 P1264   G34*【组合数:普通生成函数】水果的組合[HDU2152] 37 / 272 8
514 P1289   [动态dp模版]最大权独立集(线段树版本) 4 / 15 9
663 P1344   [NOIP普及组2011]数字反转 18 / 28 4
693 P1393   【递归(难度:7)】好人&坏人的约瑟夫问题 13 / 21 5
698 P1398   【宽搜练习】火柴人的末日(简易版) 8 / 33 7
702 P1402   *【差分约束】判断约束系统是否有解 9 / 94 9
723 P1411   *【背包练习】打牌 29 / 86 6
683 P1415   *【动态规划练习】挖地雷[NOIP提高组1996] 12 / 15 6
561 P1446   *【可持久化线段树】区间 ≤k 的个数 46 / 218 7
616 P1501   G36*【组合数:指数生成函数】Blocks[POJ3734] 35 / 77 4
3154 P1520   *【字符串:hash值】统计字符串出现的次数[Oulipo] 38 / 168 7
12 P1527   [NOIP提高组2006]作业调度方案 1 / 1 10
870 P1691   *【递归】相邻两数差不超K的圆排列 83 / 318 7
920 P1742   hyy有鱼系列(15) 2 / 10 10
923 P1745   scy的简单DP题【缺数据】 1 / 25 10
930 P1752   lb摸鱼系列3:hyy之失眠 3 / 14 9
1008 P1829   [USACO2.2] 集合 Subset Sums 12 / 21 5
1031 P1852   [IOI 1996 / USACO3.3] 游戏 A Game 8 / 8 9
1039 P1860   *【最短路:floyd求最小环】[USACO4.1] 篱笆回路 Fence Loops 14 / 23 5
1040 P1861   D100【最短路】最短路计数 29 / 50 3
1043 P1864   map的用法 8 / 9 9

分类

试试手气

根据当前过滤条件随机选择一道题