|
|
4768 |
CF1146D
Frog Jumping
|
0 / 0 |
(None) |
|
|
4733 |
CF1151E
Number of Components
|
0 / 0 |
(None) |
|
|
4728 |
CF1152D
Neko and Aki's Prank
|
0 / 0 |
(None) |
|
|
4711 |
CF1154F
Shovels Shop
|
0 / 0 |
(None) |
|
|
4684 |
CF1158C
Permutation recovery
|
0 / 0 |
(None) |
|
|
4669 |
CF1163D
Mysterious Code
|
0 / 0 |
(None) |
|
|
4653 |
CF1166E
The LCMs Must be Large
|
0 / 0 |
(None) |
|
|
4647 |
CF1167E
Range Deleting
|
0 / 0 |
(None) |
|
|
4595 |
CF1176F
Destroy it!
|
0 / 0 |
(None) |
|
|
4555 |
CF1183F
Topforces Strikes Back
|
0 / 0 |
(None) |
|
|
4551 |
CF1184A2
Heidi Learns Hashing (Medium)
|
0 / 0 |
(None) |
|
|
4539 |
CF1184E2
Daleks' Invasion (medium)
|
0 / 0 |
(None) |
|
|
4530 |
CF1185F
Two Pizzas
|
0 / 0 |
(None) |
|
|
4529 |
CF1185G1
Playlist for Polycarp (easy version)
|
0 / 0 |
(None) |
|
|
4516 |
CF1187E
Tree Painting
|
0 / 0 |
(None) |
|
|
4474 |
CF1195E
OpenStreetMap
|
0 / 0 |
(None) |
|
|
4439 |
CF1201D
Treasure Hunting
|
0 / 0 |
(None) |
|
|
4433 |
CF1202C
You Are Given a WASD-string...
|
0 / 0 |
(None) |
|
|
4422 |
CF1203F1
Complete the Projects (easy version)
|
0 / 0 |
(None) |
|
|
4416 |
CF1204D2
Kirk and a Binary String (hard version)
|
0 / 0 |
(None) |
|
|
4398 |
CF1207F
Remainder Problem
|
0 / 0 |
(None) |
|
|
4351 |
CF1213F
Unstable String Sort
|
0 / 0 |
(None) |
|
|
4327 |
CF1216F
Wi-Fi
|
0 / 0 |
(None) |
|
|
4322 |
CF1217D
Coloring Edges
|
0 / 0 |
(None) |
|
|
4310 |
CF1218I
The Light Square
|
0 / 0 |
(None) |
|
|
4286 |
CF1223E
Paint the Tree
|
0 / 0 |
(None) |
|
|
4173 |
CF1250C
Trip to Saint Petersburg
|
0 / 0 |
(None) |
|
|
4145 |
CF1252G
Performance Review
|
0 / 0 |
(None) |
|
|
4141 |
CF1252K
Addition Robot
|
0 / 0 |
(None) |
|
|
4130 |
CF1254B2
Send Boxes to Alice (Hard Version)
|
0 / 0 |
(None) |
|
|
4096 |
CF1263E
Editor
|
0 / 0 |
(None) |
|
|
4084 |
CF1265E
Beautiful Mirrors
|
0 / 0 |
(None) |
|
|
4077 |
CF1266E
Spaceship Solitaire
|
0 / 0 |
(None) |
|
|
4062 |
CF1267K
Key Storage
|
0 / 0 |
(None) |
|
|
4039 |
CF1271D
Portals
|
0 / 0 |
(None) |
|
|
4038 |
CF1271E
Common Number
|
0 / 0 |
(None) |
|
|
4016 |
CF1278D
Segment Tree
|
0 / 0 |
(None) |
|
|
3981 |
CF1284D
New Year and Conference
|
0 / 0 |
(None) |
|
|
3914 |
CF1296F
Berland Beauty
|
0 / 0 |
(None) |
|
|
3900 |
CF1299C
Water Balance
|
0 / 0 |
(None) |
|
|
3827 |
CF1312E
Array Shrinking
|
0 / 0 |
(None) |
|
|
3797 |
CF1322B
Present
|
0 / 0 |
(None) |
|
|
3730 |
CF1332E
Height All the Same
|
0 / 0 |
(None) |
|
|
3723 |
CF1333D
Challenges in school №41
|
0 / 0 |
(None) |
|
|
3667 |
CF1343E
Weights Distributing
|
0 / 0 |
(None) |
|
|
3605 |
CF1354E
Graph Coloring
|
0 / 0 |
(None) |
|
|
3597 |
CF1355E
Restorer Distance
|
0 / 0 |
(None) |
|
|
3543 |
CF1360H
Binary Median
|
0 / 0 |
(None) |
|
|
3529 |
CF1363D
Guess The Maximums
|
0 / 0 |
(None) |
|
|
3521 |
CF1364D
Ehab's Last Corollary
|
0 / 0 |
(None) |
|
|
3514 |
CF1365F
Swaps Again
|
0 / 0 |
(None) |
|
|
3507 |
CF1366E
Two Arrays
|
0 / 0 |
(None) |
|
|
3498 |
CF1367F1
Flying Sort (Easy Version)
|
0 / 0 |
(None) |
|
|
3475 |
CF1370E
Binary Subsequence Rotation
|
0 / 0 |
(None) |
|
|
3461 |
CF1372D
Omkar and Circle
|
0 / 0 |
(None) |
|
|
3386 |
CF1387A
Graph
|
0 / 0 |
(None) |
|
|
3385 |
CF1387B1
Village (Minimum)
|
0 / 0 |
(None) |
|
|
3373 |
CF1389D
Segment Intersections
|
0 / 0 |
(None) |
|
|
3359 |
CF1392E
Omkar and Duck
|
0 / 0 |
(None) |
|
|
3350 |
CF1393D
Rarity and New Dress
|
0 / 0 |
(None) |
|
|
3259 |
CF1409F
Subsequences of Length Two
|
0 / 0 |
(None) |
|
|
3254 |
CF1411D
Grime Zoo
|
0 / 0 |
(None) |
|
|
3245 |
CF1413E
Solo mid Oracle
|
0 / 0 |
(None) |
|
|
3225 |
CF1418D
Trash Problem
|
0 / 0 |
(None) |
|
|
3215 |
CF1419E
Decryption
|
0 / 0 |
(None) |
|
|
3209 |
CF1420C2
Pokémon Army (hard version)
|
0 / 0 |
(None) |
|
|
3128 |
CF1431F
Neural Network Problem
|
0 / 0 |
(None) |
|
|
3127 |
CF1431G
Number Deletion Game
|
0 / 0 |
(None) |
|
|
3117 |
CF1433F
Zero Remainder Sum
|
0 / 0 |
(None) |
|
|
3116 |
CF1433G
Reducing Delivery Cost
|
0 / 0 |
(None) |
|
|
3062 |
CF1446C
Xor Tree
|
0 / 0 |
(None) |
|
|
3052 |
CF1450C1
Errich-Tac-Toe (Easy Version)
|
0 / 0 |
(None) |
|
|
3016 |
CF1454F
Array Partition
|
0 / 0 |
(None) |
|
|
2970 |
CF1466F
Euclid's nightmare
|
0 / 0 |
(None) |
|
|
2922 |
CF1472F
New Year's Puzzle
|
0 / 0 |
(None) |
|
|
2921 |
CF1472G
Moving to the Capital
|
0 / 0 |
(None) |
|
|
2878 |
CF1479B2
Painting the Array II
|
0 / 0 |
(None) |
|
|
2861 |
CF1482E
Skyline Photo
|
0 / 0 |
(None) |
|
|
2844 |
CF1486D
Max Median
|
0 / 0 |
(None) |
|
|
2796 |
CF1493D
GCD of an Array
|
0 / 0 |
(None) |
|
|
2760 |
CF1499D
The Number of Pairs
|
0 / 0 |
(None) |
|
|
2706 |
CF1510D
Digits
|
0 / 0 |
(None) |
|
|
2693 |
CF1511E
Colorings and Dominoes
|
0 / 0 |
(None) |
|
|
2656 |
CF1516D
Cut
|
0 / 0 |
(None) |
|
|
2610 |
CF1525E
Assimilation IV
|
0 / 0 |
(None) |
|
|
2581 |
CF1530E
Minimax
|
0 / 0 |
(None) |
|
|
2521 |
CF1538E
Funny Substrings
|
0 / 0 |
(None) |
|
|
2519 |
CF1538G
Gift Set
|
0 / 0 |
(None) |
|
|
2473 |
CF1547G
How Many Paths?
|
0 / 0 |
(None) |
|
|
2451 |
CF1551D2
Domino (hard version)
|
0 / 0 |
(None) |
|
|
2433 |
CF1553E
Permutation Shift
|
0 / 0 |
(None) |
|
|
2418 |
CF1555E
Boring Segments
|
0 / 0 |
(None) |
|
|
2381 |
CF1560F2
Nearest Beautiful Number (hard version)
|
0 / 0 |
(None) |
|
|
2307 |
CF1575L
Longest Array Deconstruction
|
0 / 0 |
(None) |
|
|
2221 |
CF1593F
Red-Black Number
|
0 / 0 |
(None) |
|
|
2207 |
CF1598E
Staircases
|
0 / 0 |
(None) |
|
|
2196 |
CF1599H
Hidden Fortress
|
0 / 0 |
(None) |
|
|
2167 |
CF1605D
Treelabeling
|
0 / 0 |
(None) |
|
|
2160 |
CF1606E
Arena
|
0 / 0 |
(None) |
|
|
2096 |
CF1614D1
Divan and Kostomuksha (easy version)
|
0 / 0 |
(None) |
