Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
< 1 2 3 ... 89 90 91 92 93 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1299 | Interactive Game with Coloring | brute force constructive algorithms graphs implementation interactive math trees | Statement | E | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 2400 | |
| 529 | Last Man Standing | data structures number theory | Statement | F | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 2800 | |
| 23469 | Rigged! | greedy | Statement | A | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 800 | |
| 23029 | Chips on the Board | constructive algorithms greedy | Statement | B | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 900 | |
| 26089 | Three Threadlets | math | Statement | B | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 17527 | Perfect Square | brute force implementation | Statement | C | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 7319 | Minimum Maximum Distance | dfs and similar dp graphs shortest paths trees | Statement | F | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 34627 | Don't Try to Count | brute force strings | Statement | A | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 18675 | Divide and Equalize | math number theory | Statement | D | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 15605 | Block Sequence | dp | Statement | E | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 2470 | Anya and the Mysterious String | binary search data structures implementation | Statement | G | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 304 | Two Permutations (Hard Version) | constructive algorithms | Statement | E2 | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 1053 | Two Permutations (Easy Version) | brute force constructive algorithms greedy number theory | Statement | E1 | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 5717 | Tree XOR | bitmasks dfs and similar dp greedy trees | Statement | D | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 15869 | Sets and Union | bitmasks brute force constructive algorithms greedy | Statement | B | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 1000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 25685 | Increasing Sequence | greedy | Statement | A | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 500.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 12842 | Card Game | dp greedy | Statement | C | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 1500.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 10024 | You Are So Beautiful | data structures | Statement | F | Codeforces Round 905 (Div. 3) {1883} | PROGRAMMING | 2750.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 30143 | Raspberries | math | Statement | C | Codeforces Round 905 (Div. 3) {1883} | PROGRAMMING | 1500.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 26300 | Morning | math | Statement | A | Codeforces Round 905 (Div. 3) {1883} | PROGRAMMING | 500.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 8487 | Look Back | bitmasks greedy | Statement | E | Codeforces Round 905 (Div. 3) {1883} | PROGRAMMING | 2500.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 12270 | In Love | data structures | Statement | D | Codeforces Round 905 (Div. 3) {1883} | PROGRAMMING | 1750.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 5616 | Dances (Hard Version) | binary search | Statement | G2 | Codeforces Round 905 (Div. 3) {1883} | PROGRAMMING | 2000.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 12033 | Dances (Easy version) | binary search | Statement | G1 | Codeforces Round 905 (Div. 3) {1883} | PROGRAMMING | 1750.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 35435 | Chemistry | strings | Statement | B | Codeforces Round 905 (Div. 3) {1883} | PROGRAMMING | 1000.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 17756 | Simple Design | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 500.0 | Codeforces Round #904 (Div. 2) Editorial | |
| 6344 | Medium Design | data structures dp sortings | Statement | C | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 1750.0 | Codeforces Round #904 (Div. 2) Editorial | |
| 13007 | Haunted House | greedy math two pointers | Statement | B | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 1000.0 | Codeforces Round #904 (Div. 2) Editorial | |
| 327 | Hard Design | implementation | Statement | E | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 3000.0 | Codeforces Round #904 (Div. 2) Editorial | |
| 3374 | Counting Rhyme | brute force combinatorics dp math number theory sortings | Statement | D | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 2500.0 | Codeforces Round #904 (Div. 2) Editorial | |
| 0 | Deterministic Scheduling for Extended Reality over 5G and Beyond | *special | Statement | A | ICPC 2023 Online Challenge powered by Huawei {1885} | PROGRAMMING | |||
| 26223 | Sum of Three | brute force constructive algorithms math | Statement | A | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 3688 | Monocarp and the Set | brute force combinatorics math | Statement | D | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 1551 | I Wanna be the Team Leader | bitmasks dp two pointers | Statement | E | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 16582 | Fear of the Dark | binary search geometry math | Statement | B | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 195 | Diamond Theft | data structures greedy | Statement | F | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 12205 | Decreasing String | constructive algorithms strings | Statement | C | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 3153 | Time Travel | binary search graphs implementation shortest paths | Statement | B | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 750.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 1006 | Split | binary search data structures divide and conquer math two pointers | Statement | D | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 1250.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 184 | Minimum Segments | constructive algorithms | Statement | F | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 2750.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 1834 | Minimum Array | constructive algorithms data structures two pointers | Statement | C | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 1000.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 391 | Good Colorings | binary search constructive algorithms graphs interactive | Statement | E | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 2000.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 13677 | Qingshan Loves Strings 2 | constructive algorithms greedy | Statement | A | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 750.0 | Codeforces Round 906 Editorial | |
| 645 | Game of Stacks | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 2000.0 | Codeforces Round 906 Editorial | |
| 117 | Doremy's Swapping Trees | dfs and similar graphs trees | Statement | E | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 3500.0 | Codeforces Round 906 Editorial | |
| 1048 | Doremy's Drying Plan (Hard Version) | data structures dp | Statement | C2 | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 1500.0 | Codeforces Round 906 Editorial | |
| 3411 | Doremy's Drying Plan (Easy Version) | brute force data structures dp greedy sortings | Statement | C1 | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 750.0 | Codeforces Round 906 Editorial | |
| 7623 | Doremy's Connecting Plan | greedy sortings | Statement | B | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 1250.0 | Codeforces Round 906 Editorial | |
| 86 | Doremy's Average Tree | dp trees | Statement | F | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 3500.0 | Codeforces Round 906 Editorial | |
| 17802 | Qingshan Loves Strings | implementation | Statement | B | Codeforces Round 906 (Div. 2) {1890} | PROGRAMMING | 750.0 | Codeforces Round 906 Editorial | |
| 29642 | Doremy's Paint 3 | constructive algorithms | Statement | A | Codeforces Round 906 (Div. 2) {1890} | PROGRAMMING | 500.0 | Codeforces Round 906 Editorial | |
| 4070 | Suspicious logarithms | binary search brute force implementation math number theory | Statement | D | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 1500.0 | ||
| 19486 | Sorting with Twos | constructive algorithms sortings | Statement | A | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 500.0 | ||
| 14274 | Smilo and Monsters | constructive algorithms greedy sortings two pointers | Statement | C | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 1000.0 | ||
| 19341 | Deja Vu | math sortings | Statement | B | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 750.0 | ||
| 867 | Brukhovich and Exams | brute force greedy math sortings | Statement | E | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 2000.0 | ||
| 3959 | A Growing Tree | data structures dfs and similar trees | Statement | F | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 2250.0 | ||
| 9191 | Neutral Tonality | constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 1000.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 2806 | Freedom of Choice | brute force greedy implementation | Statement | C | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 1250.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 945 | Colorful Constructive | constructive algorithms greedy math | Statement | D | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 2250.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 203 | Cacti Symphony | combinatorics dfs and similar dp graphs | Statement | E | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 2750.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 12797 | Anonymous Informant | brute force implementation | Statement | A | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 500.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 16452 | Two Out of Three | constructive algorithms | Statement | B | Codeforces Round 908 (Div. 2) {1894} | PROGRAMMING | 750.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 19246 | Secret Sport | implementation | Statement | A | Codeforces Round 908 (Div. 2) {1894} | PROGRAMMING | 500.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 6245 | XOR Construction | bitmasks constructive algorithms data structures math trees | Statement | D | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 204 | Two Characters, Two Colors | binary search data structures dp flows geometry | Statement | G | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 24694 | Treasure Chest | math | Statement | A | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 11614 | Torn Lucky Ticket | brute force dp hashing implementation math | Statement | C | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 20663 | Points and Minimum Distance | greedy math sortings | Statement | B | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 1612 | Infinite Card Game | brute force dfs and similar games graphs greedy sortings | Statement | E | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 795 | Fancy Arrays | combinatorics math matrices | Statement | F | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 2307 | Permutation Sorting | data structures divide and conquer sortings | Statement | E | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 2250.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 353 | Pepe Racing | constructive algorithms interactive sortings | Statement | G | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 3250.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 6015 | Ones and Twos | data structures math two pointers | Statement | D | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 2000.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 10071 | Matching Arrays | binary search constructive algorithms greedy sortings | Statement | C | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 1500.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 27375 | Jagged Swaps | sortings | Statement | A | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 500.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 109 | Cyclic Hamming (Hard Version) | dp fft math number theory | Statement | H2 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 1000.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 96 | Cyclic Hamming (Easy Version) | divide and conquer dp fft math number theory | Statement | H1 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 4000.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 770 | Bracket Xoring | constructive algorithms implementation | Statement | F | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 2750.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 15443 | AB Flipping | greedy strings | Statement | B | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 1000.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 831 | Vova Escapes the Matrix | dfs and similar shortest paths | Statement | F | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 2500.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 2370 | Sofia and Strings | data structures greedy strings | Statement | E | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 2000.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 16286 | Milica and String | brute force implementation strings | Statement | A | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 500.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 12465 | Milena and Admirer | greedy math | Statement | B | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 5753 | Colorful Grid | constructive algorithms implementation | Statement | C | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 1750.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 5466 | Absolute Beauty | greedy math | Statement | D | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 1750.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 13961 | Yarik and Musical Notes | math number theory | Statement | D | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 22742 | Yarik and Array | greedy two pointers | Statement | C | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 3365 | Unusual Entertainment | data structures dfs and similar ds shortest paths sortings trees | Statement | G | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 16097 | Queue Sort | greedy implementation sortings | Statement | E | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 50939 | Game with Integers | games math number theory | Statement | A | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 8062 | Alex's whims | constructive algorithms graphs shortest paths trees | Statement | F | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 22064 | 250 Thousand Tons of TNT | brute force implementation number theory | Statement | B | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 2177 | Transitive Graph | constructive algorithms dfs and similar dp graphs implementation | Statement | E | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 2250.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 4426 | Small GCD | brute force math number theory | Statement | D | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 2000.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 300 | Local Deletions | data structures implementation | Statement | F | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 3000.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 18146 | Laura and Operations | dp math | Statement | B | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 1000.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 31478 | Cover in Water | constructive algorithms implementation | Statement | A | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 500.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 11999 | Anji's Binary Tree | dfs and similar dp shortest paths trees | Statement | C | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 1250.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 7305 | Yet Another Monster Fight | binary search greedy implementation math | Statement | D | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial |