|
5441 |
codeforces#P846D Monitor
|
0 / 0 |
6 |
|
5430 |
codeforces#P847I Noise Level
|
0 / 0 |
6 |
|
5424 |
codeforces#P848B Rooter's Song
|
0 / 0 |
6 |
|
5365 |
codeforces#P862C Mahmoud and Ehab and the xor
|
0 / 0 |
6 |
|
5334 |
codeforces#P865B Ordering Pizza
|
0 / 0 |
6 |
|
5275 |
codeforces#P883G Orientation of Edges
|
0 / 0 |
6 |
|
5273 |
codeforces#P883I Photo Processing
|
0 / 0 |
6 |
|
5232 |
codeforces#P893D Credit Card
|
0 / 0 |
6 |
|
5227 |
codeforces#P894C Marco and GCD Sequence
|
0 / 0 |
6 |
|
5162 |
codeforces#P909E Coprocessor
|
0 / 0 |
6 |
|
5113 |
codeforces#P914D Bash and a Tough Math Puzzle
|
0 / 0 |
6 |
|
5027 |
codeforces#P926E Merge Equal Elements
|
0 / 0 |
6 |
|
5018 |
codeforces#P928C Dependency management
|
0 / 0 |
6 |
|
5017 |
codeforces#P928D Autocompletion
|
0 / 0 |
6 |
|
5014 |
codeforces#P930C Teodor is not a liar!
|
0 / 0 |
6 |
|
4991 |
codeforces#P935D Fafa and Ancient Alphabet
|
0 / 0 |
6 |
|
4953 |
codeforces#P949C Data Center Maintenance
|
0 / 0 |
6 |
|
4946 |
codeforces#P952B A Map of the Cat
|
0 / 0 |
6 |
|
4905 |
codeforces#P959D Mahmoud and Ehab and another array construction task
|
0 / 0 |
6 |
|
4904 |
codeforces#P959E Mahmoud and Ehab and the xor-MST
|
0 / 0 |
6 |
|
4890 |
codeforces#P961E Tufurama
|
0 / 0 |
6 |
|
4870 |
codeforces#P965D Single-use Stones
|
0 / 0 |
6 |
|
4828 |
codeforces#P981D Bookshelves
|
0 / 0 |
6 |
|
4820 |
codeforces#P982D Shark
|
0 / 0 |
6 |
|
4764 |
codeforces#P993B Open Communication
|
0 / 0 |
6 |
|
4739 |
codeforces#P999D Equalize the Remainders
|
0 / 0 |
6 |
|
4733 |
codeforces#P1000D Yet Another Problem On a Subsequence
|
0 / 0 |
6 |
|
4717 |
codeforces#P1002A4 Generate W state
|
0 / 0 |
6 |
|
4706 |
codeforces#P1002E2 Another array reconstruction algorithm
|
0 / 0 |
6 |
|
4657 |
codeforces#P1012B Chemical table
|
0 / 0 |
6 |
|
4656 |
codeforces#P1012C Hills
|
0 / 0 |
6 |
|
4645 |
codeforces#P1015E2 Stars Drawing (Hard Edition)
|
0 / 0 |
6 |
|
4633 |
codeforces#P1017D The Wu
|
0 / 0 |
6 |
|
4589 |
codeforces#P1029D Concatenated Multiples
|
0 / 0 |
6 |
|
4576 |
codeforces#P1031D Minimum path
|
0 / 0 |
6 |
|
4570 |
codeforces#P1032D Barcelonian Distance
|
0 / 0 |
6 |
|
4552 |
codeforces#P1036C Classy Numbers
|
0 / 0 |
6 |
|
4522 |
codeforces#P1041E Tree Reconstruction
|
0 / 0 |
6 |
|
4510 |
codeforces#P1043E Train Hard, Win Easy
|
0 / 0 |
6 |
|
4506 |
codeforces#P1044B Intersecting Subtrees
|
0 / 0 |
6 |
|
4475 |
codeforces#P1054D Changing Array
|
0 / 0 |
6 |
|
4468 |
codeforces#P1055C Lucky Days
|
0 / 0 |
6 |
|
4444 |
codeforces#P1060D Social Circles
|
0 / 0 |
6 |
|
4425 |
codeforces#P1063C Dwarves, Hats and Extrasensory Abilities
|
0 / 0 |
6 |
|
4406 |
codeforces#P1067A Array Without Local Maximums
|
0 / 0 |
6 |
|
4371 |
codeforces#P1076E Vasya and a Tree
|
0 / 0 |
6 |
|
4363 |
codeforces#P1077F1 Pictures with Kittens (easy version)
|
0 / 0 |
6 |
|
4350 |
codeforces#P1081E Missing Numbers
|
0 / 0 |
6 |
|
4311 |
codeforces#P1089F Fractions
|
0 / 0 |
6 |
|
4276 |
codeforces#P1092F Tree with Maximum Cost
|
0 / 0 |
6 |
|
4264 |
codeforces#P1095E Almost Regular Bracket Sequence
|
0 / 0 |
6 |
|
4263 |
codeforces#P1095F Make It Connected
|
0 / 0 |
6 |
|
4208 |
codeforces#P1105D Kilani and the Game
|
0 / 0 |
6 |
|
4162 |
codeforces#P1114D Flood Fill
|
0 / 0 |
6 |
|
4138 |
codeforces#P1117C Magic Ship
|
0 / 0 |
6 |
|
4121 |
codeforces#P1119E Pavel and Triangles
|
0 / 0 |
6 |
|
4117 |
codeforces#P1120A Diana and Liana
|
0 / 0 |
6 |
|
4079 |
codeforces#P1133F2 Spanning Tree with One Fixed Degree
|
0 / 0 |
6 |
|
4047 |
codeforces#P1141F1 Same Sum Blocks (Easy)
|
0 / 0 |
6 |
|
4046 |
codeforces#P1141F2 Same Sum Blocks (Hard)
|
0 / 0 |
6 |
|
4045 |
codeforces#P1141G Privatization of Roads in Treeland
|
0 / 0 |
6 |
|
4032 |
codeforces#P1144E Median String
|
0 / 0 |
6 |
|
4013 |
codeforces#P1147B Chladni Figure
|
0 / 0 |
6 |
|
3977 |
codeforces#P1153D Serval and Rooted Tree
|
0 / 0 |
6 |
|
3964 |
codeforces#P1155D Beautiful Array
|
0 / 0 |
6 |
|
3950 |
codeforces#P1157D N Problems During K Days
|
0 / 0 |
6 |
|
3932 |
codeforces#P1163C1 Power Transmission (Easy Edition)
|
0 / 0 |
6 |
|
3931 |
codeforces#P1163C2 Power Transmission (Hard Edition)
|
0 / 0 |
6 |
|
3906 |
codeforces#P1168B Good Triple
|
0 / 0 |
6 |
|
3890 |
codeforces#P1172B Nauuo and Circle
|
0 / 0 |
6 |
|
3879 |
codeforces#P1174D Ehab and the Expected XOR Problem
|
0 / 0 |
6 |
|
3873 |
codeforces#P1175D Array Splitting
|
0 / 0 |
6 |
|
3857 |
codeforces#P1178E Archaeology
|
0 / 0 |
6 |
|
3843 |
codeforces#P1181C Flag
|
0 / 0 |
6 |
|
3826 |
codeforces#P1183H Subsequences (hard version)
|
0 / 0 |
6 |
|
3814 |
codeforces#P1184E1 Daleks' Invasion (easy)
|
0 / 0 |
6 |
|
3743 |
codeforces#P1197D Yet Another Subarray Problem
|
0 / 0 |
6 |
|
3729 |
codeforces#P1200D White Lines
|
0 / 0 |
6 |
|
3717 |
codeforces#P1202D Print a 1337-string...
|
0 / 0 |
6 |
|
3699 |
codeforces#P1205B Shortest Cycle
|
0 / 0 |
6 |
|
3688 |
codeforces#P1207E XOR Guessing
|
0 / 0 |
6 |
|
3682 |
codeforces#P1208D Restore Permutation
|
0 / 0 |
6 |
|
3645 |
codeforces#P1213E Two Small Strings
|
0 / 0 |
6 |
|
3639 |
codeforces#P1214D Treasure Island
|
0 / 0 |
6 |
|
3624 |
codeforces#P1216E1 Numerical Sequence (easy version)
|
0 / 0 |
6 |
|
3601 |
codeforces#P1220D Alex and Julian
|
0 / 0 |
6 |
|
3563 |
codeforces#P1228D Complete Tripartite
|
0 / 0 |
6 |
|
3540 |
codeforces#P1237C2 Balanced Removals (Harder)
|
0 / 0 |
6 |
|
3531 |
codeforces#P1238D AB-string
|
0 / 0 |
6 |
|
3519 |
codeforces#P1242B 0-1 MST
|
0 / 0 |
6 |
|
3502 |
codeforces#P1245D Shichikuji and Power Grid
|
0 / 0 |
6 |
|
3469 |
codeforces#P1251D Salary Changing
|
0 / 0 |
6 |
|
3422 |
codeforces#P1260D A Game with Traps
|
0 / 0 |
6 |
|
3411 |
codeforces#P1264B Beautiful Sequence
|
0 / 0 |
6 |
|
3372 |
codeforces#P1270D Strange Device
|
0 / 0 |
6 |
|
3356 |
codeforces#P1272E Nearest Opposite Parity
|
0 / 0 |
6 |
|
3353 |
codeforces#P1276B Two Fairs
|
0 / 0 |
6 |
|
3346 |
codeforces#P1277D Let's Play the Words?
|
0 / 0 |
6 |
|
3303 |
codeforces#P1285D Dr
|
0 / 0 |
6 |
|
3264 |
codeforces#P1294E Obtain a Permutation
|
0 / 0 |
6 |