|
|
29925 |
codeforces#P1111C
Creative Snap
|
0 / 0 |
5 |
|
|
29935 |
codeforces#P1114F
Please, another Queries on Array?
|
1 / 8 |
9 |
|
|
30035 |
codeforces#P1139F
Dish Shopping
|
0 / 0 |
9 |
|
|
30040 |
codeforces#P1140E
Palindrome-less Arrays
|
0 / 0 |
8 |
|
|
30041 |
codeforces#P1140F
Extending Set of Points
|
1 / 1 |
10 |
|
|
30042 |
codeforces#P1140G
Double Tree
|
0 / 0 |
10 |
|
|
30077 |
codeforces#P1146E
Hot is Cold
|
0 / 0 |
9 |
|
|
30131 |
codeforces#P1155D
Beautiful Array
|
1 / 2 |
6 |
|
|
30137 |
codeforces#P1156D
0-1-Tree
|
0 / 0 |
8 |
|
|
30138 |
codeforces#P1156E
Special Segments of Permutation
|
0 / 0 |
8 |
|
|
30182 |
codeforces#P1167B
Lost Numbers
|
0 / 0 |
4 |
|
|
30218 |
codeforces#P1174F
Ehab and the Big Finale
|
0 / 0 |
9 |
|
|
30223 |
codeforces#P1175E
Minimal Segment Cover
|
1 / 1 |
8 |
|
|
30224 |
codeforces#P1175F
The Number of Subpermutations
|
1 / 2 |
9 |
|
|
30225 |
codeforces#P1175G
Yet Another Partiton Problem
|
0 / 0 |
10 |
|
|
30233 |
codeforces#P1177B
Digits Sequence (Hard Edition)
|
0 / 0 |
6 |
|
|
30247 |
codeforces#P1179E
Alesya and Discrete Math
|
0 / 0 |
10 |
|
|
30254 |
codeforces#P1181E1
A Story of One Country (Easy)
|
0 / 0 |
9 |
|
|
30298 |
codeforces#P1186E
Vus the Cossack and a Field
|
0 / 0 |
9 |
|
|
30319 |
codeforces#P1190D
Tokitsukaze and Strange Rectangle
|
0 / 0 |
7 |
|
|
30325 |
codeforces#P1192B
Dynamic Diameter
|
1 / 2 |
10 |
|
|
30454 |
codeforces#P1213G
Path Queries
|
1 / 1 |
6 |
|
|
30482 |
codeforces#P1217F
Forced Online Queries Problem
|
0 / 0 |
10 |
|
|
30486 |
codeforces#P1218D
Xor Spanning Tree
|
0 / 0 |
9 |
|
|
30487 |
codeforces#P1218E
Product Tuples
|
0 / 0 |
9 |
|
|
30513 |
codeforces#P1223F
Stack Exterminable Arrays
|
0 / 0 |
10 |
|
|
30559 |
codeforces#P1237C2
Balanced Removals (Harder)
|
0 / 0 |
6 |
|
|
30625 |
codeforces#P1250M
SmartGarden
|
0 / 0 |
9 |
|
|
30673 |
codeforces#P1257G
Divisor Set
|
0 / 0 |
10 |
|
|
30680 |
codeforces#P1261F
Xor-Set
|
1 / 1 |
10 |
|
|
30720 |
codeforces#P1268D
Invertation in Tournament
|
1 / 1 |
10 |
|
|
30767 |
codeforces#P1278E
Tests for problem D
|
0 / 0 |
8 |
|
|
30805 |
codeforces#P1285D
Dr
|
0 / 0 |
6 |
|
|
30850 |
codeforces#P1295E
Permutation Separation
|
0 / 0 |
8 |
|
|
30898 |
codeforces#P1303G
Sum of Prefix Sums
|
0 / 0 |
10 |
|
|
30932 |
codeforces#P1311F
Moving Points
|
0 / 1 |
6 |
|
|
30954 |
codeforces#P1316F
Battalion Strength
|
1 / 1 |
10 |
|
|
31053 |
codeforces#P1336F
Journey
|
0 / 0 |
10 |
|
|
31058 |
codeforces#P1338C
Perfect Triples
|
0 / 0 |
8 |
|
|
31213 |
codeforces#P1364E
X-OR
|
1 / 1 |
10 |
|
|
31263 |
codeforces#P1371F
Raging Thunder
|
0 / 0 |
10 |
|
|
31269 |
codeforces#P1372F
Omkar and Modes
|
1 / 1 |
10 |
|
|
31273 |
codeforces#P1373D
Maximum Sum on Even Positions
|
0 / 0 |
5 |
|
|
31276 |
codeforces#P1373G
Pawns
|
0 / 0 |
10 |
|
|
31291 |
codeforces#P1375H
Set Merging
|
1 / 3 |
10 |
|
|
31297 |
codeforces#P1379E
Inverse Genealogy
|
2 / 2 |
10 |
|
|
31299 |
codeforces#P1379F2
Chess Strikes Back (hard version)
|
0 / 0 |
10 |
|
|
31327 |
codeforces#P1385D
a-Good String
|
1 / 1 |
5 |
|
|
31333 |
codeforces#P1386C
Joker
|
0 / 0 |
10 |
|
|
31403 |
codeforces#P1400E
Clear the Multiset
|
0 / 0 |
8 |
