|
30524 |
codeforces#P1227A
Math Problem
|
0 / 0 |
3 |
|
30525 |
codeforces#P1227B
Box
|
0 / 0 |
4 |
|
30526 |
codeforces#P1227C
Messy
|
0 / 0 |
5 |
|
30527 |
codeforces#P1227D1
Optimal Subsequences (Easy Version)
|
0 / 0 |
5 |
|
30528 |
codeforces#P1227D2
Optimal Subsequences (Hard Version)
|
0 / 0 |
6 |
|
30529 |
codeforces#P1227E
Arson In Berland Forest
|
0 / 0 |
8 |
|
30530 |
codeforces#P1227F1
Wrong Answer on test 233 (Easy Version)
|
0 / 0 |
8 |
|
30531 |
codeforces#P1227F2
Wrong Answer on test 233 (Hard Version)
|
0 / 0 |
9 |
|
30532 |
codeforces#P1227G
Not Same
|
0 / 0 |
10 |
|
30533 |
codeforces#P1228A
Distinct Digits
|
1 / 1 |
3 |
|
30534 |
codeforces#P1228B
Filling the Grid
|
0 / 0 |
4 |
|
30535 |
codeforces#P1228C
Primes and Multiplication
|
0 / 0 |
5 |
|
30536 |
codeforces#P1228D
Complete Tripartite
|
0 / 0 |
6 |
|
30537 |
codeforces#P1228E
Another Filling the Grid
|
0 / 0 |
8 |
|
30538 |
codeforces#P1228F
One Node is Gone
|
0 / 0 |
9 |
|
30539 |
codeforces#P1230A
Dawid and Bags of Candies
|
1 / 1 |
3 |
|
30540 |
codeforces#P1230B
Ania and Minimizing
|
0 / 0 |
3 |
|
30541 |
codeforces#P1231C
Increasing Matrix
|
0 / 0 |
3 |
|
30542 |
codeforces#P1231E
Middle-Out
|
0 / 0 |
8 |
|
30543 |
codeforces#P1234A
Equalize Prices Again
|
1 / 1 |
3 |
|
30544 |
codeforces#P1234B1
Social Network (easy version)
|
0 / 0 |
3 |
|
30545 |
codeforces#P1234B2
Social Network (hard version)
|
0 / 0 |
4 |
|
30546 |
codeforces#P1234C
Pipes
|
0 / 0 |
5 |
|
30547 |
codeforces#P1234D
Distinct Characters Queries
|
0 / 0 |
5 |
|
30548 |
codeforces#P1234E
Special Permutations
|
0 / 0 |
7 |
|
30549 |
codeforces#P1234F
Yet Another Substring Reverse
|
0 / 0 |
8 |
|
30550 |
codeforces#P1236A
Stones
|
1 / 1 |
3 |
|
30551 |
codeforces#P1236B
Alice and the List of Presents
|
0 / 0 |
5 |
|
30552 |
codeforces#P1236C
Labs
|
0 / 0 |
4 |
|
30553 |
codeforces#P1236D
Alice and the Doll
|
0 / 0 |
8 |
|
30554 |
codeforces#P1236E
Alice and the Unfair Game
|
0 / 0 |
9 |
|
30555 |
codeforces#P1236F
Alice and the Cactus
|
0 / 0 |
10 |
|
30556 |
codeforces#P1237A
Balanced Rating Changes
|
0 / 0 |
3 |
|
30557 |
codeforces#P1237B
Balanced Tunnel
|
0 / 0 |
4 |
|
30558 |
codeforces#P1237C1
Balanced Removals (Easier)
|
0 / 0 |
5 |
|
30559 |
codeforces#P1237C2
Balanced Removals (Harder)
|
0 / 0 |
6 |
|
30560 |
codeforces#P1237D
Balanced Playlist
|
0 / 0 |
7 |
|
30561 |
codeforces#P1237E
Balanced Binary Search Trees
|
0 / 0 |
9 |
|
30562 |
codeforces#P1237F
Balanced Domino Placements
|
0 / 0 |
10 |
|
30563 |
codeforces#P1237G
Balanced Distribution
|
0 / 0 |
10 |
|
30564 |
codeforces#P1237H
Balanced Reversals
|
1 / 1 |
10 |
|
30565 |
codeforces#P1238A
Prime Subtraction
|
1 / 1 |
3 |
|
30566 |
codeforces#P1238B
Kill 'Em All
|
0 / 0 |
4 |
|
30567 |
codeforces#P1238C
Standard Free2play
|
0 / 0 |
5 |
|
30568 |
codeforces#P1238D
AB-string
|
0 / 0 |
6 |
|
30569 |
codeforces#P1238E
Keyboard Purchase
|
0 / 0 |
8 |
|
30570 |
codeforces#P1238F
The Maximum Subtree
|
0 / 0 |
8 |
|
30571 |
codeforces#P1238G
Adilbek and the Watering System
|
0 / 0 |
10 |
|
30572 |
codeforces#P1239A
Ivan the Fool and the Probability Theory
|
0 / 0 |
5 |
|
30573 |
codeforces#P1239B
The World Is Just a Programming Task (Hard Version)
|
0 / 0 |
9 |