|
|
30532 |
codeforces#P1227G
Not Same
|
0 / 0 |
10 |
|
|
9076 |
luogu#P5052
[COCI 2017/2018 #7] Go
|
0 / 0 |
5 |
|
|
13972 |
luogu#P10005
[集训队互测 2023] 基础寄术练习题
|
0 / 0 |
7 |
|
|
35833 |
luogu#B4164
[BCSP-X 2024 12 月初中组] 末日塔后传
|
0 / 0 |
3 |
|
|
36439 |
luogu#P12124
[蓝桥杯 2024 省 B 第二场] 前缀总分
|
0 / 0 |
4 |
|
|
36292 |
luogu#P12042
[USTCPC 2025] 图上交互题 3 / Constructive Maximum Mex Path
|
0 / 0 |
4 |
|
|
18544 |
atcoder#ABC218G
[ABC218G] Game on Tree 2
|
1 / 2 |
5 |
|
|
30498 |
codeforces#P1220E
Tourism
|
0 / 0 |
8 |
|
|
8374 |
luogu#P4347
[CERC2015] Book Borders
|
0 / 0 |
6 |
|
|
30467 |
codeforces#P1215E
Marbles
|
0 / 0 |
8 |
|
|
27259 |
codeforces#P507D
The Maths Lecture
|
0 / 0 |
8 |
|
|
19574 |
atcoder#AGC056D
[AGC056D] Subset Sum Game
|
1 / 1 |
7 |
|
|
27914 |
codeforces#P666B
World Tour
|
0 / 3 |
7 |
|
|
11010 |
luogu#P7001
[NEERC 2013] Fraud Busters
|
0 / 0 |
1 |
|
|
33529 |
codeforces#P1779H
Olympic Team Building
|
0 / 0 |
(无) |
|
|
30626 |
codeforces#P1250N
Wires
|
0 / 0 |
7 |
|
|
29532 |
codeforces#P1033D
Divisors
|
0 / 0 |
7 |
|
|
26492 |
codeforces#P316F1
Suns and Rays
|
0 / 0 |
8 |
|
|
7634 |
luogu#P3606
[USACO17JAN] Building a Tall Barn P
|
0 / 0 |
5 |
|
|
20095 |
atcoder#ARC151F
[ARC151F] RGB Card Game
|
1 / 1 |
7 |
|
|
10203 |
luogu#P6186
[NOI Online #1 提高组] 冒泡排序
|
5 / 15 |
5 |
|
|
28872 |
codeforces#P886D
Restoration of string
|
0 / 0 |
7 |
|
|
33469 |
codeforces#P1773B
BinCoin
|
0 / 0 |
8 |
|
|
20075 |
atcoder#ARC148D
[ARC148D] mod M Game
|
1 / 1 |
5 |
|
|
17042 |
loj#P3922
「USACO 2022.12 Platinum」Breakdown
|
0 / 0 |
(无) |
|
|
17054 |
loj#P3935
「USACO 2023.1 Platinum」Mana Collection
|
0 / 0 |
(无) |
|
|
17055 |
loj#P3936
「USACO 2023.1 Platinum」Subtree Activation
|
0 / 0 |
(无) |
|
|
36973 |
loj#P4778
「USACO 2025.1 Platinum」DFS Order
|
0 / 0 |
(无) |
|
|
6899 |
luogu#P2869
[USACO07DEC] Gourmet Grazers G
|
0 / 0 |
5 |
|
|
25129 |
codeforces#P13B
Letter A
|
0 / 0 |
7 |
|
|
30646 |
codeforces#P1253A
Single Push
|
0 / 0 |
3 |
|
|
1505 |
bzoj#P1955
[Wuhan2010] Assembling Services
|
1 / 1 |
10 |
|
|
36291 |
luogu#P12041
[USTCPC 2025] 图上交互题 2 / Constructive Minimum Mex Path
|
0 / 0 |
5 |
|
|
26233 |
codeforces#P251C
Number Transformation
|
0 / 0 |
7 |
|
|
29851 |
codeforces#P1098D
Eels
|
0 / 0 |
10 |
|
|
22588 |
spoj#GETFAST
Getting There Fast
|
0 / 0 |
(无) |
|
|
29910 |
codeforces#P1109B
Sasha and One More Name
|
0 / 0 |
6 |
|
|
15686 |
loj#P2416
「NOIP2008」双栈排序
|
1 / 2 |
10 |
|
|
29358 |
codeforces#P1000A
Codehorses T-shirts
|
2 / 10 |
4 |
|
|
1570 |
bzoj#P2020
[USACO2010 Jan] Buying Feed, II
|
2 / 3 |
10 |
|
|
16630 |
loj#P3482
「USACO 2021.2 Platinum」Minimizing Edges
|
0 / 0 |
(无) |
|
|
27205 |
codeforces#P492B
Vanya and Lanterns
|
0 / 0 |
4 |
|
|
16685 |
loj#P3545
「CSP-S 2021」交通规划
|
0 / 0 |
(无) |
|
|
31049 |
codeforces#P1336C
Kaavi and Magic Spell
|
0 / 0 |
8 |
|
|
24904 |
spoj#VFMUL
Very Fast Multiplication
|
0 / 0 |
(无) |
|
|
27929 |
codeforces#P671B
Robin Hood
|
1 / 1 |
7 |
|
|
25446 |
codeforces#P71E
Nuclear Fusion
|
0 / 0 |
8 |
|
|
16439 |
loj#P3247
「USACO 2020.1 Platinum」Non-Decreasing Subsequences
|
0 / 0 |
(无) |
|
|
27088 |
codeforces#P464B
Restore Cube
|
0 / 0 |
7 |
|
|
23722 |
spoj#ONTIME
Just on Time
|
0 / 0 |
(无) |
