|
2885 |
codeforces#P1366E Two Arrays
|
0 / 0 |
7 |
|
2884 |
codeforces#P1366F Jog Around The Graph
|
0 / 0 |
10 |
|
2883 |
codeforces#P1366G Construct the String
|
0 / 0 |
10 |
|
2878 |
codeforces#P1367E Necklace Assembly
|
0 / 0 |
6 |
|
2877 |
codeforces#P1367F1 Flying Sort (Easy Version)
|
0 / 0 |
7 |
|
2876 |
codeforces#P1367F2 Flying Sort (Hard Version)
|
0 / 0 |
9 |
|
2868 |
codeforces#P1368H1 Breadboard Capacity (easy version)
|
0 / 0 |
10 |
|
2863 |
codeforces#P1369D TediousLee
|
0 / 0 |
6 |
|
2861 |
codeforces#P1369F BareLee
|
0 / 0 |
10 |
|
2857 |
codeforces#P1370D Odd-Even Subsequence
|
0 / 0 |
7 |
|
2848 |
codeforces#P1371E2 Asterism (Hard Version)
|
0 / 0 |
8 |
|
2843 |
codeforces#P1372D Omkar and Circle
|
0 / 0 |
7 |
|
2842 |
codeforces#P1372E Omkar and Last Floor
|
0 / 0 |
10 |
|
2837 |
codeforces#P1373D Maximum Sum on Even Positions
|
0 / 0 |
5 |
|
2836 |
codeforces#P1373E Sum of Digits
|
0 / 0 |
8 |
|
2815 |
codeforces#P1379C Choosing flowers
|
0 / 0 |
7 |
|
2813 |
codeforces#P1379E Inverse Genealogy
|
0 / 0 |
10 |
|
2808 |
codeforces#P1380C Create The Teams
|
0 / 0 |
4 |
|
2805 |
codeforces#P1380F Strange Addition
|
0 / 0 |
10 |
|
2801 |
codeforces#P1381B Unmerge
|
0 / 0 |
6 |
|
2799 |
codeforces#P1381D The Majestic Brown Tree Snake
|
0 / 0 |
10 |
|
2796 |
codeforces#P1382B Sequential Nim
|
0 / 0 |
3 |
|
2794 |
codeforces#P1383B GameGame
|
0 / 0 |
6 |
|
2793 |
codeforces#P1383C String Transformation 2
|
0 / 0 |
10 |
|
2791 |
codeforces#P1383E Strange Operation
|
0 / 0 |
10 |
|
2788 |
codeforces#P1384B1 Koa and the Beach (Easy Version)
|
0 / 0 |
6 |
|
2787 |
codeforces#P1384B2 Koa and the Beach (Hard Version)
|
0 / 0 |
8 |
|
2783 |
codeforces#P1385D a-Good String
|
0 / 0 |
5 |
|
2776 |
codeforces#P1387A Graph
|
0 / 0 |
7 |
|
2775 |
codeforces#P1387B1 Village (Minimum)
|
0 / 0 |
7 |
|
2773 |
codeforces#P1387C Viruses
|
0 / 0 |
10 |
|
2766 |
codeforces#P1389B Array Walk
|
0 / 0 |
5 |
|
2765 |
codeforces#P1389C Good String
|
0 / 0 |
5 |
|
2762 |
codeforces#P1389F Bicolored Segments
|
0 / 0 |
10 |
|
2761 |
codeforces#P1389G Directing Edges
|
0 / 0 |
10 |
|
2758 |
codeforces#P1391C Cyclic Permutations
|
0 / 0 |
5 |
|
2757 |
codeforces#P1391D 505
|
0 / 0 |
7 |
|
2752 |
codeforces#P1392D Omkar and Bed Wars
|
0 / 0 |
5 |
|
2749 |
codeforces#P1392G Omkar and Pies
|
0 / 0 |
10 |
|
2748 |
codeforces#P1392H ZS Shuffles Cards
|
0 / 0 |
10 |
|
2743 |
codeforces#P1393D Rarity and New Dress
|
0 / 0 |
7 |
|
2742 |
codeforces#P1393E1 Twilight and Ancient Scroll (easier version)
|
0 / 0 |
10 |
|
2741 |
codeforces#P1393E2 Twilight and Ancient Scroll (harder version)
|
0 / 0 |
10 |
|
2740 |
codeforces#P1394A Boboniu Chats with Du
|
0 / 0 |
6 |
|
2737 |
codeforces#P1394D Boboniu and Jianghu
|
0 / 0 |
10 |
|
2733 |
codeforces#P1395C Boboniu and Bit Operations
|
0 / 0 |
5 |
|
2730 |
codeforces#P1396C Monster Invaders
|
0 / 0 |
8 |
|
2723 |
codeforces#P1398C Good Subarrays
|
0 / 0 |
5 |
|
2722 |
codeforces#P1398D Colored Rectangles
|
0 / 0 |
6 |
|
2720 |
codeforces#P1398F Controversial Rounds
|
0 / 0 |
9 |
|
2712 |
codeforces#P1399F Yet Another Segments Subset
|
0 / 0 |
8 |
|
2707 |
codeforces#P1400E Clear the Multiset
|
0 / 0 |
8 |
|
2706 |
codeforces#P1400F x-prime Substrings
|
0 / 0 |
10 |
|
2705 |
codeforces#P1400G Mercenaries
|
0 / 0 |
10 |
|
2701 |
codeforces#P1401D Maximum Distributed Tree
|
0 / 0 |
6 |
|
2696 |
codeforces#P1402C Star Trek
|
0 / 0 |
10 |
|
2693 |
codeforces#P1403C Chess Rush
|
0 / 0 |
10 |
|
2691 |
codeforces#P1404B Tree Tag
|
0 / 0 |
6 |
|
2684 |
codeforces#P1406B Maximum Product
|
0 / 0 |
4 |
|
2677 |
codeforces#P1407D Discrete Centrifugal Jumps
|
0 / 0 |
8 |
|
2676 |
codeforces#P1407E Egor in the Republic of Dagestan
|
0 / 0 |
9 |
|
2673 |
codeforces#P1408C Discrete Acceleration
|
0 / 0 |
5 |
|
2672 |
codeforces#P1408D Searchlights
|
0 / 0 |
7 |
|
2669 |
codeforces#P1408G Clusterization Counting
|
0 / 0 |
10 |
|
2667 |
codeforces#P1408I Bitwise Magic
|
0 / 0 |
10 |
|
2662 |
codeforces#P1409E Two Platforms
|
0 / 0 |
6 |
|
2661 |
codeforces#P1409F Subsequences of Length Two
|
0 / 0 |
7 |
|
2651 |
codeforces#P1413C Perform Easily
|
0 / 0 |
6 |
|
2645 |
codeforces#P1415C Bouncing Ball
|
0 / 0 |
4 |
|
2642 |
codeforces#P1415F Cakes for Clones
|
0 / 0 |
10 |
|
2639 |
codeforces#P1416C XOR Inverse
|
0 / 0 |
7 |
|
2637 |
codeforces#P1416E Split
|
0 / 0 |
10 |
|
2631 |
codeforces#P1418C Mortal Kombat Tower
|
0 / 0 |
5 |
|
2617 |
codeforces#P1420C1 Pokémon Army (easy version)
|
0 / 0 |
4 |
|
2616 |
codeforces#P1420C2 Pokémon Army (hard version)
|
0 / 0 |
7 |
|
2614 |
codeforces#P1420E Battle Lemmings
|
0 / 0 |
9 |
|
2609 |
codeforces#P1421E Swedish Heroes
|
0 / 0 |
10 |
|
2606 |
codeforces#P1422C Bargain
|
0 / 0 |
5 |
|
2604 |
codeforces#P1422E Minlexes
|
0 / 0 |
10 |
|
2593 |
codeforces#P1423J Bubble Cup hypothesis
|
0 / 0 |
9 |
|
2585 |
codeforces#P1425B Blue and Red of Our Faculty!
|
0 / 0 |
10 |
|
2583 |
codeforces#P1425D Danger of Mad Snakes
|
0 / 0 |
8 |
|
2573 |
codeforces#P1426F Number of Subsequences
|
0 / 0 |
7 |
|
2570 |
codeforces#P1427C The Hard Work of Paparazzi
|
0 / 0 |
7 |
|
2559 |
codeforces#P1428F Fruit Sequences
|
0 / 0 |
9 |
|
2558 |
codeforces#P1428G1 Lucky Numbers (Easy Version)
|
0 / 0 |
10 |
|
2557 |
codeforces#P1428G2 Lucky Numbers (Hard Version)
|
0 / 0 |
10 |
|
2550 |
codeforces#P1430F Realistic Gameplay
|
0 / 0 |
10 |
|
2549 |
codeforces#P1430G Yet Another DAG Problem
|
0 / 0 |
10 |
|
2542 |
codeforces#P1431G Number Deletion Game
|
0 / 0 |
7 |
|
2539 |
codeforces#P1431J Zero-XOR Array
|
0 / 0 |
10 |
|
2533 |
codeforces#P1433F Zero Remainder Sum
|
0 / 0 |
7 |
|
2522 |
codeforces#P1437C Chef Monocarp
|
0 / 0 |
6 |
|
2520 |
codeforces#P1437E Make It Increasing
|
0 / 0 |
8 |
|
2519 |
codeforces#P1437F Emotional Fishermen
|
0 / 0 |
10 |
|
2507 |
codeforces#P1439D INOI Final Contests
|
0 / 0 |
10 |
|
2503 |
codeforces#P1442A Extreme Subtraction
|
0 / 0 |
6 |
|
2500 |
codeforces#P1442D Sum
|
0 / 0 |
10 |
|
2499 |
codeforces#P1442E Black, White and Grey Tree
|
0 / 0 |
10 |
|
2496 |
codeforces#P1443B Saving the City
|
0 / 0 |
4 |