|
|
9307 |
codeforces#P1919A Wallet Exchange
|
1 / 1 |
3 |
|
|
9306 |
codeforces#P1919B Plus-Minus Split
|
1 / 1 |
3 |
|
|
9305 |
codeforces#P1919C Grouping Increases
|
2 / 2 |
4 |
|
|
9304 |
codeforces#P1919D 01 Tree
|
1 / 2 |
7 |
|
|
9303 |
codeforces#P1919E Counting Prefixes
|
1 / 7 |
10 |
|
|
9302 |
codeforces#P1919F1 Wine Factory (Easy Version)
|
1 / 3 |
8 |
|
|
9301 |
codeforces#P1919F2 Wine Factory (Hard Version)
|
1 / 2 |
10 |
|
|
9300 |
codeforces#P1919G Tree LGM
|
0 / 0 |
10 |
|
|
9299 |
codeforces#P1919H Tree Diameter
|
0 / 0 |
10 |
|
|
9321 |
codeforces#P1920A Satisfying Constraints
|
1 / 1 |
3 |
|
|
9320 |
codeforces#P1920B Summation Game
|
1 / 1 |
3 |
|
|
9319 |
codeforces#P1920C Partitioning the Array
|
1 / 2 |
5 |
|
|
9318 |
codeforces#P1920D Array Repetition
|
1 / 2 |
6 |
|
|
9317 |
codeforces#P1920E Counting Binary Strings
|
1 / 1 |
7 |
|
|
9316 |
codeforces#P1920F1 Smooth Sailing (Easy Version)
|
1 / 1 |
9 |
|
|
9315 |
codeforces#P1920F2 Smooth Sailing (Hard Version)
|
0 / 0 |
10 |
|
|
9314 |
codeforces#P1921A Square
|
1 / 1 |
10 |
|
|
9313 |
codeforces#P1921B Arranging Cats
|
1 / 1 |
10 |
|
|
9312 |
codeforces#P1921C Sending Messages
|
1 / 1 |
10 |
|
|
9311 |
codeforces#P1921D Very Different Array
|
1 / 1 |
10 |
|
|
9310 |
codeforces#P1921E Eat the Chip
|
1 / 1 |
10 |
|
|
9309 |
codeforces#P1921F Sum of Progression
|
1 / 1 |
10 |
|
|
9308 |
codeforces#P1921G Mischievous Shooter
|
0 / 0 |
(无) |
|
|
9327 |
codeforces#P1922A Tricky Template
|
1 / 1 |
10 |
|
|
9326 |
codeforces#P1922B Forming Triangles
|
1 / 1 |
10 |
|
|
9325 |
codeforces#P1922C Closest Cities
|
1 / 1 |
10 |
|
|
9324 |
codeforces#P1922D Berserk Monsters
|
0 / 0 |
(无) |
|
|
9323 |
codeforces#P1922E Increasing Subsequences
|
0 / 0 |
(无) |
|
|
9322 |
codeforces#P1922F Replace on Segment
|
1 / 1 |
10 |
|
|
9399 |
codeforces#P1923A Moving Chips
|
0 / 0 |
(无) |
|
|
9398 |
codeforces#P1923B Monsters Attack!
|
0 / 0 |
(无) |
|
|
9397 |
codeforces#P1923C Find B
|
0 / 0 |
(无) |
|
|
9396 |
codeforces#P1923D Slimes
|
0 / 0 |
(无) |
|
|
9395 |
codeforces#P1923E Count Paths
|
0 / 0 |
(无) |
|
|
9394 |
codeforces#P1923F Shrink-Reverse
|
0 / 0 |
(无) |
|
|
9336 |
codeforces#P1924A Did We Get Everything Covered?
|
1 / 3 |
10 |
|
|
9335 |
codeforces#P1924B Space Harbour
|
0 / 6 |
10 |
|
|
9334 |
codeforces#P1924C Fractal Origami
|
1 / 1 |
10 |
|
|
9333 |
codeforces#P1924D Balanced Subsequences
|
2 / 2 |
10 |
|
|
9332 |
codeforces#P1924E Paper Cutting Again
|
3 / 6 |
10 |
|
|
9331 |
codeforces#P1924F Anti-Proxy Attendance
|
0 / 0 |
(无) |
|
|
9330 |
codeforces#P1925A We Got Everything Covered!
|
0 / 0 |
(无) |
|
|
9329 |
codeforces#P1925B A Balanced Problemset?
|
0 / 0 |
(无) |
|
|
9328 |
codeforces#P1925D Good Trip
|
0 / 0 |
(无) |
|
|
9393 |
codeforces#P1926A Vlad and the Best of Five
|
0 / 0 |
(无) |
|
|
9392 |
codeforces#P1926B Vlad and Shapes
|
0 / 0 |
(无) |
|
|
9391 |
codeforces#P1926C Vlad and a Sum of Sum of Digits
|
0 / 0 |
(无) |
|
|
9390 |
codeforces#P1926D Vlad and Division
|
0 / 0 |
(无) |
|
|
9389 |
codeforces#P1926E Vlad and an Odd Ordering
|
0 / 0 |
(无) |
|
|
9388 |
codeforces#P1926F Vlad and Avoiding X
|
0 / 0 |
(无) |
