|
5035 |
codeforces#P925C Big Secret
|
0 / 0 |
8 |
|
5024 |
codeforces#P926H Endless Roses Most Beautiful
|
0 / 0 |
8 |
|
5005 |
codeforces#P932D Tree
|
0 / 0 |
8 |
|
4959 |
codeforces#P946E Largest Beautiful Number
|
0 / 0 |
8 |
|
4941 |
codeforces#P952G Puzzling Language
|
0 / 0 |
8 |
|
4932 |
codeforces#P954I Yet Another String Matching Problem
|
0 / 0 |
8 |
|
4920 |
codeforces#P958B2 Maximum Control (medium)
|
0 / 0 |
8 |
|
4913 |
codeforces#P958E2 Guard Duty (medium)
|
0 / 0 |
8 |
|
4883 |
codeforces#P962E Byteland, Berland and Disputed Cities
|
0 / 0 |
8 |
|
4869 |
codeforces#P965E Short Code
|
0 / 0 |
8 |
|
4839 |
codeforces#P979D Kuro and GCD and XOR and SUM
|
0 / 0 |
8 |
|
4833 |
codeforces#P980E The Number Games
|
0 / 0 |
8 |
|
4827 |
codeforces#P981E Addition on Segments
|
0 / 0 |
8 |
|
4700 |
codeforces#P1003F Abbreviation
|
0 / 0 |
8 |
|
4558 |
codeforces#P1034B Little C Loves 3 II
|
0 / 0 |
8 |
|
4543 |
codeforces#P1037E Trips
|
0 / 0 |
8 |
|
4531 |
codeforces#P1039C Network Safety
|
0 / 0 |
8 |
|
4498 |
codeforces#P1045D Interstellar battle
|
0 / 0 |
8 |
|
4495 |
codeforces#P1045G AI robots
|
0 / 0 |
8 |
|
4449 |
codeforces#P1059D Nature Reserve
|
0 / 0 |
8 |
|
4416 |
codeforces#P1065D Three Pieces
|
0 / 0 |
8 |
|
4398 |
codeforces#P1070A Find a Number
|
0 / 0 |
8 |
|
4316 |
codeforces#P1089A Alice the Fan
|
0 / 0 |
8 |
|
4279 |
codeforces#P1092D1 Great Vova Wall (Version 1)
|
0 / 0 |
8 |
|
4278 |
codeforces#P1092D2 Great Vova Wall (Version 2)
|
0 / 0 |
8 |
|
4252 |
codeforces#P1097D Makoto and a Blackboard
|
0 / 0 |
8 |
|
4233 |
codeforces#P1100E Andrew and Taxi
|
0 / 0 |
8 |
|
4207 |
codeforces#P1105E Helping Hiasat
|
0 / 0 |
8 |
|
4177 |
codeforces#P1110D Jongmah
|
0 / 0 |
8 |
|
4176 |
codeforces#P1110E Magic Stones
|
0 / 0 |
8 |
|
4161 |
codeforces#P1114E Arithmetic Progression
|
0 / 0 |
8 |
|
4136 |
codeforces#P1117E Decypher the String
|
0 / 0 |
8 |
|
4074 |
codeforces#P1136E Nastya Hasn't Written a Legend
|
0 / 0 |
8 |
|
4055 |
codeforces#P1140E Palindrome-less Arrays
|
0 / 0 |
8 |
|
3999 |
codeforces#P1149B Three Religions
|
0 / 0 |
8 |
|
3976 |
codeforces#P1153E Serval and Snake
|
0 / 0 |
8 |
|
3968 |
codeforces#P1154G Minimum Possible LCM
|
0 / 0 |
8 |
|
3963 |
codeforces#P1155E Guess the Root
|
0 / 0 |
8 |
|
3958 |
codeforces#P1156D 0-1-Tree
|
0 / 0 |
8 |
|
3957 |
codeforces#P1156E Special Segments of Permutation
|
0 / 0 |
8 |
|
3947 |
codeforces#P1157G Inverse of Rows and Columns
|
0 / 0 |
8 |
|
3945 |
codeforces#P1158B The minimal unique substring
|
0 / 0 |
8 |
|
3917 |
codeforces#P1166D Cute Sequences
|
0 / 0 |
8 |
|
3905 |
codeforces#P1168C And Reachability
|
0 / 0 |
8 |
|
3872 |
codeforces#P1175E Minimal Segment Cover
|
0 / 0 |
8 |
|
3856 |
codeforces#P1178F1 Short Colorful Strip
|
0 / 0 |
8 |
|
3850 |
codeforces#P1179C Serge and Dining Room
|
0 / 0 |
8 |
|
3842 |
codeforces#P1181D Irrigation
|
0 / 0 |
8 |
|
3821 |
codeforces#P1184B2 The Doctor Meets Vader (Medium)
|
0 / 0 |
8 |
|
3818 |
codeforces#P1184C2 Heidi and the Turing Test (Medium)
|
0 / 0 |
8 |
|
3763 |
codeforces#P1194E Count The Rectangles
|
0 / 0 |
8 |
|
3747 |
codeforces#P1196F K-th Path
|
0 / 0 |
8 |
|
3681 |
codeforces#P1208E Let Them Slide
|
0 / 0 |
8 |
|
3630 |
codeforces#P1215E Marbles
|
0 / 0 |
8 |
|
3623 |
codeforces#P1216E2 Numerical Sequence (hard version)
|
0 / 0 |
8 |
|
3600 |
codeforces#P1220E Tourism
|
0 / 0 |
8 |
|
3578 |
codeforces#P1225E Rock Is Push
|
0 / 0 |
8 |
|
3570 |
codeforces#P1227E Arson In Berland Forest
|
0 / 0 |
8 |
|
3569 |
codeforces#P1227F1 Wrong Answer on test 233 (Easy Version)
|
0 / 0 |
8 |
|
3557 |
codeforces#P1231E Middle-Out
|
0 / 0 |
8 |
|
3550 |
codeforces#P1234F Yet Another Substring Reverse
|
0 / 0 |
8 |
|
3530 |
codeforces#P1238E Keyboard Purchase
|
0 / 0 |
8 |
|
3529 |
codeforces#P1238F The Maximum Subtree
|
0 / 0 |
8 |
|
3487 |
codeforces#P1249F Maximum Weight Subset
|
0 / 0 |
8 |
|
3461 |
codeforces#P1252E Songwriter
|
0 / 0 |
8 |
|
3449 |
codeforces#P1253E Antenna Coverage
|
0 / 0 |
8 |
|
3355 |
codeforces#P1272F Two Bracket Sequences
|
0 / 0 |
8 |
|
3341 |
codeforces#P1278E Tests for problem D
|
0 / 0 |
8 |
|
3314 |
codeforces#P1283F DIY Garland
|
0 / 0 |
8 |
|
3258 |
codeforces#P1295E Permutation Separation
|
0 / 0 |
8 |
|
3213 |
codeforces#P1303E Erase Subsequences
|
0 / 0 |
8 |
|
3199 |
codeforces#P1305E Kuroni and the Score Distribution
|
0 / 0 |
8 |
|
3178 |
codeforces#P1311E Construct the Binary Tree
|
0 / 0 |
8 |
|
3114 |
codeforces#P1327D Infinite Path
|
0 / 0 |
8 |
|
3105 |
codeforces#P1328F Make k Equal
|
0 / 0 |
8 |
|
3077 |
codeforces#P1333F Kate and imperfection
|
0 / 0 |
8 |
|
3072 |
codeforces#P1334E Divisor Paths
|
0 / 0 |
8 |
|
3063 |
codeforces#P1335F Robots on a Grid
|
0 / 0 |
8 |
|
3060 |
codeforces#P1336C Kaavi and Magic Spell
|
0 / 0 |
8 |
|
3051 |
codeforces#P1338C Perfect Triples
|
0 / 0 |
8 |
|
2979 |
codeforces#P1353F Decreasing Heights
|
0 / 0 |
8 |
|
2836 |
codeforces#P1373E Sum of Digits
|
0 / 0 |
8 |
|
2787 |
codeforces#P1384B2 Koa and the Beach (Hard Version)
|
0 / 0 |
8 |
|
2763 |
codeforces#P1389E Calendar Ambiguity
|
0 / 0 |
8 |
|
2721 |
codeforces#P1398E Two Types of Spells
|
0 / 0 |
8 |
|
2713 |
codeforces#P1399E2 Weights Division (hard version)
|
0 / 0 |
8 |
|
2707 |
codeforces#P1400E Clear the Multiset
|
0 / 0 |
8 |
|
2682 |
codeforces#P1406D Three Sequences
|
0 / 0 |
8 |
|
2677 |
codeforces#P1407D Discrete Centrifugal Jumps
|
0 / 0 |
8 |
|
2643 |
codeforces#P1415E New Game Plus!
|
0 / 0 |
8 |
|
2587 |
codeforces#P1424M Ancient Language
|
0 / 0 |
8 |
|
2582 |
codeforces#P1425E Excitation of Atoms
|
0 / 0 |
8 |
|
2560 |
codeforces#P1428E Carrots for Rabbits
|
0 / 0 |
8 |
|
2520 |
codeforces#P1437E Make It Increasing
|
0 / 0 |
8 |
|
2514 |
codeforces#P1438D Powerful Ksenia
|
0 / 0 |
8 |
|
2421 |
codeforces#P1461E Water Level
|
0 / 0 |
8 |
|
2393 |
codeforces#P1467D Sum of Paths
|
0 / 0 |
8 |
|
2391 |
codeforces#P1468A LaIS
|
0 / 0 |
8 |
|
2384 |
codeforces#P1468H K and Medians
|
0 / 0 |
8 |
|
2368 |
codeforces#P1470D Strange Housing
|
0 / 0 |
8 |