|
3343 |
P869C The Intriguing Obsession
|
1 / 1 |
6 |
|
3330 |
P873D Merge Sort
|
0 / 0 |
6 |
|
3299 |
P883H Palindromic Cut
|
0 / 0 |
6 |
|
3296 |
P883K Road Widening
|
0 / 0 |
6 |
|
3271 |
P888E Maximum Subsequence
|
2 / 3 |
6 |
|
3253 |
P894B Ralph And His Magic Field
|
0 / 0 |
6 |
|
3228 |
P899D Shovel Sale
|
1 / 2 |
6 |
|
3189 |
P909C Python Indentation
|
0 / 0 |
6 |
|
3179 |
P911D Inversion Counting
|
0 / 0 |
6 |
|
3167 |
P913D Too Easy Problems
|
0 / 0 |
6 |
|
3160 |
P914C Travelling Salesman and Special Numbers
|
0 / 0 |
6 |
|
3142 |
P917A The Monster
|
0 / 0 |
6 |
|
3105 |
P922D Robot Vacuum Cleaner
|
0 / 0 |
6 |
|
3100 |
P923C Perfect Security
|
0 / 0 |
6 |
|
3083 |
P926B Add Points
|
0 / 0 |
6 |
|
3050 |
P933A A Twisty Movement
|
0 / 0 |
6 |
|
3020 |
P939E Maximize!
|
0 / 0 |
6 |
|
3009 |
P946D Timetable
|
0 / 0 |
6 |
|
2994 |
P952D I'm Feeling Lucky!
|
0 / 0 |
6 |
|
2960 |
P958F2 Lightsabers (medium)
|
0 / 0 |
6 |
|
2929 |
P963A Alternating Sum
|
0 / 0 |
6 |
|
2890 |
P979B Treasure Hunt
|
0 / 0 |
6 |
|
2865 |
P983B XOR-pyramid
|
0 / 0 |
6 |
|
2851 |
P986B Petr and Permutations
|
0 / 0 |
6 |
|
2840 |
P988D Points and Powers of Two
|
0 / 0 |
6 |
|
2835 |
P989C A Mist of Florescence
|
0 / 0 |
6 |
|
2821 |
P991E Bus Number
|
0 / 0 |
6 |
|
2758 |
P1002C2 Distinguish zero state and plus state without errors
|
0 / 0 |
6 |
|
2737 |
P1005E1 Median on Segments (Permutations Edition)
|
0 / 0 |
6 |
|
2713 |
P1010B Rocket
|
0 / 0 |
6 |
|
2712 |
P1010C Border
|
0 / 0 |
6 |
|
2689 |
P1016C Vasya And The Mushrooms
|
0 / 0 |
6 |
|
2688 |
P1016D Vasya And The Matrix
|
0 / 0 |
6 |
|
2631 |
P1030D Vasya and Triangle
|
0 / 0 |
6 |
|
2609 |
P1034A Enlarge GCD
|
0 / 0 |
6 |
|
2584 |
P1038D Slime
|
0 / 0 |
6 |
|
2565 |
P1042D Petya and Array
|
1 / 1 |
6 |
|
2478 |
P1062D Fun with Integers
|
0 / 0 |
6 |
|
2474 |
P1063B Labyrinth
|
0 / 0 |
6 |
|
2457 |
P1066D Boxes Packing
|
0 / 0 |
6 |
|
2454 |
P1067B Multihedgehog
|
0 / 0 |
6 |
|
2430 |
P1073C Vasya and Robot
|
0 / 0 |
6 |
|
2421 |
P1076D Edge Deletion
|
0 / 0 |
6 |
|
2413 |
P1077E Thematic Contests
|
0 / 0 |
6 |
|
2399 |
P1081D Maximum Distance
|
0 / 0 |
6 |
|
2391 |
P1082D Maximum Diameter Graph
|
0 / 0 |
6 |
|
2387 |
P1083A The Fair Nut and the Best Path
|
0 / 0 |
6 |
|
2355 |
P1090D Similar Arrays
|
0 / 0 |
6 |
|
2321 |
P1096D Easy Problem
|
0 / 0 |
6 |
|
2258 |
P1107D Compression
|
0 / 0 |
6 |