|
|
2232 |
codeforces#P1111C Creative Snap
|
0 / 0 |
5 |
|
|
2222 |
codeforces#P1114F Please, another Queries on Array?
|
1 / 8 |
9 |
|
|
2121 |
codeforces#P1139F Dish Shopping
|
0 / 0 |
9 |
|
|
2117 |
codeforces#P1140E Palindrome-less Arrays
|
0 / 0 |
8 |
|
|
2116 |
codeforces#P1140F Extending Set of Points
|
1 / 1 |
10 |
|
|
2115 |
codeforces#P1140G Double Tree
|
0 / 0 |
10 |
|
|
2080 |
codeforces#P1146E Hot is Cold
|
0 / 0 |
9 |
|
|
2026 |
codeforces#P1155D Beautiful Array
|
1 / 2 |
6 |
|
|
2020 |
codeforces#P1156D 0-1-Tree
|
0 / 0 |
8 |
|
|
2018 |
codeforces#P1156E Special Segments of Permutation
|
0 / 0 |
8 |
|
|
1974 |
codeforces#P1167B Lost Numbers
|
0 / 0 |
4 |
|
|
1939 |
codeforces#P1174F Ehab and the Big Finale
|
0 / 0 |
9 |
|
|
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 |
|
|
1924 |
codeforces#P1177B Digits Sequence (Hard Edition)
|
0 / 0 |
6 |
|
|
1910 |
codeforces#P1179E Alesya and Discrete Math
|
0 / 0 |
10 |
|
|
1903 |
codeforces#P1181E1 A Story of One Country (Easy)
|
0 / 0 |
9 |
|
|
1859 |
codeforces#P1186E Vus the Cossack and a Field
|
0 / 0 |
9 |
|
|
1838 |
codeforces#P1190D Tokitsukaze and Strange Rectangle
|
0 / 0 |
7 |
|
|
1832 |
codeforces#P1192B Dynamic Diameter
|
1 / 2 |
10 |
|
|
1703 |
codeforces#P1213G Path Queries
|
1 / 1 |
6 |
|
|
1675 |
codeforces#P1217F Forced Online Queries Problem
|
0 / 0 |
10 |
|
|
1671 |
codeforces#P1218D Xor Spanning Tree
|
0 / 0 |
9 |
|
|
1670 |
codeforces#P1218E Product Tuples
|
0 / 0 |
9 |
|
|
1644 |
codeforces#P1223F Stack Exterminable Arrays
|
0 / 0 |
10 |
|
|
1598 |
codeforces#P1237C2 Balanced Removals (Harder)
|
0 / 0 |
6 |
|
|
1534 |
codeforces#P1250M SmartGarden
|
0 / 0 |
9 |
|
|
1484 |
codeforces#P1257G Divisor Set
|
0 / 0 |
10 |
|
|
1477 |
codeforces#P1261F Xor-Set
|
1 / 1 |
10 |
|
|
1440 |
codeforces#P1268D Invertation in Tournament
|
1 / 1 |
10 |
|
|
1393 |
codeforces#P1278E Tests for problem D
|
0 / 0 |
8 |
|
|
1355 |
codeforces#P1285D Dr
|
0 / 0 |
6 |
|
|
1310 |
codeforces#P1295E Permutation Separation
|
0 / 0 |
8 |
|
|
1262 |
codeforces#P1303G Sum of Prefix Sums
|
0 / 0 |
10 |
|
|
1228 |
codeforces#P1311F Moving Points
|
0 / 1 |
6 |
|
|
1207 |
codeforces#P1316F Battalion Strength
|
1 / 1 |
10 |
|
|
1107 |
codeforces#P1336F Journey
|
0 / 0 |
10 |
|
|
1102 |
codeforces#P1338C Perfect Triples
|
0 / 0 |
8 |
|
|
947 |
codeforces#P1364E X-OR
|
1 / 1 |
10 |
|
|
898 |
codeforces#P1371F Raging Thunder
|
0 / 0 |
10 |
|
|
892 |
codeforces#P1372F Omkar and Modes
|
1 / 1 |
10 |
|
|
888 |
codeforces#P1373D Maximum Sum on Even Positions
|
0 / 0 |
5 |
|
|
885 |
codeforces#P1373G Pawns
|
0 / 0 |
10 |
|
|
870 |
codeforces#P1375H Set Merging
|
1 / 3 |
10 |
|
|
865 |
codeforces#P1379E Inverse Genealogy
|
2 / 2 |
10 |
|
|
862 |
codeforces#P1379F2 Chess Strikes Back (hard version)
|
0 / 0 |
10 |
|
|
834 |
codeforces#P1385D a-Good String
|
1 / 1 |
5 |
|
|
828 |
codeforces#P1386C Joker
|
0 / 0 |
10 |
|
|
758 |
codeforces#P1400E Clear the Multiset
|
0 / 0 |
8 |
