|
31580 |
codeforces#P1436A
Reorder
|
1 / 1 |
3 |
|
31581 |
codeforces#P1436B
Prime Square
|
0 / 0 |
3 |
|
31582 |
codeforces#P1436C
Binary Search
|
0 / 0 |
5 |
|
31583 |
codeforces#P1436D
Bandit in a City
|
0 / 0 |
6 |
|
31584 |
codeforces#P1436E
Complicated Computations
|
0 / 0 |
9 |
|
31585 |
codeforces#P1436F
Sum Over Subsets
|
0 / 0 |
10 |
|
31586 |
codeforces#P1437A
Marketing Scheme
|
1 / 1 |
3 |
|
31587 |
codeforces#P1437B
Reverse Binary Strings
|
1 / 1 |
4 |
|
31588 |
codeforces#P1437C
Chef Monocarp
|
1 / 1 |
6 |
|
31589 |
codeforces#P1437D
Minimal Height Tree
|
1 / 2 |
5 |
|
31590 |
codeforces#P1437E
Make It Increasing
|
1 / 1 |
8 |
|
31591 |
codeforces#P1437F
Emotional Fishermen
|
2 / 2 |
10 |
|
31592 |
codeforces#P1437G
Death DBMS
|
0 / 0 |
10 |
|
31593 |
codeforces#P1438A
Specific Tastes of Andre
|
1 / 1 |
3 |
|
31594 |
codeforces#P1438B
Valerii Against Everyone
|
0 / 0 |
3 |
|
31595 |
codeforces#P1438C
Engineer Artem
|
1 / 1 |
7 |
|
31596 |
codeforces#P1438D
Powerful Ksenia
|
1 / 1 |
8 |
|
31597 |
codeforces#P1438E
Yurii Can Do Everything
|
0 / 0 |
9 |
|
31598 |
codeforces#P1438F
Olha and Igor
|
0 / 0 |
10 |
|
31599 |
codeforces#P1439A1
Binary Table (Easy Version)
|
1 / 1 |
5 |
|
31600 |
codeforces#P1439A2
Binary Table (Hard Version)
|
1 / 1 |
6 |
|
31601 |
codeforces#P1439B
Graph Subset Problem
|
0 / 0 |
10 |
|
31602 |
codeforces#P1439C
Greedy Shopping
|
0 / 0 |
10 |
|
31603 |
codeforces#P1439D
INOI Final Contests
|
0 / 0 |
10 |
|
31604 |
codeforces#P1439E
Cheat and Win
|
0 / 0 |
10 |
|
31605 |
codeforces#P1440A
Buy the String
|
0 / 0 |
3 |
|
31606 |
codeforces#P1440B
Sum of Medians
|
0 / 0 |
3 |
|
31607 |
codeforces#P1442A
Extreme Subtraction
|
1 / 3 |
6 |
|
31608 |
codeforces#P1442B
Identify the Operations
|
1 / 1 |
6 |
|
31609 |
codeforces#P1442C
Graph Transpositions
|
0 / 0 |
9 |
|
31610 |
codeforces#P1442D
Sum
|
1 / 1 |
10 |
|
31611 |
codeforces#P1442E
Black, White and Grey Tree
|
1 / 1 |
10 |
|
31612 |
codeforces#P1442F
Differentiating Games
|
0 / 0 |
10 |
|
31613 |
codeforces#P1443A
Kids Seating
|
0 / 0 |
3 |
|
31614 |
codeforces#P1443B
Saving the City
|
0 / 0 |
4 |
|
31615 |
codeforces#P1443C
The Delivery Dilemma
|
0 / 0 |
4 |
|
31616 |
codeforces#P1443E
Long Permutation
|
0 / 0 |
9 |
|
31617 |
codeforces#P1444A
Division
|
0 / 0 |
5 |
|
31618 |
codeforces#P1444B
Divide and Sum
|
0 / 0 |
6 |
|
31619 |
codeforces#P1444C
Team-Building
|
1 / 3 |
9 |
|
31620 |
codeforces#P1444D
Rectangular Polyline
|
2 / 2 |
10 |
|
31621 |
codeforces#P1444E
Finding the Vertex
|
0 / 0 |
10 |
|
31622 |
codeforces#P1445A
Array Rearrangment
|
1 / 1 |
3 |
|
31623 |
codeforces#P1445B
Elimination
|
0 / 0 |
3 |
|
31624 |
codeforces#P1446A
Knapsack
|
0 / 0 |
4 |
|
31625 |
codeforces#P1446B
Catching Cheaters
|
0 / 0 |
6 |
|
31626 |
codeforces#P1446C
Xor Tree
|
0 / 0 |
7 |
|
31627 |
codeforces#P1446D1
Frequency Problem (Easy Version)
|
2 / 2 |
10 |
|
31628 |
codeforces#P1446D2
Frequency Problem (Hard Version)
|
2 / 4 |
10 |
|
31629 |
codeforces#P1446E
Long Recovery
|
0 / 0 |
10 |