|
|
31349 |
codeforces#P1389G
Directing Edges
|
0 / 0 |
10 |
|
|
31352 |
codeforces#P1391C
Cyclic Permutations
|
0 / 0 |
5 |
|
|
31354 |
codeforces#P1391E
Pairs of Pairs
|
4 / 6 |
10 |
|
|
31363 |
codeforces#P1392I
Kevin and Grid
|
0 / 0 |
10 |
|
|
31371 |
codeforces#P1394B
Boboniu Walks on Graph
|
0 / 0 |
8 |
|
|
31398 |
codeforces#P1399F
Yet Another Segments Subset
|
0 / 0 |
8 |
|
|
31414 |
codeforces#P1402C
Star Trek
|
0 / 0 |
10 |
|
|
31415 |
codeforces#P1403A
The Potion of Great Power
|
0 / 0 |
9 |
|
|
31416 |
codeforces#P1403B
Spring cleaning
|
0 / 0 |
8 |
|
|
31422 |
codeforces#P1404E
Bricks
|
0 / 5 |
10 |
|
|
31427 |
codeforces#P1406C
Link Cut Centroids
|
0 / 0 |
5 |
|
|
31433 |
codeforces#P1407D
Discrete Centrifugal Jumps
|
1 / 4 |
8 |
|
|
31434 |
codeforces#P1407E
Egor in the Republic of Dagestan
|
1 / 3 |
9 |
|
|
31439 |
codeforces#P1408E
Avoid Rainbow Cycles
|
0 / 0 |
9 |
|
|
31441 |
codeforces#P1408G
Clusterization Counting
|
0 / 0 |
10 |
|
|
31452 |
codeforces#P1411C
Peaceful Rooks
|
0 / 0 |
5 |
|
|
31472 |
codeforces#P1416D
Graph and Queries
|
1 / 1 |
10 |
|
|
31479 |
codeforces#P1418C
Mortal Kombat Tower
|
0 / 0 |
5 |
|
|
31490 |
codeforces#P1419F
Rain of Fire
|
0 / 0 |
10 |
|
|
31505 |
codeforces#P1422D
Returning Home
|
0 / 0 |
8 |
|
|
31509 |
codeforces#P1423B
Valuable Paper
|
0 / 0 |
6 |
|
|
31510 |
codeforces#P1423C
Dušan's Railway
|
0 / 0 |
10 |
|
|
31515 |
codeforces#P1423H
Virus
|
0 / 0 |
9 |
|
|
31523 |
codeforces#P1424M
Ancient Language
|
0 / 0 |
8 |
|
|
31544 |
codeforces#P1427G
One Billion Shades of Grey
|
0 / 0 |
10 |
|
|
31547 |
codeforces#P1428B
Belted Rooms
|
0 / 0 |
4 |
|
|
31561 |
codeforces#P1430G
Yet Another DAG Problem
|
0 / 0 |
10 |
|
|
31578 |
codeforces#P1433G
Reducing Delivery Cost
|
0 / 0 |
7 |
|
|
31583 |
codeforces#P1436D
Bandit in a City
|
0 / 0 |
6 |
|
|
31589 |
codeforces#P1437D
Minimal Height Tree
|
1 / 2 |
5 |
|
|
31600 |
codeforces#P1439A2
Binary Table (Hard Version)
|
1 / 1 |
6 |
|
|
31601 |
codeforces#P1439B
Graph Subset Problem
|
0 / 0 |
10 |
|
|
31609 |
codeforces#P1442C
Graph Transpositions
|
0 / 0 |
9 |
|
|
31619 |
codeforces#P1444C
Team-Building
|
1 / 3 |
9 |
|
|
31638 |
codeforces#P1450E
Capitalism
|
0 / 0 |
10 |
|
|
31667 |
codeforces#P1454E
Number of Simple Paths
|
0 / 0 |
7 |
|
|
31680 |
codeforces#P1458D
Flip and Reverse
|
1 / 1 |
10 |
|
|
31689 |
codeforces#P1461E
Water Level
|
0 / 0 |
8 |
|
|
31702 |
codeforces#P1463E
Plan of Lectures
|
0 / 0 |
9 |
|
|
31710 |
codeforces#P1466F
Euclid's nightmare
|
0 / 0 |
7 |
|
|
31712 |
codeforces#P1466H
Finding satisfactory solutions
|
0 / 0 |
10 |
|
|
31728 |
codeforces#P1468J
Road Reform
|
0 / 0 |
6 |
|
|
31731 |
codeforces#P1468M
Similar Sets
|
0 / 0 |
8 |
|
|
31740 |
codeforces#P1470B
Strange Definition
|
0 / 0 |
6 |
|
|
31742 |
codeforces#P1470D
Strange Housing
|
1 / 1 |
8 |
|
|
31743 |
codeforces#P1470E
Strange Permutation
|
0 / 1 |
10 |
|
|
31749 |
codeforces#P1472C
Long Jumps
|
0 / 0 |
3 |
|
|
31753 |
codeforces#P1472G
Moving to the Capital
|
0 / 0 |
7 |
|
|
31758 |
codeforces#P1473E
Minimum Path
|
0 / 1 |
9 |
|
|
31769 |
codeforces#P1475C
Ball in Berland
|
0 / 1 |
4 |
