|
31373 |
codeforces#P1394D
Boboniu and Jianghu
|
0 / 0 |
10 |
|
31377 |
codeforces#P1395C
Boboniu and Bit Operations
|
0 / 0 |
5 |
|
31380 |
codeforces#P1396C
Monster Invaders
|
0 / 0 |
8 |
|
31387 |
codeforces#P1398C
Good Subarrays
|
0 / 0 |
5 |
|
31388 |
codeforces#P1398D
Colored Rectangles
|
0 / 0 |
6 |
|
31390 |
codeforces#P1398F
Controversial Rounds
|
0 / 0 |
9 |
|
31398 |
codeforces#P1399F
Yet Another Segments Subset
|
0 / 0 |
8 |
|
31403 |
codeforces#P1400E
Clear the Multiset
|
0 / 0 |
8 |
|
31404 |
codeforces#P1400F
x-prime Substrings
|
0 / 0 |
10 |
|
31405 |
codeforces#P1400G
Mercenaries
|
0 / 0 |
10 |
|
31409 |
codeforces#P1401D
Maximum Distributed Tree
|
0 / 0 |
6 |
|
31414 |
codeforces#P1402C
Star Trek
|
0 / 0 |
10 |
|
31417 |
codeforces#P1403C
Chess Rush
|
0 / 0 |
10 |
|
31419 |
codeforces#P1404B
Tree Tag
|
0 / 0 |
6 |
|
31426 |
codeforces#P1406B
Maximum Product
|
0 / 0 |
4 |
|
31433 |
codeforces#P1407D
Discrete Centrifugal Jumps
|
1 / 4 |
8 |
|
31434 |
codeforces#P1407E
Egor in the Republic of Dagestan
|
1 / 3 |
9 |
|
31437 |
codeforces#P1408C
Discrete Acceleration
|
0 / 0 |
5 |
|
31438 |
codeforces#P1408D
Searchlights
|
0 / 0 |
7 |
|
31441 |
codeforces#P1408G
Clusterization Counting
|
0 / 0 |
10 |
|
31443 |
codeforces#P1408I
Bitwise Magic
|
0 / 0 |
10 |
|
31448 |
codeforces#P1409E
Two Platforms
|
0 / 0 |
6 |
|
31449 |
codeforces#P1409F
Subsequences of Length Two
|
0 / 0 |
7 |
|
31459 |
codeforces#P1413C
Perform Easily
|
0 / 0 |
6 |
|
31465 |
codeforces#P1415C
Bouncing Ball
|
0 / 0 |
4 |
|
31468 |
codeforces#P1415F
Cakes for Clones
|
0 / 0 |
10 |
|
31471 |
codeforces#P1416C
XOR Inverse
|
0 / 0 |
7 |
|
31473 |
codeforces#P1416E
Split
|
0 / 0 |
10 |
|
31479 |
codeforces#P1418C
Mortal Kombat Tower
|
0 / 0 |
5 |
|
31493 |
codeforces#P1420C1
Pokémon Army (easy version)
|
0 / 0 |
4 |
|
31494 |
codeforces#P1420C2
Pokémon Army (hard version)
|
0 / 0 |
7 |
|
31496 |
codeforces#P1420E
Battle Lemmings
|
0 / 0 |
9 |
|
31501 |
codeforces#P1421E
Swedish Heroes
|
0 / 0 |
10 |
|
31504 |
codeforces#P1422C
Bargain
|
0 / 0 |
5 |
|
31506 |
codeforces#P1422E
Minlexes
|
0 / 0 |
10 |
|
31517 |
codeforces#P1423J
Bubble Cup hypothesis
|
0 / 0 |
9 |
|
31525 |
codeforces#P1425B
Blue and Red of Our Faculty!
|
0 / 0 |
10 |
|
31527 |
codeforces#P1425D
Danger of Mad Snakes
|
0 / 0 |
8 |
|
31537 |
codeforces#P1426F
Number of Subsequences
|
0 / 0 |
7 |
|
31540 |
codeforces#P1427C
The Hard Work of Paparazzi
|
0 / 0 |
7 |
|
31551 |
codeforces#P1428F
Fruit Sequences
|
0 / 0 |
9 |
|
31552 |
codeforces#P1428G1
Lucky Numbers (Easy Version)
|
0 / 0 |
10 |
|
31553 |
codeforces#P1428G2
Lucky Numbers (Hard Version)
|
0 / 0 |
10 |
|
31560 |
codeforces#P1430F
Realistic Gameplay
|
0 / 0 |
10 |
|
31561 |
codeforces#P1430G
Yet Another DAG Problem
|
0 / 0 |
10 |
|
31568 |
codeforces#P1431G
Number Deletion Game
|
0 / 0 |
7 |
|
31571 |
codeforces#P1431J
Zero-XOR Array
|
0 / 0 |
10 |
|
31577 |
codeforces#P1433F
Zero Remainder Sum
|
0 / 0 |
7 |
|
31588 |
codeforces#P1437C
Chef Monocarp
|
1 / 1 |
6 |
|
31590 |
codeforces#P1437E
Make It Increasing
|
1 / 1 |
8 |