|
|
5127 |
CF1082E
Increasing Frequency
|
0 / 0 |
(None) |
|
|
5122 |
CF1083B
The Fair Nut and Strings
|
0 / 0 |
(None) |
|
|
5101 |
CF1088D
Ehab and another another xor problem
|
0 / 0 |
(None) |
|
|
5054 |
CF1092E
Minimal Diameter Forest
|
0 / 0 |
(None) |
|
|
5000 |
CF1101D
GCD Counting
|
0 / 0 |
(None) |
|
|
4990 |
CF1102F
Elongated Matrix
|
0 / 0 |
(None) |
|
|
4988 |
CF1103B
Game with modulo
|
0 / 0 |
(None) |
|
|
4865 |
CF1129B
Wrong Answer
|
0 / 0 |
(None) |
|
|
4853 |
CF1131D
Gourmet choice
|
0 / 0 |
(None) |
|
|
4843 |
CF1132F
Clear the String
|
0 / 0 |
(None) |
|
|
4795 |
CF1142B
Lynyrd Skynyrd
|
0 / 0 |
(None) |
|
|
4761 |
CF1147C
Thanos Nim
|
0 / 0 |
(None) |
|
|
4700 |
CF1156C
Match Points
|
0 / 0 |
(None) |
|
|
4688 |
CF1157F
Maximum Balanced Circle
|
0 / 0 |
(None) |
|
|
4660 |
CF1165F1
Microtransactions (easy version)
|
0 / 0 |
(None) |
|
|
4659 |
CF1165F2
Microtransactions (hard version)
|
0 / 0 |
(None) |
|
|
4556 |
CF1183E
Subsequences (easy version)
|
0 / 0 |
(None) |
|
|
4554 |
CF1183G
Candy Box (hard version)
|
0 / 0 |
(None) |
|
|
4531 |
CF1185E
Polycarp and Snakes
|
0 / 0 |
(None) |
|
|
4499 |
CF1190D
Tokitsukaze and Strange Rectangle
|
0 / 0 |
(None) |
|
|
4455 |
CF1198C
Matching vs Independent Set
|
0 / 0 |
(None) |
|
|
4444 |
CF1200E
Compress Words
|
0 / 0 |
(None) |
|
|
4417 |
CF1204D1
Kirk and a Binary String (easy version)
|
0 / 0 |
(None) |
|
|
4383 |
CF1209E1
Rotate Columns (easy version)
|
0 / 0 |
(None) |
|
|
4380 |
CF1209G1
Into Blocks (easy version)
|
0 / 0 |
(None) |
|
|
4374 |
CF1210C
Kamil and Making a Stream
|
0 / 0 |
(None) |
|
|
4364 |
CF1211D
Teams
|
0 / 0 |
(None) |
|
|
4363 |
CF1211E
Double Permutation Inc.
|
0 / 0 |
(None) |
|
|
4344 |
CF1214E
Petya and Construction Set
|
0 / 0 |
(None) |
|
|
4308 |
CF1219G
Harvester
|
0 / 0 |
(None) |
|
|
4287 |
CF1223D
Sequence Sorting
|
0 / 0 |
(None) |
|
|
4248 |
CF1234E
Special Permutations
|
0 / 0 |
(None) |
|
|
4234 |
CF1237D
Balanced Playlist
|
0 / 0 |
(None) |
|
|
4203 |
CF1244C
The Football Season
|
0 / 0 |
(None) |
|
|
4200 |
CF1244E
Minimizing Difference
|
0 / 0 |
(None) |
|
|
4186 |
CF1248D1
The World Is Just a Programming Task (Easy Version)
|
0 / 0 |
(None) |
|
|
4161 |
CF1250N
Wires
|
0 / 0 |
(None) |
|
|
4118 |
CF1256E
Yet Another Division Into Teams
|
0 / 0 |
(None) |
|
|
4117 |
CF1256F
Equalizing Two Strings
|
0 / 0 |
(None) |
|
|
4111 |
CF1257E
The Contest
|
0 / 0 |
(None) |
|
|
4078 |
CF1266D
Decreasing Debts
|
0 / 0 |
(None) |
|
|
4059 |
CF1268B
Domino for Young
|
0 / 0 |
(None) |
|
|
4004 |
CF1280C
Jeremy Bearimy
|
0 / 0 |
(None) |
|
|
3955 |
CF1288D
Minimax Problem
|
0 / 0 |
(None) |
|
|
3954 |
CF1288E
Messenger Simulator
|
0 / 0 |
(None) |
|
|
3928 |
CF1294F
Three Paths on a Tree
|
0 / 0 |
(None) |
|
|
3915 |
CF1296E2
String Coloring (hard version)
|
0 / 0 |
(None) |
|
|
3892 |
CF1301D
Time to Run
|
0 / 0 |
(None) |
|
|
3865 |
CF1304E
1-Trees and Queries
|
0 / 0 |
(None) |
|
|
3834 |
CF1311D
Three Integers
|
0 / 0 |
(None) |
|
|
3810 |
CF1316D
Nash Matrix
|
0 / 0 |
(None) |
|
|
3805 |
CF1320C
World of Darkraft: Battle for Azathoth
|
0 / 0 |
(None) |
|
|
3664 |
CF1344B
Monopole Magnets
|
0 / 0 |
(None) |
|
|
3651 |
CF1346F
Dune II: Battle For Arrakis
|
0 / 0 |
(None) |
|
|
3639 |
CF1349B
Orac and Medians
|
0 / 0 |
(None) |
|
|
3638 |
CF1349C
Orac and Game of Life
|
0 / 0 |
(None) |
|
|
3607 |
CF1354C2
Not So Simple Polygon Embedding
|
0 / 0 |
(None) |
|
|
3554 |
CF1359D
Yet Another Yet Another Task
|
0 / 0 |
(None) |
|
|
3553 |
CF1359E
Modular Stability
|
0 / 0 |
(None) |
|
|
3528 |
CF1363E
Tree Shuffling
|
0 / 0 |
(None) |
|
|
3508 |
CF1366D
Two Divisors
|
0 / 0 |
(None) |
|
|
3476 |
CF1370D
Odd-Even Subsequence
|
0 / 0 |
(None) |
|
|
3430 |
CF1379C
Choosing flowers
|
0 / 0 |
(None) |
|
|
3421 |
CF1380D
Berserk And Fireball
|
0 / 0 |
(None) |
|
|
3393 |
CF1385E
Directing Edges
|
0 / 0 |
(None) |
|
|
3378 |
CF1388D
Captain Flint and Treasure
|
0 / 0 |
(None) |
|
|
3365 |
CF1391D
505
|
0 / 0 |
(None) |
|
|
3318 |
CF1399E1
Weights Division (easy version)
|
0 / 0 |
(None) |
|
|
3271 |
CF1408D
Searchlights
|
0 / 0 |
(None) |
|
|
3240 |
CF1415D
XOR-gun
|
0 / 0 |
(None) |
|
|
3236 |
CF1416B
Make Them Equal
|
0 / 0 |
(None) |
|
|
3234 |
CF1416C
XOR Inverse
|
0 / 0 |
(None) |
|
|
3161 |
CF1426F
Number of Subsequences
|
0 / 0 |
(None) |
|
|
3158 |
CF1427C
The Hard Work of Paparazzi
|
0 / 0 |
(None) |
|
|
3156 |
CF1427D
Unshuffling a Deck
|
0 / 0 |
(None) |
|
|
3129 |
CF1431E
Chess Match
|
0 / 0 |
(None) |
|
|
3097 |
CF1438C
Engineer Artem
|
0 / 0 |
(None) |
|
|
3039 |
CF1451E1
Bitwise Queries (Easy Version)
|
0 / 0 |
(None) |
|
|
3017 |
CF1454E
Number of Simple Paths
|
0 / 0 |
(None) |
|
|
3005 |
CF1458B
Glass Half Spilled
|
0 / 0 |
(None) |
|
|
2868 |
CF1481D
AB Graph
|
0 / 0 |
(None) |
|
|
2837 |
CF1487E
Cheap Dinner
|
0 / 0 |
(None) |
|
|
2797 |
CF1493C
K-beautiful Strings
|
0 / 0 |
(None) |
|
|
2721 |
CF1506F
Triangular Paths
|
0 / 0 |
(None) |
|
|
2720 |
CF1506G
Maximize the Remaining String
|
0 / 0 |
(None) |
|
|
2678 |
CF1513D
GCD and MST
|
0 / 0 |
(None) |
|
|
2672 |
CF1514D
Cut and Stick
|
0 / 0 |
(None) |
|
|
2627 |
CF1521C
Nastia and a Hidden Permutation
|
0 / 0 |
(None) |
|
|
2612 |
CF1525C
Robot Collisions
|
0 / 0 |
(None) |
|
|
2539 |
CF1536D
Omkar and Medians
|
0 / 0 |
(None) |
|
|
2450 |
CF1551E
Fixed Points
|
0 / 0 |
(None) |
|
|
2398 |
CF1558C
Bottom-Tier Reversals
|
0 / 0 |
(None) |
|
|
2363 |
CF1566E
Buds Re-hanging
|
0 / 0 |
(None) |
|
|
2355 |
CF1567D
Expression Evaluation Error
|
0 / 0 |
(None) |
|
|
2340 |
CF1571F
Kotlinforces
|
0 / 0 |
(None) |
|
|
2322 |
CF1574D
The Strongest Build
|
0 / 0 |
(None) |
|
|
2266 |
CF1582E
Pchelyonok and Segments
|
0 / 0 |
(None) |
|
|
2250 |
CF1584D
Guess the Permutation
|
0 / 0 |
(None) |
|
|
2201 |
CF1599C
Bubble Strike
|
0 / 0 |
(None) |
|
|
2129 |
CF1610D
Not Quite Lee
|
0 / 0 |
(None) |
