|
31930 |
codeforces#P1506C
Double-ended Strings
|
0 / 0 |
3 |
|
31931 |
codeforces#P1506D
Epic Transformation
|
0 / 0 |
4 |
|
31932 |
codeforces#P1506E
Restoring the Permutation
|
0 / 0 |
5 |
|
31933 |
codeforces#P1506F
Triangular Paths
|
0 / 0 |
7 |
|
31934 |
codeforces#P1506G
Maximize the Remaining String
|
0 / 0 |
7 |
|
31935 |
codeforces#P1508A
Binary Literature
|
0 / 0 |
6 |
|
31936 |
codeforces#P1508B
Almost Sorted
|
0 / 0 |
6 |
|
31937 |
codeforces#P1508C
Complete the MST
|
0 / 0 |
9 |
|
31938 |
codeforces#P1508D
Swap Pass
|
0 / 0 |
10 |
|
31939 |
codeforces#P1508E
Tree Calendar
|
0 / 0 |
10 |
|
31940 |
codeforces#P1508F
Optimal Encoding
|
0 / 0 |
10 |
|
31941 |
codeforces#P1509A
Average Height
|
1 / 1 |
3 |
|
31942 |
codeforces#P1509B
TMT Document
|
0 / 0 |
3 |
|
31943 |
codeforces#P1509C
The Sports Festival
|
0 / 0 |
6 |
|
31944 |
codeforces#P1510A
__NO_TITLE__
|
0 / 0 |
(无) |
|
31945 |
codeforces#P1510B
Button Lock
|
0 / 0 |
10 |
|
31946 |
codeforces#P1510C
Cactus Not Enough
|
0 / 0 |
10 |
|
31947 |
codeforces#P1510D
Digits
|
0 / 0 |
7 |
|
31948 |
codeforces#P1510E
__NO_TITLE__
|
0 / 0 |
(无) |
|
31949 |
codeforces#P1510F
Fiber Shape
|
0 / 0 |
10 |
|
31950 |
codeforces#P1510G
__NO_TITLE__
|
0 / 0 |
(无) |
|
31951 |
codeforces#P1510H
Hard Optimization
|
0 / 0 |
10 |
|
31952 |
codeforces#P1510I
Is It Rated?
|
0 / 0 |
10 |
|
31953 |
codeforces#P1510J
Japanese Game
|
0 / 0 |
10 |
|
31954 |
codeforces#P1510K
King's Task
|
0 / 0 |
4 |
|
31955 |
codeforces#P1511A
Review Site
|
1 / 1 |
3 |
|
31956 |
codeforces#P1511B
GCD Length
|
0 / 0 |
3 |
|
31957 |
codeforces#P1511C
Yet Another Card Deck
|
0 / 0 |
3 |
|
31958 |
codeforces#P1511D
Min Cost String
|
0 / 0 |
5 |
|
31959 |
codeforces#P1511E
Colorings and Dominoes
|
0 / 0 |
7 |
|
31960 |
codeforces#P1511F
Chainword
|
0 / 0 |
10 |
|
31961 |
codeforces#P1511G
Chips on a Board
|
0 / 0 |
10 |
|
31962 |
codeforces#P1512A
Spy Detected!
|
2 / 2 |
3 |
|
31963 |
codeforces#P1512B
Almost Rectangle
|
1 / 1 |
3 |
|
31964 |
codeforces#P1512C
A-B Palindrome
|
1 / 1 |
4 |
|
31965 |
codeforces#P1512D
Corrupted Array
|
1 / 1 |
4 |
|
31966 |
codeforces#P1512E
Permutation by Sum
|
1 / 1 |
5 |
|
31967 |
codeforces#P1512F
Education
|
1 / 1 |
6 |
|
31968 |
codeforces#P1512G
Short Task
|
0 / 0 |
5 |
|
31969 |
codeforces#P1512G
Short Task
|
1 / 1 |
5 |
|
31970 |
codeforces#P1513A
Array and Peaks
|
0 / 0 |
3 |
|
31971 |
codeforces#P1513B
AND Sequences
|
0 / 0 |
4 |
|
31972 |
codeforces#P1513B
AND Sequences
|
0 / 0 |
4 |
|
31973 |
codeforces#P1513C
Add One
|
1 / 4 |
5 |
|
31974 |
codeforces#P1513C
Add One
|
0 / 0 |
5 |
|
31975 |
codeforces#P1513C
Add One
|
0 / 0 |
5 |
|
31976 |
codeforces#P1513D
GCD and MST
|
0 / 0 |
7 |
|
31977 |
codeforces#P1513D
GCD and MST
|
0 / 0 |
7 |
|
31978 |
codeforces#P1513D
GCD and MST
|
0 / 0 |
7 |
|
31979 |
codeforces#P1513E
Cost Equilibrium
|
0 / 0 |
8 |