|
2018 |
codeforces#P1156E Special Segments of Permutation
|
0 / 0 |
8 |
|
2011 |
codeforces#P1157E Minimum Array
|
1 / 5 |
5 |
|
2006 |
codeforces#P1158C Permutation recovery
|
0 / 1 |
7 |
|
1996 |
codeforces#P1163B1 Cat Party (Easy Edition)
|
1 / 2 |
5 |
|
1995 |
codeforces#P1163B2 Cat Party (Hard Edition)
|
0 / 0 |
5 |
|
1993 |
codeforces#P1163C2 Power Transmission (Hard Edition)
|
0 / 0 |
6 |
|
1991 |
codeforces#P1163E Magical Permutation
|
0 / 0 |
9 |
|
1990 |
codeforces#P1163F Indecisive Taxi Fee
|
1 / 2 |
10 |
|
1988 |
codeforces#P1165B Polycarp Training
|
0 / 1 |
3 |
|
1977 |
codeforces#P1166F Vicky's Delivery Service
|
0 / 0 |
9 |
|
1972 |
codeforces#P1167E Range Deleting
|
0 / 0 |
7 |
|
1971 |
codeforces#P1167F Scalar Queries
|
2 / 10 |
8 |
|
1959 |
codeforces#P1170D Decoding of Integer Sequences
|
0 / 0 |
(无) |
|
1947 |
codeforces#P1172E Nauuo and ODT
|
0 / 0 |
10 |
|
1948 |
codeforces#P1172F Nauuo and Bug
|
0 / 0 |
10 |
|
1937 |
codeforces#P1175B Catch Overflow!
|
0 / 0 |
5 |
|
1934 |
codeforces#P1175E Minimal Segment Cover
|
1 / 1 |
8 |
|
1933 |
codeforces#P1175F The Number of Subpermutations
|
1 / 2 |
9 |
|
1932 |
codeforces#P1175G Yet Another Partiton Problem
|
0 / 0 |
10 |
|
1916 |
codeforces#P1178G The Awesomest Vertex
|
0 / 1 |
10 |
|
1914 |
codeforces#P1179A Valeriy and Deque
|
0 / 0 |
5 |
|
1912 |
codeforces#P1179C Serge and Dining Room
|
0 / 0 |
8 |
|
1911 |
codeforces#P1179D Fedor Runs for President
|
0 / 0 |
10 |
|
1904 |
codeforces#P1181D Irrigation
|
0 / 0 |
8 |
|
1899 |
codeforces#P1182C Beautiful Lyrics
|
0 / 0 |
5 |
|
1894 |
codeforces#P1182F Maximum Sine
|
0 / 0 |
10 |
|
1879 |
codeforces#P1184C2 Heidi and the Turing Test (Medium)
|
0 / 0 |
8 |
|
1872 |
codeforces#P1184E3 Daleks' Invasion (hard)
|
0 / 0 |
9 |
|
1867 |
codeforces#P1185C2 Exam in BerSU (hard version)
|
0 / 0 |
5 |
|
1854 |
codeforces#P1187D Subarray Sorting
|
0 / 0 |
9 |
|
1842 |
codeforces#P1189C Candies!
|
0 / 0 |
4 |
|
1838 |
codeforces#P1190D Tokitsukaze and Strange Rectangle
|
0 / 0 |
7 |
|
1832 |
codeforces#P1192B Dynamic Diameter
|
1 / 2 |
10 |
|
1829 |
codeforces#P1193B Magic Tree
|
1 / 1 |
10 |
|
1823 |
codeforces#P1194E Count The Rectangles
|
0 / 0 |
8 |
|
1816 |
codeforces#P1195E OpenStreetMap
|
0 / 0 |
7 |
|
1814 |
codeforces#P1195F Geometers Anonymous Club
|
0 / 0 |
9 |
|
1810 |
codeforces#P1196D2 RGB Substring (hard version)
|
0 / 0 |
5 |
|
1802 |
codeforces#P1197E Culture Code
|
0 / 0 |
8 |
|
1800 |
codeforces#P1198B Welfare State
|
0 / 0 |
5 |
|
1792 |
codeforces#P1200A Hotelier
|
1 / 1 |
3 |
|
1789 |
codeforces#P1200D White Lines
|
0 / 0 |
6 |
|
1787 |
codeforces#P1200F Graph Traveler
|
0 / 0 |
8 |
|
1778 |
codeforces#P1202C You Are Given a WASD-string...
|
0 / 0 |
7 |
|
1762 |
codeforces#P1204D2 Kirk and a Binary String (hard version)
|
0 / 0 |
7 |
|
1747 |
codeforces#P1207F Remainder Problem
|
1 / 3 |
7 |
|
1746 |
codeforces#P1207G Indie Album
|
0 / 0 |
10 |
|
1743 |
codeforces#P1208D Restore Permutation
|
0 / 0 |
6 |
|
1741 |
codeforces#P1208E Let Them Slide
|
0 / 4 |
8 |
|
1738 |
codeforces#P1208H Red Blue Tree
|
0 / 0 |
10 |