|
|
34330 |
codeforces#P1918A
Brick Wall
|
1 / 1 |
10 |
|
|
34331 |
codeforces#P1918B
Minimize Inversions
|
1 / 1 |
10 |
|
|
34332 |
codeforces#P1918C
XOR-distance
|
1 / 1 |
10 |
|
|
34333 |
codeforces#P1918D
Blocking Elements
|
1 / 1 |
10 |
|
|
34334 |
codeforces#P1918E
ace5 and Task Order
|
1 / 1 |
10 |
|
|
34335 |
codeforces#P1918F
Caterpillar on a Tree
|
0 / 0 |
(无) |
|
|
34336 |
codeforces#P1918G
Permutation of Given
|
0 / 0 |
(无) |
|
|
34337 |
codeforces#P1919A
Wallet Exchange
|
1 / 1 |
3 |
|
|
34338 |
codeforces#P1919B
Plus-Minus Split
|
1 / 1 |
3 |
|
|
34339 |
codeforces#P1919C
Grouping Increases
|
2 / 2 |
4 |
|
|
34340 |
codeforces#P1919D
01 Tree
|
1 / 2 |
7 |
|
|
34341 |
codeforces#P1919E
Counting Prefixes
|
1 / 7 |
10 |
|
|
34342 |
codeforces#P1919F1
Wine Factory (Easy Version)
|
1 / 3 |
8 |
|
|
34343 |
codeforces#P1919F2
Wine Factory (Hard Version)
|
1 / 2 |
10 |
|
|
34344 |
codeforces#P1919G
Tree LGM
|
0 / 0 |
10 |
|
|
34345 |
codeforces#P1919H
Tree Diameter
|
0 / 0 |
10 |
|
|
34346 |
codeforces#P1920A
Satisfying Constraints
|
1 / 1 |
3 |
|
|
34347 |
codeforces#P1920B
Summation Game
|
1 / 1 |
3 |
|
|
34348 |
codeforces#P1920C
Partitioning the Array
|
1 / 2 |
5 |
|
|
34349 |
codeforces#P1920D
Array Repetition
|
1 / 2 |
6 |
|
|
34350 |
codeforces#P1920E
Counting Binary Strings
|
1 / 1 |
7 |
|
|
34351 |
codeforces#P1920F1
Smooth Sailing (Easy Version)
|
1 / 1 |
9 |
|
|
34352 |
codeforces#P1920F2
Smooth Sailing (Hard Version)
|
0 / 0 |
10 |
|
|
34353 |
codeforces#P1921A
Square
|
1 / 1 |
10 |
|
|
34354 |
codeforces#P1921B
Arranging Cats
|
1 / 1 |
10 |
|
|
34355 |
codeforces#P1921C
Sending Messages
|
1 / 1 |
10 |
|
|
34356 |
codeforces#P1921D
Very Different Array
|
1 / 1 |
10 |
|
|
34357 |
codeforces#P1921E
Eat the Chip
|
1 / 1 |
10 |
|
|
34358 |
codeforces#P1921F
Sum of Progression
|
1 / 1 |
10 |
|
|
34359 |
codeforces#P1921G
Mischievous Shooter
|
0 / 1 |
10 |
|
|
34360 |
codeforces#P1922A
Tricky Template
|
1 / 1 |
10 |
|
|
34361 |
codeforces#P1922B
Forming Triangles
|
1 / 1 |
10 |
|
|
34362 |
codeforces#P1922C
Closest Cities
|
1 / 1 |
10 |
|
|
34363 |
codeforces#P1922D
Berserk Monsters
|
0 / 0 |
(无) |
|
|
34364 |
codeforces#P1922E
Increasing Subsequences
|
1 / 7 |
10 |
|
|
34365 |
codeforces#P1922F
Replace on Segment
|
1 / 3 |
10 |
|
|
34366 |
codeforces#P1923A
Moving Chips
|
0 / 0 |
(无) |
|
|
34367 |
codeforces#P1923B
Monsters Attack!
|
0 / 0 |
(无) |
|
|
34368 |
codeforces#P1923C
Find B
|
0 / 0 |
(无) |
|
|
34369 |
codeforces#P1923D
Slimes
|
0 / 0 |
(无) |
|
|
34370 |
codeforces#P1923E
Count Paths
|
1 / 2 |
10 |
|
|
34371 |
codeforces#P1923F
Shrink-Reverse
|
0 / 0 |
(无) |
|
|
34372 |
codeforces#P1924A
Did We Get Everything Covered?
|
1 / 3 |
10 |
|
|
34373 |
codeforces#P1924B
Space Harbour
|
0 / 6 |
10 |
|
|
34374 |
codeforces#P1924C
Fractal Origami
|
1 / 1 |
10 |
|
|
34375 |
codeforces#P1924D
Balanced Subsequences
|
2 / 4 |
10 |
|
|
34376 |
codeforces#P1924E
Paper Cutting Again
|
3 / 6 |
10 |
|
|
34377 |
codeforces#P1924F
Anti-Proxy Attendance
|
0 / 0 |
(无) |
|
|
34378 |
codeforces#P1925A
We Got Everything Covered!
|
0 / 0 |
(无) |
|
|
34379 |
codeforces#P1925B
A Balanced Problemset?
|
0 / 0 |
(无) |
