|
4500 |
codeforces#P1045B Space Isaac
|
0 / 0 |
9 |
|
4494 |
codeforces#P1045H Self-exploration
|
0 / 0 |
9 |
|
4481 |
codeforces#P1051F The Shortest Statement
|
0 / 0 |
9 |
|
4474 |
codeforces#P1054E Chips Puzzle
|
0 / 0 |
9 |
|
4467 |
codeforces#P1055D Refactoring
|
0 / 0 |
9 |
|
4448 |
codeforces#P1059E Split the Tree
|
0 / 0 |
9 |
|
4434 |
codeforces#P1061F Lost Root
|
0 / 0 |
9 |
|
4397 |
codeforces#P1070B Berkomnadzor
|
0 / 0 |
9 |
|
4390 |
codeforces#P1070I Privatization of Roads in Berland
|
0 / 0 |
9 |
|
4356 |
codeforces#P1080E Sonya and Matrix Beauty
|
0 / 0 |
9 |
|
4355 |
codeforces#P1080F Katya and Segments Sets
|
0 / 0 |
9 |
|
4340 |
codeforces#P1082G Petya and Graph
|
0 / 0 |
9 |
|
4335 |
codeforces#P1083E The Fair Nut and Rectangles
|
0 / 0 |
9 |
|
4318 |
codeforces#P1088E Ehab and a component choosing problem
|
0 / 0 |
9 |
|
4306 |
codeforces#P1089K King Kog's Reception
|
0 / 0 |
9 |
|
4301 |
codeforces#P1090C New Year Presents
|
0 / 0 |
9 |
|
4286 |
codeforces#P1091E New Year and the Acquaintance Estimation
|
0 / 0 |
9 |
|
4271 |
codeforces#P1093E Intersection of Permutations
|
0 / 0 |
9 |
|
4270 |
codeforces#P1093F Vasya and Array
|
0 / 0 |
9 |
|
4256 |
codeforces#P1096G Lucky Tickets
|
0 / 0 |
9 |
|
4245 |
codeforces#P1098C Construct a tree
|
0 / 0 |
9 |
|
4238 |
codeforces#P1099F Cookies
|
0 / 0 |
9 |
|
4226 |
codeforces#P1101F Trucks and Cities
|
0 / 0 |
9 |
|
4201 |
codeforces#P1106F Lunar New Year and a Recursive Sequence
|
0 / 0 |
9 |
|
4196 |
codeforces#P1107E Vasya and Binary String
|
0 / 0 |
9 |
|
4194 |
codeforces#P1107G Vasya and Maximum Profit
|
0 / 0 |
9 |
|
4183 |
codeforces#P1109D Sasha and Interesting Fact from Graph Theory
|
0 / 0 |
9 |
|
4160 |
codeforces#P1114F Please, another Queries on Array?
|
0 / 0 |
9 |
|
4105 |
codeforces#P1129C Morse Code
|
0 / 0 |
9 |
|
4086 |
codeforces#P1132G Greedy Subsequences
|
0 / 0 |
9 |
|
4070 |
codeforces#P1137D Cooperative Game
|
0 / 0 |
9 |
|
4061 |
codeforces#P1139E Maximize Mex
|
0 / 0 |
9 |
|
4042 |
codeforces#P1142C U2
|
0 / 0 |
9 |
|
4030 |
codeforces#P1144G Two Merged Sequences
|
0 / 0 |
9 |
|
4018 |
codeforces#P1146E Hot is Cold
|
0 / 0 |
9 |
|
4011 |
codeforces#P1147D Palindrome XOR
|
0 / 0 |
9 |
|
3983 |
codeforces#P1152E Neko and Flashback
|
0 / 0 |
9 |
|
3929 |
codeforces#P1163E Magical Permutation
|
0 / 0 |
9 |
|
3915 |
codeforces#P1166F Vicky's Delivery Service
|
0 / 0 |
9 |
|
3877 |
codeforces#P1174F Ehab and the Big Finale
|
0 / 0 |
9 |
|
3836 |
codeforces#P1182D Complete Mirror
|
0 / 0 |
9 |
|
3812 |
codeforces#P1184E3 Daleks' Invasion (hard)
|
0 / 0 |
9 |
|
3798 |
codeforces#P1186F Vus the Cossack and a Graph
|
0 / 0 |
9 |
|
3794 |
codeforces#P1187D Subarray Sorting
|
0 / 0 |
9 |
|
3762 |
codeforces#P1194F Crossword Expert
|
0 / 0 |
9 |
|
3716 |
codeforces#P1202E You Are Given Some Strings...
|
0 / 0 |
9 |
|
3698 |
codeforces#P1205C Palindromic Paths
|
0 / 0 |
9 |
|
3664 |
codeforces#P1210D Konrad and Company Evaluation
|
0 / 0 |
9 |
|
3612 |
codeforces#P1218D Xor Spanning Tree
|
0 / 0 |
9 |
|
3592 |
codeforces#P1221F Choose a Square
|
0 / 0 |
9 |
|
3568 |
codeforces#P1227F2 Wrong Answer on test 233 (Hard Version)
|
0 / 0 |
9 |
|
3538 |
codeforces#P1237E Balanced Binary Search Trees
|
0 / 0 |
9 |
|
3524 |
codeforces#P1239D Catowice City
|
0 / 0 |
9 |
|
3518 |
codeforces#P1242C Sum Balance
|
0 / 0 |
9 |
|
3506 |
codeforces#P1244G Running in Pairs
|
0 / 0 |
9 |
|
3467 |
codeforces#P1251E2 Voting (Hard Version)
|
0 / 0 |
9 |
|
3460 |
codeforces#P1252F Regular Forestation
|
0 / 0 |
9 |
|
3427 |
codeforces#P1257F Make Them Similar
|
0 / 0 |
9 |
|
3421 |
codeforces#P1260E Tournament
|
0 / 0 |
9 |
|
3413 |
codeforces#P1263F Economic Difficulties
|
0 / 0 |
9 |
|
3410 |
codeforces#P1264C Beautiful Mirrors with queries
|
0 / 0 |
9 |
|
3320 |
codeforces#P1282E The Cake Is a Lie
|
0 / 0 |
9 |
|
3298 |
codeforces#P1286C1 Madhouse (Easy version)
|
0 / 0 |
9 |
|
3283 |
codeforces#P1290C Prefix Enlightenment
|
0 / 0 |
9 |
|
3204 |
codeforces#P1304F2 Animal Observation (hard version)
|
0 / 0 |
9 |
|
3121 |
codeforces#P1326E Bombs
|
0 / 0 |
9 |
|
3102 |
codeforces#P1329C Drazil Likes Heap
|
0 / 0 |
9 |
|
3078 |
codeforces#P1333E Road to 1600
|
0 / 0 |
9 |
|
3044 |
codeforces#P1340C Nastya and Unexpected Guest
|
0 / 0 |
9 |
|
3027 |
codeforces#P1343F Restore the Permutation by Sorted Segments
|
0 / 0 |
9 |
|
3005 |
codeforces#P1348E Phoenix and Berries
|
0 / 0 |
9 |
|
2932 |
codeforces#P1358E Are You Fired?
|
0 / 0 |
9 |
|
2876 |
codeforces#P1367F2 Flying Sort (Hard Version)
|
0 / 0 |
9 |
|
2862 |
codeforces#P1369E DeadLee
|
0 / 0 |
9 |
|
2855 |
codeforces#P1370F1 The Hidden Pair (Easy Version)
|
0 / 0 |
9 |
|
2835 |
codeforces#P1373F Network Coverage
|
0 / 0 |
9 |
|
2827 |
codeforces#P1374F Cyclic Shifts Sorting
|
0 / 0 |
9 |
|
2750 |
codeforces#P1392F Omkar and Landslide
|
0 / 0 |
9 |
|
2700 |
codeforces#P1401E Divide Square
|
0 / 0 |
9 |
|
2699 |
codeforces#P1401F Reverse and Swap
|
0 / 0 |
9 |
|
2695 |
codeforces#P1403A The Potion of Great Power
|
0 / 0 |
9 |
|
2671 |
codeforces#P1408E Avoid Rainbow Cycles
|
0 / 0 |
9 |
|
2629 |
codeforces#P1418E Expected Damage
|
0 / 0 |
9 |
|
2593 |
codeforces#P1423J Bubble Cup hypothesis
|
0 / 0 |
9 |
|
2559 |
codeforces#P1428F Fruit Sequences
|
0 / 0 |
9 |
|
2526 |
codeforces#P1436E Complicated Computations
|
0 / 0 |
9 |
|
2501 |
codeforces#P1442C Graph Transpositions
|
0 / 0 |
9 |
|
2494 |
codeforces#P1443E Long Permutation
|
0 / 0 |
9 |
|
2471 |
codeforces#P1450F The Struggling Contestant
|
0 / 0 |
9 |
|
2437 |
codeforces#P1455E Four Points
|
0 / 0 |
9 |
|
2408 |
codeforces#P1463E Plan of Lectures
|
0 / 0 |
9 |
|
2373 |
codeforces#P1469E A Bit Similar
|
0 / 0 |
9 |
|
2352 |
codeforces#P1473E Minimum Path
|
0 / 0 |
9 |
|
2301 |
codeforces#P1482F Useful Edges
|
0 / 0 |
9 |
|
2293 |
codeforces#P1485F Copy or Prefix Sum
|
0 / 0 |
9 |
|
2257 |
codeforces#P1491E Fib-tree
|
0 / 0 |
9 |
|
2237 |
codeforces#P1494E A-Z Graph
|
0 / 0 |
9 |
|
2210 |
codeforces#P1499E Chaotic Merge
|
0 / 0 |
9 |
|
2209 |
codeforces#P1499F Diameter Cuts
|
0 / 0 |
9 |
|
2086 |
codeforces#P1523D Love-Hate
|
0 / 0 |
9 |