ID 题目 显示标签 隐藏标签 AC / 尝试 难度
8010 ATagc069c   [AGC069C] AB*A Changing 1 / 1 10
8011 ATagc069d   [AGC069D] Tree and Intervals 1 / 1 10
9532 ATarc058c   [ARC058E] 和風いろはちゃん 1 / 1 10
9528 ATarc059c   [ARC059E] キャンディーとN人の子供 2 / 2 10
9529 ATarc059d   [ARC059F] バイナリハック 1 / 1 10
9499 ATarc066c   [ARC066E] Addition and Subtraction Hard 1 / 1 10
9500 ATarc066d   [ARC066F] Contest with Drinks Hard 1 / 1 10
9495 ATarc067c   [ARC067E] Grouping 1 / 1 10
9492 ATarc068d   [ARC068F] Solitaire 1 / 1 10
9483 ATarc070c   [ARC070E] NarrowRectangles 1 / 1 10
9472 ATarc073d   [ARC073F] Many Moves 1 / 2 10
9414 ATarc087b   [ABC082D] FT Robot 1 / 1 10
9363 ATarc100c   [ARC100E] Or Plus Max 1 / 1 10
9345 ATarc104c   [ARC104C] Fair Elevator 1 / 1 10
9347 ATarc104e   [ARC104E] Random LIS 1 / 1 10
9328 ATarc107d   [ARC107D] Number of Multisets 1 / 2 10
9299 ATarc112e   [ARC112E] Cigar Box 1 / 1 10
9281 ATarc115e   [ARC115E] LEQ and NEQ 1 / 1 10
9275 ATarc116e   [ARC116E] Spread of Information 6 / 14 8
9258 ATarc119f   [ARC119F] AtCoder Express 3 1 / 1 10
9230 ATarc123c   [ARC123C] 1, 2, 3 - Decomposition 1 / 1 10
9226 ATarc124e   [ARC124E] Pass to Next 1 / 1 10
2505 ATarc132c   [ARC132C] Almost Sorted 1 / 1 10
2482 ATarc136d   [ARC136D] Without Carry 1 / 1 10
181 ATarc146e   [ARC146E] Simple Speed 1 / 1 10
143 ATarc153d   [ARC153D] Sum of Sum of Digits 1 / 1 10
144 ATarc153e   [ARC153E] Deque Minimization 1 / 1 10
1291 ATarc156e   [ARC156E] Non-Adjacent Matching 1 / 1 10
153 ATarc157c   [ARC157C] YY Square 1 / 1 10
149 ATarc157f   [ARC157F] XY Ladder LCS 2 / 3 10
167 ATarc158f   [ARC158F] Random Radix Sort 1 / 1 10
158 ATarc159d   [ARC159D] LIS 2 3 / 10 10
160 ATarc159f   [ARC159F] Good Division 1 / 1 10
233 ATarc160c   [ARC160C] Power Up 1 / 1 10
236 ATarc160f   [ARC160F] Count Sorted Arrays 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
210 ATarc164d   [ARC164D] 1D Coulomb 1 / 2 10
211 ATarc164e   [ARC164E] Segment-Tree Optimization 1 / 1 10
1183 ATarc166b   [ARC166B] Make Multiples 1 / 1 10
1184 ATarc166c   [ARC166C] LU / RD Marking 1 / 1 10
1173 ATarc168d   [ARC168D] Maximize Update 2 / 2 10
1174 ATarc168e   [ARC168E] Subsegments with Large Sums 1 / 1 10
11516 ATarc169b   [ARC169B] Subsegments with Small Sums 1 / 3 10
11517 ATarc169c   [ARC169C] Not So Consecutive 1 / 3 10
11521 ATarc169f   [ARC169F] Large DP Table 1 / 2 10
1166 ATarc170c   [ARC170C] Prefix Mex Sequence 1 / 1 10
1168 ATarc170e   [ARC170E] BDFS 1 / 1 10
1160 ATarc171c   [ARC171C] Swap on Tree 11 / 60 8
1161 ATarc171d   [ARC171D] Rolling Hash 3 / 42 9
1157 ATarc172f   [ARC172F] Walking 1 / 1 10
46 ATarc174a   [ARC174A] A Multiply 2 / 3 10
1214 ATarc174c   [ARC174C] Catastrophic Roulette 1 / 1 10
1217 ATarc174f   [ARC174F] Final Stage 1 / 1 10
2539 ATarc177f   [ARC177F] Two Airlines 1 / 1 10
1261 ATarc178c   [ARC178C] Sum of Abs 2 1 / 1 10
1262 ATarc178d   [ARC178D] Delete Range Mex 1 / 1 10
1254 ATarc179f   [ARC179F] All the Same 1 / 1 10
1245 ATarc180c   [ARC180C] Subsequence and Prefix Sum 1 / 1 10
1247 ATarc180e   [ARC180E] LIS and Inversion 1 / 1 10
1242 ATarc181f   [ARC181F] Colorful Reversi 1 / 1 10
875 ATdpa   Frog 1 43 / 121 5
1155 ATdpc   Vacation 49 / 100 4
1493 ATdpe   Knapsack 2 29 / 104 6
1529 ATdpf   *【动态规划:区间二维一边推】最长公共子序列2️⃣LCS 30 / 122 7
1589 ATdpj   Sushi 10 / 65 8
1722 ATdpo   Matching 18 / 43 5
1852 ATdpp   Independent Set 19 / 67 6
1898 ATdpq   Flowers 9 / 28 7
2089 ATdpt   Permutation 8 / 18 7
2200 ATdpw   Intervals 3 / 8 10
2207 ATdpx   Tower 9 / 18 7
2208 ATdpy   Grid 2 12 / 40 6
9075 ATfps24e   Sequence 3 1 / 2 10
9082 ATfps24l   Permutation 2 2 / 3 10
9091 ATfps24u   Recorder 1 / 5 10
4741 CF1009F   D34_1【模板】长链剖分 Dominant Indices 1 / 4 10
1416 CF1187E   E87 换根DP Tree Painting 16 / 45 6
614 CF1312E   *【动态规划:状态设计DP】Array Shrinking 1 / 3 10
12504 CF1473E   D79 分层图最短路 Dijkstra 算法 CF1473E Minimum Path 4 / 7 10
871 P1692   D75【模板】分层图最短路 Dijkstra 算法[USACO09FEB] Revamping Trails G 14 / 27 5
1023 P1844   E09_2[USACO3.1] 总分 Score Inflation 10 / 10 9
1552 P2268   *【递归】所有点度数为奇[USACO11OPEN] Odd degrees G 17 / 78 7
2994 P3341   [BalticOI 2007] Ranklist Sorting (Day 1) 0 / 1 10
3003 P3350   [BalticOI 2006] JUMP THE BOARD! (Day 2) 0 / 8 10
3005 P3352   [BalticOI 2006] RLE COMPRESSION (Day 2) 0 / 26 10
3007 P3354   [BalticOI 2005] Bus Trip(无数据) 0 / 60 10
3027 P3374   [BalticOI 2003] Register Allocation (Day 2) 0 / 46 10
3029 P3376   D107 分层图最短路 Dijkstra 算法[BalticOI 2002] Speed Limits (Day1) 1 / 1 10
3043 P3390   [CEOI 2008] Fence 1 / 1 10
3047 P3394   [BalticOI 2005] Ancient Manuscript (Day2) 0 / 32 10
3048 P3395   [BalticOI 2005] Bus Trip (Day2) 0 / 19 10
3186 P3531   *【背包:二进制压缩】硬币2[POI 2005] BAN-Bank Notes 16 / 61 7
3190 P3535   [POI 2005] SZA-Template 1 / 1 10
3192 P3537   [POI 2005] AUT-The Bus 1 / 1 10
3423 P3767   [CEOI 2009] Harbingers 1 / 2 10
3441 P3785   [WC2025] 士兵(无数据) 1 / 1 10
3575 P3910   [CTSC2002] 颁奖典礼 1 / 1 10
3610 P3945   [CEOI 2007] 树的匹配 Treasury 1 / 1 10

分类

试试手气

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