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 ... 71 72 73 74 75 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 25702 | Balanced Substring | implementation | Statement | A | Educational Codeforces Round 113 (Rated for Div. 2) {1569} | PROGRAMMING | 94721 | ||
| 359 | Yellow Cards | *special math | Statement | B | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING | |||
| 143 | XOR Guessing | *special interactive | Statement | G | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING | |||
| 190 | Square Filling | *special | Statement | F | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING | |||
| 294 | Shooting | *special greedy implementation | Statement | C | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING | |||
| 273 | Reachable Numbers | *special implementation | Statement | D | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING | |||
| 11 | Minimum Difference | *special | Statement | I | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING | |||
| 271 | Erasing Zeroes | *special strings | Statement | E | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING | |||
| 20 | Chainword | *special data structures strings | Statement | H | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING | |||
| 807 | A+B (Trial Problem) | *special | Statement | A | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING | |||
| 43 | Two Railroads | *special | Statement | J | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 340 | Sweepstake | *special brute force constructive algorithms implementation math | Statement | D | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 1371 | Sequence of Comparisons | *special | Statement | A | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 385 | Rhyme | *special implementation | Statement | C | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 61 | Physical Examination | *special binary search data structures | Statement | I | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 51 | Laser Beams | *special geometry probabilities | Statement | H | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 209 | Kotlinforces | *special constructive algorithms dp | Statement | F | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 345 | Fix the String | *special bitmasks dp greedy | Statement | E | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 726 | Epic Novel | *special math | Statement | B | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 78 | A Battle Against a Dragon | *special data structures dp | Statement | G | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 9265 | Book | binary search data structures dp graphs implementation | Statement | A | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 500.0 | Tutorial | 1800 |
| 1873 | Xor of 3 | brute force constructive algorithms greedy | Statement | B | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 1250.0 | Tutorial | 2500 |
| 1521 | Paint | dp greedy | Statement | C | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 1750.0 | Tutorial | 2700 |
| 527 | Bridge Club | flows graphs greedy | Statement | D | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 2500.0 | Tutorial | 2800 |
| 318 | Polygon | binary search dp | Statement | E | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 2500.0 | Tutorial | 3000 |
| 286 | Stations | data structures | Statement | F | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 3250.0 | Tutorial | 3400 |
| 14839 | Swaps | greedy math | Statement | B | Codeforces Round 743 (Div. 2) {1573} | PROGRAMMING | 1000.0 | Tutorial | 1400 |
| 21284 | Countdown | greedy | Statement | A | Codeforces Round 743 (Div. 2) {1573} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 4557 | The Strongest Build | data structures dfs and similar graphs greedy hashing implementation shortest paths | Statement | D | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 17391 | Slay the Dragon | binary search greedy sortings | Statement | C | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 22092 | Regular Bracket Sequences | constructive algorithms | Statement | A | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 639 | Occurrences | combinatorics dp ds fft graphs | Statement | F | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 17507 | Combinatorics Homework | combinatorics greedy math | Statement | B | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 928 | Coloring | combinatorics constructive algorithms implementation | Statement | E | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 254 | Managing Telephone Poles | Statement | M | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | |||
| 1446 | Longest Array Deconstruction | data structures divide and conquer dp sortings | Statement | L | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 725 | Knitting Batik | implementation math | Statement | K | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 3905 | Jeopardy of Dropped Balls | brute force ds implementation | Statement | J | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 929 | Illusions of the Desert | data structures trees | Statement | I | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 637 | Holiday Wall Ornaments | strings | Statement | H | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 725 | GCD Festival | math | Statement | G | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 122 | Finding Expected Value | math | Statement | F | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 339 | Eye-Pleasing City Park Tour | Statement | E | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | |||
| 2659 | Divisible by Twenty-Five | brute force dfs and similar dp | Statement | D | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 167 | Cyclic Sum | data structures | Statement | C | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 481 | Building an Amusement Park | binary search geometry | Statement | B | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 4686 | Another Sorting Problem | data structures sortings strings | Statement | A | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 0 | Communication Routing Challenge | *special | Statement | A | 2021 ICPC Communication Routing Challenge: Marathon {1576} | PROGRAMMING | |||
| 457 | The Mind | constructive algorithms interactive probabilities | Statement | M | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 1241 | Labyrinth | binary search ds | Statement | L | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 371 | Kingdom of Islands | graphs implementation | Statement | K | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 240 | Just Kingdom | data structures dfs and similar | Statement | J | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 63 | Interactive Rays | geometry interactive | Statement | I | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 2049 | Higher Order Functions | implementation strings | Statement | H | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 40 | Game of Chance | math probabilities | Statement | G | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 164 | Framing Pictures | geometry | Statement | F | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 3868 | Easy Scheduling | implementation math | Statement | E | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 46 | Dragon Curve | Statement | D | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | |||
| 10 | Cactus Lady and her Cing | Statement | C | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | |||
| 340 | Building Forest Trails | data structures ds | Statement | B | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 367 | Anti-Tetris | constructive algorithms graphs shortest paths | Statement | A | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 10719 | Ticks | brute force dp greedy implementation | Statement | C | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 18279 | Shifting Sort | implementation sortings | Statement | B | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 16362 | Productive Meeting | graphs greedy | Statement | D | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 22045 | Permutation Minimization by Deque | constructive algorithms greedy math | Statement | E1 | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 2456 | Minimal Coverage | binary search dp greedy | Statement | G | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 39475 | Casimir's String Solitaire | math strings | Statement | A | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 4868 | Array Stabilization (AND version) | binary search brute force graphs greedy implementation math number theory shortest paths | Statement | F | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 6786 | Array Optimization by Deque | data structures greedy | Statement | E2 | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 3729 | Portal | brute force dp greedy implementation | Statement | A | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 500.0 | Codeforces Round #745 Editorial | 1700 |
| 1860 | Train Maintenance | brute force data structures implementation | Statement | C | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 1750.0 | Codeforces Round #745 Editorial | 2200 |
| 1080 | Mathematics Curriculum | combinatorics dp trees | Statement | B | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 2600 |
| 960 | Subsequence | divide and conquer dp trees | Statement | D | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 2000.0 | Codeforces Round #745 Editorial | 2900 |
| 136 | Problems for Codeforces | fft math | Statement | F | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 3500.0 | Codeforces Round #745 Editorial | 3300 |
| 77 | Railway Construction | brute force constructive algorithms data structures graphs shortest paths | Statement | E | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 3500.0 | Codeforces Round #745 Editorial | 3400 |
| 11614 | Diameter of Graph | constructive algorithms graphs greedy math | Statement | B | Codeforces Round 745 (Div. 2) {1581} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 1200 |
| 13560 | CQXYM Count Permutations | math | Statement | A | Codeforces Round 745 (Div. 2) {1581} | PROGRAMMING | 500.0 | Codeforces Round #745 Editorial | 800 |
| 10743 | Vupsen, Pupsen and 0 | constructive algorithms math | Statement | D | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 1750.0 | Codeforces Round #750 (Div.2) Editorial | |
| 3834 | Pchelyonok and Segments | binary search data structures dp greedy math | Statement | E | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 2500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 21878 | Luntik and Subsequences | combinatorics math | Statement | B | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 750.0 | Codeforces Round #750 (Div.2) Editorial | |
| 18704 | Luntik and Concerts | math | Statement | A | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 603 | Kuzya and Homework | data structures number theory | Statement | G | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 3250.0 | Codeforces Round #750 (Div.2) Editorial | |
| 1877 | Korney Korneevich and XOR (hard version) | binary search brute force dp two pointers | Statement | F2 | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 1500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 5815 | Korney Korneevich and XOR (easy version) | bitmasks dp | Statement | F1 | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 2000.0 | Codeforces Round #750 (Div.2) Editorial | |
| 16558 | Grandma Capa Knits a Scarf | data structures greedy strings two pointers | Statement | C | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 1500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 13825 | Windblume Ode | math number theory | Statement | A | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 500.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 346 | Omkar and Tours | sortings trees | Statement | H | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 3500.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 470 | Omkar and Time Travel | data structures math | Statement | G | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 3000.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 5467 | Omkar and the Meaning of Life | constructive algorithms interactive | Statement | D | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 1750.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 12449 | Omkar and Heavenly Tree | constructive algorithms trees | Statement | B | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 1000.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 7011 | Omkar and Determination | data structures dp | Statement | C | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 1500.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 2268 | Moment of Bloom | constructive algorithms dfs and similar graph matchings graphs greedy | Statement | E | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 2250.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 1358 | Defender of Childhood Dreams | bitmasks constructive algorithms divide and conquer | Statement | F | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 2750.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 13540 | Coloring Rectangles | greedy | Statement | B | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 500.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 1000 |
| 3730 | Guess the Permutation | binary search combinatorics interactive math | Statement | D | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 1500.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2000 |
| 1317 | Game with Stones | binary search data structures games greedy | Statement | E | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 2000.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2300 |
| 1005 | Strange LCS | bitmasks dp graphs greedy strings | Statement | F | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 2500.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2600 |
| 218 | Eligible Segments | geometry | Statement | G | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 3250.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 3200 |
| 14997 | Mathematical Addition | math | Statement | A | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 500.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 800 |
| 16718 | Two Arrays | greedy math sortings | Statement | C | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 1000.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 900 |