|
|
31853 |
codeforces#P1491E
Fib-tree
|
0 / 0 |
9 |
|
|
31857 |
codeforces#P1491I
Ruler Of The Zoo
|
0 / 0 |
10 |
|
|
31862 |
codeforces#P1492E
Almost Fault-Tolerant Database
|
0 / 0 |
9 |
|
|
31864 |
codeforces#P1493B
Planet Lapituletti
|
0 / 0 |
4 |
|
|
31865 |
codeforces#P1493C
K-beautiful Strings
|
0 / 0 |
7 |
|
|
31866 |
codeforces#P1493D
GCD of an Array
|
1 / 1 |
7 |
|
|
31869 |
codeforces#P1494A
ABC String
|
1 / 1 |
3 |
|
|
31870 |
codeforces#P1494B
Berland Crossword
|
0 / 0 |
4 |
|
|
31874 |
codeforces#P1494F
Delete The Edges
|
0 / 0 |
10 |
|
|
31879 |
codeforces#P1495E
Qingshan and Daniel
|
0 / 0 |
10 |
|
|
31881 |
codeforces#P1496A
Split it!
|
1 / 1 |
3 |
|
|
31883 |
codeforces#P1497A
Meximization
|
1 / 1 |
3 |
|
|
31890 |
codeforces#P1498A
GCD Sum
|
0 / 0 |
3 |
|
|
31892 |
codeforces#P1498C
Planar Reflections
|
0 / 0 |
5 |
|
|
31894 |
codeforces#P1498E
Two Houses
|
0 / 0 |
8 |
|
|
31897 |
codeforces#P1499B
Binary Removals
|
0 / 0 |
3 |
|
|
31898 |
codeforces#P1499C
Minimum Grid Path
|
0 / 0 |
5 |
|
|
31903 |
codeforces#P1500A
Going Home
|
0 / 0 |
6 |
|
|
31904 |
codeforces#P1500B
Two chandeliers
|
0 / 0 |
8 |
|
|
31905 |
codeforces#P1500C
Matrix Sorting
|
0 / 0 |
10 |
|
|
31930 |
codeforces#P1506C
Double-ended Strings
|
0 / 0 |
3 |
|
|
31934 |
codeforces#P1506G
Maximize the Remaining String
|
0 / 0 |
7 |
|
|
31937 |
codeforces#P1508C
Complete the MST
|
0 / 0 |
9 |
|
|
31939 |
codeforces#P1508E
Tree Calendar
|
0 / 0 |
10 |
|
|
31940 |
codeforces#P1508F
Optimal Encoding
|
0 / 0 |
10 |
|
|
31954 |
codeforces#P1510K
King's Task
|
0 / 0 |
4 |
|
|
31957 |
codeforces#P1511C
Yet Another Card Deck
|
0 / 0 |
3 |
|
|
31958 |
codeforces#P1511D
Min Cost String
|
0 / 0 |
5 |
|
|
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 |
|
|
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 |
|
|
31980 |
codeforces#P1513F
Swapping Problem
|
0 / 0 |
9 |
|
|
31981 |
codeforces#P1513F
Swapping Problem
|
0 / 0 |
9 |
|
|
31995 |
codeforces#P1515B
Phoenix and Puzzle
|
0 / 0 |
3 |
|
|
31996 |
codeforces#P1515B
Phoenix and Puzzle
|
0 / 0 |
3 |
|
|
32010 |
codeforces#P1515H
Phoenix and Bits
|
0 / 0 |
10 |
|
|
32011 |
codeforces#P1515H
Phoenix and Bits
|
0 / 0 |
10 |
|
|
32012 |
codeforces#P1515H
Phoenix and Bits
|
0 / 0 |
10 |
|
|
32019 |
codeforces#P1516B
AGAGA XOOORRR
|
0 / 0 |
5 |
|
|
32020 |
codeforces#P1516B
AGAGA XOOORRR
|
0 / 0 |
5 |
|
|
32021 |
codeforces#P1516B
AGAGA XOOORRR
|
0 / 0 |
5 |
|
|
32053 |
codeforces#P1519C
Berland Regional
|
0 / 0 |
4 |
|
|
32054 |
codeforces#P1519C
Berland Regional
|
0 / 0 |
4 |
|
|
32055 |
codeforces#P1519D
Maximum Sum of Products
|
0 / 0 |
5 |
|
|
32058 |
codeforces#P1519F
Chests and Keys
|
0 / 0 |
10 |
|
|
32059 |
codeforces#P1520A
Do Not Be Distracted!
|
0 / 0 |
3 |
