|
|
2102 |
codeforces#P1142E Pink Floyd
|
0 / 0 |
10 |
|
|
2093 |
codeforces#P1144F Graph Without Long Directed Paths
|
0 / 0 |
5 |
|
|
2082 |
codeforces#P1146C Tree Diameter
|
0 / 0 |
5 |
|
|
2078 |
codeforces#P1146G Zoning Restrictions
|
0 / 0 |
10 |
|
|
2076 |
codeforces#P1147A Hide and Seek
|
0 / 0 |
5 |
|
|
2072 |
codeforces#P1147D Palindrome XOR
|
0 / 0 |
9 |
|
|
2064 |
codeforces#P1148G Gold Experience
|
1 / 1 |
10 |
|
|
2059 |
codeforces#P1149D Abandoning Roads
|
0 / 0 |
10 |
|
|
2058 |
codeforces#P1149E Election Promises
|
0 / 0 |
10 |
|
|
2045 |
codeforces#P1152E Neko and Flashback
|
0 / 0 |
9 |
|
|
2024 |
codeforces#P1155F Delivery Oligopoly
|
0 / 0 |
10 |
|
|
2017 |
codeforces#P1156G Optimizer
|
0 / 0 |
10 |
|
|
2006 |
codeforces#P1158C Permutation recovery
|
0 / 1 |
7 |
|
|
1991 |
codeforces#P1163E Magical Permutation
|
0 / 0 |
9 |
|
|
1990 |
codeforces#P1163F Indecisive Taxi Fee
|
1 / 2 |
10 |
|
|
1977 |
codeforces#P1166F Vicky's Delivery Service
|
0 / 0 |
9 |
|
|
1975 |
codeforces#P1167C News Distribution
|
0 / 0 |
4 |
|
|
1963 |
codeforces#P1169B Pairs
|
0 / 0 |
5 |
|
|
1956 |
codeforces#P1170G Graph Decomposition
|
0 / 0 |
(无) |
|
|
1939 |
codeforces#P1174F Ehab and the Big Finale
|
0 / 0 |
9 |
|
|
1928 |
codeforces#P1176D Recover it!
|
0 / 0 |
6 |
|
|
1927 |
codeforces#P1176E Cover it!
|
0 / 0 |
5 |
|
|
1915 |
codeforces#P1178H Stock Exchange
|
1 / 5 |
10 |
|
|
1890 |
codeforces#P1183E Subsequences (easy version)
|
0 / 0 |
7 |
|
|
1882 |
codeforces#P1184B2 The Doctor Meets Vader (Medium)
|
0 / 0 |
8 |
|
|
1875 |
codeforces#P1184E1 Daleks' Invasion (easy)
|
0 / 0 |
6 |
|
|
1873 |
codeforces#P1184E2 Daleks' Invasion (medium)
|
0 / 0 |
7 |
|
|
1872 |
codeforces#P1184E3 Daleks' Invasion (hard)
|
0 / 0 |
9 |
|
|
1858 |
codeforces#P1186F Vus the Cossack and a Graph
|
0 / 0 |
9 |
|
|
1851 |
codeforces#P1187G Gang Up
|
0 / 0 |
9 |
|
|
1798 |
codeforces#P1198C Matching vs Independent Set
|
0 / 0 |
7 |
|
|
1796 |
codeforces#P1198E Rectangle Painting 2
|
0 / 0 |
9 |
|
|
1787 |
codeforces#P1200F Graph Traveler
|
0 / 0 |
8 |
|
|
1781 |
codeforces#P1201E1 Knightmare (easy)
|
1 / 1 |
10 |
|
|
1782 |
codeforces#P1201E2 Knightmare (hard)
|
1 / 2 |
10 |
|
|
1764 |
codeforces#P1204C Anna, Svyatoslav and Maps
|
0 / 0 |
5 |
|
|
1759 |
codeforces#P1205B Shortest Cycle
|
1 / 1 |
6 |
|
|
1734 |
codeforces#P1209D Cow and Snacks
|
0 / 0 |
5 |
|
|
1732 |
codeforces#P1209F Koala and Notebook
|
2 / 4 |
10 |
|
|
1727 |
codeforces#P1210A Anadi and Domino
|
0 / 0 |
5 |
|
|
1724 |
codeforces#P1210D Konrad and Company Evaluation
|
0 / 0 |
9 |
|
|
1714 |
codeforces#P1211F kotlinkotlinkotlinkotlin...
|
0 / 0 |
8 |
|
|
1711 |
codeforces#P1211I Unusual Graph
|
0 / 0 |
10 |
|
|
1704 |
codeforces#P1213F Unstable String Sort
|
0 / 0 |
7 |
|
|
1703 |
codeforces#P1213G Path Queries
|
1 / 1 |
6 |
|
|
1699 |
codeforces#P1214E Petya and Construction Set
|
0 / 0 |
7 |
|
|
1677 |
codeforces#P1217D Coloring Edges
|
1 / 2 |
7 |
|
|
1675 |
codeforces#P1217F Forced Online Queries Problem
|
0 / 0 |
10 |
|
|
1674 |
codeforces#P1218A BubbleReactor
|
0 / 0 |
10 |
|
|
1671 |
codeforces#P1218D Xor Spanning Tree
|
0 / 0 |
9 |
