|
|
812 |
codeforces#P1389G Directing Edges
|
0 / 0 |
10 |
|
|
809 |
codeforces#P1391C Cyclic Permutations
|
0 / 0 |
5 |
|
|
807 |
codeforces#P1391E Pairs of Pairs
|
4 / 6 |
10 |
|
|
798 |
codeforces#P1392I Kevin and Grid
|
0 / 0 |
10 |
|
|
790 |
codeforces#P1394B Boboniu Walks on Graph
|
0 / 0 |
8 |
|
|
763 |
codeforces#P1399F Yet Another Segments Subset
|
0 / 0 |
8 |
|
|
747 |
codeforces#P1402C Star Trek
|
0 / 0 |
10 |
|
|
746 |
codeforces#P1403A The Potion of Great Power
|
0 / 0 |
9 |
|
|
745 |
codeforces#P1403B Spring cleaning
|
0 / 0 |
8 |
|
|
739 |
codeforces#P1404E Bricks
|
0 / 5 |
10 |
|
|
734 |
codeforces#P1406C Link Cut Centroids
|
0 / 0 |
5 |
|
|
728 |
codeforces#P1407D Discrete Centrifugal Jumps
|
1 / 4 |
8 |
|
|
727 |
codeforces#P1407E Egor in the Republic of Dagestan
|
1 / 3 |
9 |
|
|
722 |
codeforces#P1408E Avoid Rainbow Cycles
|
0 / 0 |
9 |
|
|
720 |
codeforces#P1408G Clusterization Counting
|
0 / 0 |
10 |
|
|
709 |
codeforces#P1411C Peaceful Rooks
|
0 / 0 |
5 |
|
|
689 |
codeforces#P1416D Graph and Queries
|
1 / 1 |
10 |
|
|
682 |
codeforces#P1418C Mortal Kombat Tower
|
0 / 0 |
5 |
|
|
671 |
codeforces#P1419F Rain of Fire
|
0 / 0 |
10 |
|
|
656 |
codeforces#P1422D Returning Home
|
0 / 0 |
8 |
|
|
652 |
codeforces#P1423B Valuable Paper
|
0 / 0 |
6 |
|
|
651 |
codeforces#P1423C Dušan's Railway
|
0 / 0 |
10 |
|
|
646 |
codeforces#P1423H Virus
|
0 / 0 |
9 |
|
|
638 |
codeforces#P1424M Ancient Language
|
0 / 0 |
8 |
|
|
617 |
codeforces#P1427G One Billion Shades of Grey
|
0 / 0 |
10 |
|
|
614 |
codeforces#P1428B Belted Rooms
|
0 / 0 |
4 |
|
|
600 |
codeforces#P1430G Yet Another DAG Problem
|
0 / 0 |
10 |
|
|
584 |
codeforces#P1433G Reducing Delivery Cost
|
0 / 0 |
7 |
|
|
578 |
codeforces#P1436D Bandit in a City
|
0 / 0 |
6 |
|
|
572 |
codeforces#P1437D Minimal Height Tree
|
1 / 2 |
5 |
|
|
561 |
codeforces#P1439A2 Binary Table (Hard Version)
|
0 / 0 |
6 |
|
|
560 |
codeforces#P1439B Graph Subset Problem
|
0 / 0 |
10 |
|
|
552 |
codeforces#P1442C Graph Transpositions
|
0 / 0 |
9 |
|
|
542 |
codeforces#P1444C Team-Building
|
1 / 3 |
9 |
|
|
523 |
codeforces#P1450E Capitalism
|
0 / 0 |
10 |
|
|
494 |
codeforces#P1454E Number of Simple Paths
|
0 / 0 |
7 |
|
|
481 |
codeforces#P1458D Flip and Reverse
|
1 / 1 |
10 |
|
|
472 |
codeforces#P1461E Water Level
|
0 / 0 |
8 |
|
|
459 |
codeforces#P1463E Plan of Lectures
|
0 / 0 |
9 |
|
|
451 |
codeforces#P1466F Euclid's nightmare
|
0 / 0 |
7 |
|
|
449 |
codeforces#P1466H Finding satisfactory solutions
|
0 / 0 |
10 |
|
|
433 |
codeforces#P1468J Road Reform
|
0 / 0 |
6 |
|
|
430 |
codeforces#P1468M Similar Sets
|
0 / 0 |
8 |
|
|
421 |
codeforces#P1470B Strange Definition
|
0 / 0 |
6 |
|
|
418 |
codeforces#P1470D Strange Housing
|
1 / 1 |
8 |
|
|
419 |
codeforces#P1470E Strange Permutation
|
0 / 1 |
10 |
|
|
413 |
codeforces#P1472C Long Jumps
|
0 / 0 |
3 |
|
|
408 |
codeforces#P1472G Moving to the Capital
|
0 / 0 |
7 |
|
|
402 |
codeforces#P1473E Minimum Path
|
0 / 1 |
9 |
|
|
392 |
codeforces#P1475C Ball in Berland
|
0 / 1 |
4 |
