|
|
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 |
(无) |
|
|
34380 |
codeforces#P1925D
Good Trip
|
1 / 1 |
10 |
|
|
34381 |
codeforces#P1926A
Vlad and the Best of Five
|
0 / 0 |
(无) |
|
|
34382 |
codeforces#P1926B
Vlad and Shapes
|
0 / 1 |
10 |
|
|
34383 |
codeforces#P1926C
Vlad and a Sum of Sum of Digits
|
0 / 0 |
(无) |
|
|
34384 |
codeforces#P1926D
Vlad and Division
|
0 / 0 |
(无) |
|
|
34385 |
codeforces#P1926E
Vlad and an Odd Ordering
|
0 / 0 |
(无) |
|
|
34386 |
codeforces#P1926F
Vlad and Avoiding X
|
0 / 0 |
(无) |
|
|
34387 |
codeforces#P1926G
Vlad and Trouble at MIT
|
0 / 0 |
(无) |
|
|
34388 |
codeforces#P1927A
Make it White
|
1 / 1 |
3 |
|
|
34389 |
codeforces#P1927B
Following the String
|
1 / 1 |
3 |
|
|
34390 |
codeforces#P1927C
Choose the Different Ones!
|
1 / 1 |
3 |
|
|
34391 |
codeforces#P1927D
Find the Different Ones!
|
1 / 2 |
4 |
|
|
34392 |
codeforces#P1927E
Klever Permutation
|
0 / 0 |
4 |
|
|
34393 |
codeforces#P1927F
Microcycle
|
0 / 0 |
6 |
|
|
34394 |
codeforces#P1927G
Paint Charges
|
0 / 0 |
8 |
|
|
34395 |
codeforces#P1928A
Rectangle Cutting
|
0 / 0 |
3 |
|
|
34396 |
codeforces#P1928B
Equalize
|
0 / 0 |
4 |
|
|
34397 |
codeforces#P1928C
Physical Education Lesson
|
0 / 0 |
5 |
|
|
34398 |
codeforces#P1928D
Lonely Mountain Dungeons
|
0 / 0 |
6 |
|
|
34399 |
codeforces#P1928E
Modular Sequence
|
0 / 0 |
8 |
|
|
34400 |
codeforces#P1928F
Digital Patterns
|
0 / 0 |
10 |
|
|
34401 |
codeforces#P1929A
Sasha and the Beautiful Array
|
0 / 0 |
3 |
|
|
34402 |
codeforces#P1929B
Sasha and the Drawing
|
0 / 0 |
3 |
|
|
34403 |
codeforces#P1929C
Sasha and the Casino
|
0 / 0 |
4 |
|
|
34404 |
codeforces#P1929D
Sasha and a Walk in the City
|
0 / 0 |
6 |
|
|
34405 |
codeforces#P1929E
Sasha and the Happy Tree Cutting
|
0 / 0 |
8 |
|
|
34406 |
codeforces#P1929F
Sasha and the Wedding Binary Search Tree
|
0 / 0 |
8 |
|
|
34407 |
codeforces#P1930A
Maximise The Score
|
0 / 0 |
(无) |
|
|
34408 |
codeforces#P1930B
Permutation Printing
|
0 / 0 |
(无) |
|
|
34409 |
codeforces#P1930C
Lexicographically Largest
|
0 / 0 |
(无) |
|
|
34410 |
codeforces#P1930D1
Sum over all Substrings (Easy Version)
|
0 / 0 |
(无) |
|
|
34411 |
codeforces#P1930D2
Sum over all Substrings (Hard Version)
|
0 / 0 |
(无) |
|
|
34412 |
codeforces#P1930E
2..3...4...
|
0 / 0 |
(无) |
|
|
34413 |
codeforces#P1930F
Maximize the Difference
|
0 / 0 |
(无) |
|
|
34414 |
codeforces#P1930G
Prefix Max Set Counting
|
0 / 0 |
(无) |
|
|
34415 |
codeforces#P1930H
Interactive Mex Tree
|
0 / 0 |
(无) |
|
|
34416 |
codeforces#P1930I
Counting Is Fun
|
0 / 0 |
(无) |
|
|
34417 |
codeforces#P1931A
Recovering a Small String
|
0 / 0 |
3 |
|
|
34418 |
codeforces#P1931B
Make Equal
|
1 / 1 |
3 |
|
|
34419 |
codeforces#P1931C
Make Equal Again
|
1 / 1 |
3 |
|
|
34420 |
codeforces#P1931D
Divisible Pairs
|
1 / 1 |
4 |
|
|
34421 |
codeforces#P1931E
Anna and the Valentine's Day Gift
|
1 / 1 |
4 |
|
|
34422 |
codeforces#P1931F
Chat Screenshots
|
1 / 1 |
5 |
|
|
34423 |
codeforces#P1931G
One-Dimensional Puzzle
|
1 / 1 |
7 |
