Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
< 1 2 3 ... 5 6 7 8 9 ... 12 13 14 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 24350 | Level Statistics | implementation math | Statement | A | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 104453 | Candies and Two Sisters | math | Statement | A | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 800 | |
| 12124 | Xenia and Colorful Gems | binary search greedy math sortings two pointers | Statement | B | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 750.0 | Codeforces Round #635 Editorial | 1800 |
| 831 | Chiori and Doll Picking (easy version) | bitmasks brute force combinatorics math | Statement | E1 | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1750.0 | Codeforces Round #635 Editorial | 2600 |
| 481 | Chiori and Doll Picking (hard version) | bitmasks brute force combinatorics math | Statement | E2 | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1500.0 | Codeforces Round #635 Editorial | 3400 |
| 42845 | Ichihime and Triangle | constructive algorithms math | Statement | A | Codeforces Round 635 (Div. 2) {1337} | PROGRAMMING | 500.0 | Codeforces Round #635 Editorial | 1000 |
| 36831 | Kana and Dragon Quest game | greedy implementation math | Statement | B | Codeforces Round 635 (Div. 2) {1337} | PROGRAMMING | 1000.0 | Codeforces Round #635 Editorial | 1000 |
| 3438 | Perfect Triples | bitmasks brute force constructive algorithms divide and conquer greedy implementation math | Statement | C | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 1500.0 | Editorial | |
| 9514 | Edge Weight Assignment | bitmasks constructive algorithms greedy math trees | Statement | B | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 1000.0 | Editorial | |
| 30274 | Powered Addition | greedy math | Statement | A | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 500.0 | Editorial | |
| 30412 | Nastya and Rice | math | Statement | A | Codeforces Round 637 (Div. 2) - Thanks, Ivan Belonogov! {1341} | PROGRAMMING | 500.0 | Codeforces Round #637 Editorial | |
| 46336 | Road To Zero | greedy math | Statement | A | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 1100 | |
| 14991 | Yet Another Counting Problem | math number theory | Statement | C | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 1700 | |
| 3541 | Placing Rooks | combinatorics fft math | Statement | E | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 2300 | |
| 64960 | Balanced Array | constructive algorithms math | Statement | B | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 800 | |
| 53300 | Candies | brute force math | Statement | A | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 900 | |
| 16491 | Hilbert's Hotel | math number theory sortings | Statement | A | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 500.0 | Codeforces Round #639 Editorial | 1600 |
| 1979 | Quantifier Question | dfs and similar dp graphs math | Statement | C | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 1500.0 | Codeforces Round #639 Editorial | 2600 |
| 1291 | Résumé Review | binary search greedy math | Statement | D | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 1750.0 | Codeforces Round #639 Editorial | 2700 |
| 28225 | Card Constructions | binary search brute force dp math | Statement | B | Codeforces Round 639 (Div. 2) {1345} | PROGRAMMING | 1000.0 | Codeforces Round #639 Editorial | 1100 |
| 24820 | Puzzle Pieces | math | Statement | A | Codeforces Round 639 (Div. 2) {1345} | PROGRAMMING | 500.0 | Codeforces Round #639 Editorial | 800 |
| 2197 | Color Revolution | *special math | Statement | A | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 1000 | |
| 414 | Magic Tricks | *special dp graphs | Statement | E | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 1700 | |
| 252 | Dune II: Battle For Arrakis | *special data structures greedy math | Statement | F | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 2000 | |
| 150 | Two IP Cameras | *special math number theory | Statement | G | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 2300 | |
| 9337 | Phoenix and Science | binary search bitmasks constructive algorithms greedy math | Statement | D | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 2000.0 | Codeforces Round #638 (Div. 2) Editorial | 1900 |
| 42798 | Phoenix and Balance | greedy math | Statement | A | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 500.0 | Codeforces Round #638 (Div. 2) Editorial | 800 |
| 21548 | Orac and LCM | data structures math number theory | Statement | A | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 500.0 | Codeforces Round #641 Editorial | 1600 |
| 8937 | Orac and Medians | constructive algorithms greedy math | Statement | B | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 1250.0 | Codeforces Round #641 Editorial | 2000 |
| 516 | Slime and Sequences (Easy Version) | dp fft math | Statement | F1 | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 1750.0 | Codeforces Round #641 Editorial | 3100 |
| 1049 | Slime and Biscuits | math probabilities | Statement | D | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 2000.0 | Codeforces Round #641 Editorial | 3200 |
| 134 | Slime and Sequences (Hard Version) | dp fft math | Statement | F2 | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 1750.0 | Codeforces Round #641 Editorial | 3500 |
| 29348 | Orac and Models | dp math number theory | Statement | B | Codeforces Round 641 (Div. 2) {1350} | PROGRAMMING | 1000.0 | Codeforces Round #641 Editorial | 1400 |
| 27347 | Orac and Factors | math | Statement | A | Codeforces Round 641 (Div. 2) {1350} | PROGRAMMING | 500.0 | Codeforces Round #641 Editorial | 900 |
| 18520 | Square? | brute force implementation math | Statement | B | Testing Round 16 (Unrated) {1351} | PROGRAMMING | 1000.0 | 900 | |
| 69546 | K-th Not Divisible by n | binary search math | Statement | C | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 1200 | |
| 44700 | Same Parity Summands | constructive algorithms math | Statement | B | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 1200 | |
| 19364 | Binary String Reconstruction | constructive algorithms dfs and similar math | Statement | F | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 1500 | |
| 103682 | Sum of Round Numbers | implementation math | Statement | A | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 800 | |
| 38807 | Board Moves | math | Statement | C | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 1000 | |
| 44537 | Most Unstable Array | constructive algorithms greedy math | Statement | A | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 800 | |
| 16355 | Simple Polygon Embedding | binary search geometry math ternary search | Statement | C1 | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 1400 | |
| 6369 | Not So Simple Polygon Embedding | binary search brute force geometry math | Statement | C2 | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2000 | |
| 24876 | Alarm Clock | math | Statement | A | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 900 | |
| 28766 | Sequence with Digits | brute force implementation math | Statement | A | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 750.0 | Codeforces Round #643 (Div. 2) Editorial | 1200 |
| 19042 | Game With Array | constructive algorithms math | Statement | D | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 1500.0 | Codeforces Round #643 (Div. 2) Editorial | 1400 |
| 11920 | Count Triangles | binary search implementation math two pointers | Statement | C | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 1250.0 | Codeforces Round #643 (Div. 2) Editorial | 1800 |
| 5826 | Restorer Distance | binary search greedy math sortings ternary search | Statement | E | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 2000.0 | Codeforces Round #643 (Div. 2) Editorial | 2100 |
| 18333 | Celex Update | math | Statement | C | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 1500.0 | Codeforces Round #645 (Div. 2) Editorial | 1600 |
| 43125 | Park Lighting | math | Statement | A | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 500.0 | Codeforces Round #645 (Div. 2) Editorial | 800 |
| 31709 | Berland Poker | brute force greedy math | Statement | A | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 1000 | |
| 15271 | Mixing Water | binary search math | Statement | C | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 1700 | |
| 6727 | Modular Stability | combinatorics math number theory | Statement | E | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 2000 | |
| 583 | RC Kaboom Show | binary search brute force data structures geometry math | Statement | F | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 2900 | |
| 42848 | Buying Shovels | math number theory | Statement | D | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1300 | |
| 8338 | A/B Matrix | constructive algorithms flows greedy math number theory | Statement | G | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1900 | |
| 56982 | Minimal Square | greedy math | Statement | A | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 800 | |
| 3847 | Johnny and Grandmaster | greedy implementation math sortings | Statement | B | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 1250.0 | Codeforces Round #647 Editorial | 1900 |
| 340 | Johnny and James | greedy implementation math trees | Statement | D | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 2500.0 | Codeforces Round #647 Editorial | 2900 |
| 172 | Johnny and New Toy | data structures implementation math | Statement | F | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 3500.0 | Codeforces Round #647 Editorial | 3300 |
| 23644 | Johnny and Another Rating Drop | bitmasks greedy math | Statement | C | Codeforces Round 647 (Div. 2) - Thanks, Algo Muse! {1362} | PROGRAMMING | 1500.0 | Codeforces Round #647 Editorial | 1400 |
| 40335 | Odd Selection | brute force implementation math | Statement | A | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 500.0 | 78202 | 1200 |
| 4408 | Guess The Maximums | binary search divide and conquer implementation interactive math | Statement | D | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 2000.0 | 78202 | 2100 |
| 1413 | Secure Password | bitmasks combinatorics constructive algorithms interactive math | Statement | G | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 3000.0 | Editorial — Codeforces Round #648 | 2800 |
| 32969 | Shovels and Swords | binary search greedy math | Statement | A | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 12305 | Two Divisors | constructive algorithms math number theory | Statement | D | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 14256 | Palindromic Paths | dsu greedy math | Statement | C | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 27852 | Shuffle | math two pointers | Statement | B | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 25086 | Social Distance | constructive algorithms greedy math | Statement | C | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 63750 | Even Array | greedy math | Statement | B | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 13586 | AND, OR and square sum | bitmasks greedy math | Statement | D | Codeforces Global Round 8 {1368} | PROGRAMMING | 1750.0 | Codeforces Global Round 8: editorial | |
| 21337 | Codeforces Subsequences | brute force constructive algorithms greedy math strings | Statement | B | Codeforces Global Round 8 {1368} | PROGRAMMING | 1000.0 | Codeforces Global Round 8: editorial | |
| 46148 | C+= | brute force greedy math | Statement | A | Codeforces Global Round 8 {1368} | PROGRAMMING | 500.0 | Codeforces Global Round 8: editorial | |
| 1105 | Lamps on a Circle | games greedy implementation interactive math | Statement | F | Codeforces Global Round 8 {1368} | PROGRAMMING | 3000.0 | Codeforces Global Round 8: editorial | |
| 20852 | RationalLee | greedy math sortings | Statement | C | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 1500.0 | Codeforces Round #652 (Div. 2) Editorial | 1400 |
| 9220 | TediousLee | dp graphs greedy math matrices trees | Statement | D | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 2000.0 | Codeforces Round #652 (Div. 2) Editorial | 1900 |
| 39093 | FashionabLee | geometry math | Statement | A | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 500.0 | Codeforces Round #652 (Div. 2) Editorial | 800 |
| 24995 | GCD Compression | brute force constructive algorithms math number theory | Statement | B | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 1000.0 | Editorial — Codeforces Round #651 | |
| 64158 | Maximum GCD | brute force greedy implementation number theory | Statement | A | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 500.0 | Editorial — Codeforces Round #651 | |
| 27068 | Number Game | games math number theory | Statement | C | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 1500.0 | Editorial — Codeforces Round #651 | |
| 2512 | Asterism (Hard Version) | binary search math number theory sortings | Statement | E2 | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1250.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 5525 | Asterism (Easy Version) | brute force combinatorics implementation math number theory sortings | Statement | E1 | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1500.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 21356 | A Cookie for You | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1250.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 13677 | Grid-00100 | constructive algorithms greedy math | Statement | D | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1500.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 19597 | Magical Calendar | constructive algorithms math | Statement | B | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1000.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 51173 | Magical Sticks | math | Statement | A | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 500.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 36271 | Omkar and Last Class of Math | constructive algorithms greedy math number theory | Statement | B | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 1000.0 | Codeforces Round #655 Editorial | 1300 |
| 19077 | Omkar and Baseball | constructive algorithms math | Statement | C | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 1500.0 | Codeforces Round #655 Editorial | 1500 |
| 5716 | Omkar and Circle | brute force constructive algorithms dp games greedy | Statement | D | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 2000.0 | Codeforces Round #655 Editorial | 2100 |
| 19351 | Pluses and Minuses | binary search dp greedy implementation math | Statement | C | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 2948 | Sum of Digits | brute force constructive algorithms dp greedy math number theory | Statement | E | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 29438 | Donut Shops | greedy implementation math | Statement | A | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 63946 | Required Remainder | math | Statement | A | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 71265 | Multiply by 2, divide by 6 | math | Statement | B | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 30977 | Zero Remainder Array | math sortings two pointers | Statement | D | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 2505 | Integer Game | brute force constructive algorithms games interactive math | Statement | F | Codeforces Global Round 9 {1375} | PROGRAMMING | 2000.0 | 79731 | |
| 277 | Cubic Lattice | geometry math matrices number theory | Statement | I | Codeforces Global Round 9 {1375} | PROGRAMMING | 4000.0 | 79731 | |
| 13177 | Dubious Cyrpto | binary search brute force math number theory | Statement | B | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 750.0 | Codeforces Round #657 Editorial | 1500 |
| 6077 | Choosing flowers | binary search data structures greedy math sortings two pointers | Statement | C | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 1250.0 | Codeforces Round #657 Editorial | 2000 |
| 472 | Inverse Genealogy | constructive algorithms divide and conquer dp math trees | Statement | E | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 2500.0 | Codeforces Round #657 Editorial | 2400 |
| 5002 | Berserk And Fireball | brute force greedy math | Statement | D | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 933 | Circular Dungeon | greedy math probabilities | Statement | G | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 9544 | Unmerge | combinatorics dp two pointers | Statement | B | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 1500.0 | Codeforces Round #658 Editorial | 1800 |
| 278 | Origami | geometry math sortings | Statement | E | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 3000.0 | Codeforces Round #658 Editorial | 3300 |
| 5435 | GameGame | bitmasks constructive algorithms dp games greedy math | Statement | B | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1000.0 | Codeforces Round #659 Editorial | |
| 43248 | Three Pairwise Maximums | math | Statement | A | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 800 | |
| 350 | Colors | *special binary search constructive algorithms interactive | Statement | A | Baltic Olympiad in Informatics 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1386} | PROGRAMMING | T | ||
| 141 | Mixture | *special data structures geometry math sortings | Statement | B | Baltic Olympiad in Informatics 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1386} | PROGRAMMING | T | ||
| 898 | Graph | *special dfs and similar dp math | Statement | A | Baltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1387} | PROGRAMMING | T | ||
| 22816 | Captain Flint and a Long Voyage | greedy math | Statement | B | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 1000.0 | Codeforces Round #660 Editorial | 1000 |
| 10409 | Uncle Bogdan and Country Happiness | dfs and similar dp greedy math trees | Statement | C | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 1500.0 | Codeforces Round #660 Editorial | 1800 |
| 25941 | Captain Flint and Crew Recruitment | brute force math number theory | Statement | A | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 750.0 | Codeforces Round #660 Editorial | 800 |
| 4549 | Segment Intersections | binary search brute force greedy implementation math | Statement | D | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 49719 | LCM Problem | constructive algorithms greedy math number theory | Statement | A | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 20290 | Array Walk | dp greedy math | Statement | B | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 3719 | Calendar Ambiguity | math number theory | Statement | E | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 15996 | Cyclic Permutations | combinatorics graphs math | Statement | C | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 1250.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 25056 | Suborrays | constructive algorithms math | Statement | A | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 500.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 2394 | Omkar and Landslide | binary search constructive algorithms greedy math | Statement | F | Codeforces Global Round 10 {1392} | PROGRAMMING | 2500.0 | Codeforces Global Round 10 — Editorial | |
| 3738 | Omkar and Duck | bitmasks constructive algorithms interactive math | Statement | E | Codeforces Global Round 10 {1392} | PROGRAMMING | 2000.0 | Codeforces Global Round 10 — Editorial | |
| 677 | Omkar and Pies | bitmasks dfs and similar dp math | Statement | G | Codeforces Global Round 10 {1392} | PROGRAMMING | 3000.0 | Codeforces Global Round 10 — Editorial | |
| 984 | ZS Shuffles Cards | combinatorics math probabilities | Statement | H | Codeforces Global Round 10 {1392} | PROGRAMMING | 3500.0 | Codeforces Global Round 10 — Editorial | |
| 9754 | Omkar and Bed Wars | constructive algorithms dp greedy math strings | Statement | D | Codeforces Global Round 10 {1392} | PROGRAMMING | 1500.0 | Codeforces Global Round 10 — Editorial | |
| 232 | Kevin and Grid | fft graphs math | Statement | I | Codeforces Global Round 10 {1392} | PROGRAMMING | 4000.0 | Codeforces Global Round 10 — Editorial | |
| 18887 | Omkar and Infinity Clock | implementation math | Statement | B | Codeforces Global Round 10 {1392} | PROGRAMMING | 750.0 | Codeforces Global Round 10 — Editorial | |
| 11044 | Pinkie Pie Eats Patty-cakes | binary search constructive algorithms data structures greedy math sortings | Statement | C | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 20829 | Rainbow Dash, Fluttershy and Chess Coloring | greedy math | Statement | A | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 500.0 | Codeforces Round #662 Editorial | |
| 15454 | Power Sequence | binary search brute force math number theory ternary search | Statement | B | Codeforces Round 666 (Div. 2) {1397} | PROGRAMMING | 1000.0 | Codeforces Round #666 — Editorial | |
| 36263 | Good Subarrays | binary search data structures dp math | Statement | C | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 2597 | Two Types of Spells | binary search data structures greedy implementation math sortings | Statement | E | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 1278 | Running Competition | bitmasks fft math number theory | Statement | G | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 28758 | Bad Triangle | geometry math | Statement | A | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 11686 | RPG Protagonist | binary search brute force greedy math | Statement | B | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 1158 | Mercenaries | bitmasks combinatorics data structures math two pointers | Statement | G | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 11376 | Zigzags | brute force data structures dp math two pointers | Statement | D | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 10518 | Maximum Distributed Tree | constructive algorithms dfs and similar greedy math number theory sortings trees | Statement | D | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1750.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 21768 | Ternary Sequence | constructive algorithms greedy math | Statement | B | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1000.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 26780 | Mere Array | constructive algorithms math number theory number theory sortings sortings | Statement | C | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 28619 | Distance and Axis | math number theory | Statement | A | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 1350 | Fancy Fence | *special data structures dp dsu math sortings | Statement | A | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 75 | Chess Rush | *special combinatorics dp implementation math | Statement | C | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 1269 | Game of Pairs | constructive algorithms dfs and similar interactive math number theory | Statement | D | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 2250.0 | Codeforces Round #668 Editorial | |
| 21900 | Permutation Forgery | constructive algorithms | Statement | A | Codeforces Round 668 (Div. 2) {1405} | PROGRAMMING | 500.0 | Codeforces Round #668 Editorial | |
| 3809 | Three Sequences | binary search data structures greedy math | Statement | D | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 2000.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 22917 | Subset Mex | greedy implementation math | Statement | A | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 500.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 18056 | Big Vova | brute force greedy math number theory | Statement | B | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 1000.0 | Codeforces Round #669 Editorial | |
| 14656 | Chocolate Bunny | constructive algorithms interactive math two pointers | Statement | C | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 1500.0 | Codeforces Round #669 Editorial | |
| 21349 | Ahahahahahahahaha | constructive algorithms math | Statement | A | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 500.0 | Codeforces Round #669 Editorial | |
| 9268 | Discrete Acceleration | binary search implementation math two pointers | Statement | C | Grakn Forces 2020 {1408} | PROGRAMMING | 1250.0 | Grakn Forces -- Editorial | |
| 2679 | Two Different | bitmasks constructive algorithms divide and conquer greedy | Statement | F | Grakn Forces 2020 {1408} | PROGRAMMING | 2500.0 | Grakn Forces -- Editorial | |
| 10447 | Arrays Sum | constructive algorithms greedy math | Statement | B | Grakn Forces 2020 {1408} | PROGRAMMING | 1000.0 | Grakn Forces -- Editorial | |
| 197 | Bitwise Magic | dp math | Statement | I | Grakn Forces 2020 {1408} | PROGRAMMING | 3750.0 | Grakn Forces -- Editorial | |
| 30882 | Minimum Product | brute force greedy math | Statement | B | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 24613 | Yet Another Array Restoration | brute force math | Statement | C | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 21356 | Decrease the Sum of Digits | greedy math | Statement | D | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 80156 | Yet Another Two Integers Problem | math | Statement | A | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 888 | No Game No Life | games math matrices | Statement | G | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 3250.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 1817 | Poman Numbers | greedy implementation math | Statement | E | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 2250.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 436 | The Thorny Path | greedy math matrices | Statement | F | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 2750.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 2178 | Solo mid Oracle | binary search math ternary search | Statement | E | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 2250.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 15285 | Finding Sasuke | constructive algorithms math | Statement | A | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 500.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 15867 | Prison Break | brute force brute force math | Statement | A | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 3000 | New Game Plus! | constructive algorithms greedy math | Statement | E | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 6671 | Make Them Equal | constructive algorithms greedy math | Statement | B | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 1000.0 | Codeforces Round #673 Editorial | 2000 |
| 15067 | Two Arrays | greedy math sortings | Statement | B | Codeforces Round 673 (Div. 2) {1417} | PROGRAMMING | 1000.0 | Codeforces Round #673 Editorial | 1100 |
| 18720 | Copy-paste | greedy math | Statement | A | Codeforces Round 673 (Div. 2) {1417} | PROGRAMMING | 500.0 | Codeforces Round #673 Editorial | 800 |
| 2185 | Expected Damage | binary search combinatorics math probabilities | Statement | E | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 423 | Equal Product | data structures math number theory two pointers | Statement | F | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 33597 | Buying Torches | math | Statement | A | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 3498 | Decryption | bitmasks constructive algorithms implementation math number theory | Statement | E | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 2250.0 | Codeforces Round #671 Editorial | |
| 16956 | Stairs | brute force constructive algorithms greedy implementation math two pointers | Statement | B | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 750.0 | Codeforces Round #671 Editorial | |
| 16292 | Killjoy | greedy implementation math | Statement | C | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 1250.0 | Codeforces Round #671 Editorial | |
| 35651 | Rock and Lever | bitmasks math | Statement | B | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 1000.0 | Editorial | |
| 25185 | Cubes Sorting | math sortings | Statement | A | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 500.0 | Editorial | |
| 35231 | XORwice | bitmasks greedy math | Statement | A | Codeforces Round 676 (Div. 2) {1421} | PROGRAMMING | 500.0 | Codeforces Round #676 (Div. 2) Editorial | |
| 4377 | Hexagons | brute force implementation math shortest paths ternary search | Statement | D | Codeforces Round 676 (Div. 2) {1421} | PROGRAMMING | 2000.0 | Codeforces Round #676 (Div. 2) Editorial | |
| 8835 | Bargain | dp math probabilities | Statement | C | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 1000.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 21865 | Fence | geometry math | Statement | A | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 500.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 5438 | Lonely Numbers | binary search math number theory | Statement | K | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 886 | Bubble Cup hypothesis | constructive algorithms dp math | Statement | J | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 213 | Dušan's Railway | graphs trees | Statement | C | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 323 | Milutin's Plums | interactive | Statement | M | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 449 | Coins | math | Statement | F | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 898 | Danger of Mad Snakes | combinatorics dp math | Statement | D | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 2300 | |
| 54 | Captain of Knights | math | Statement | C | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 3100 | |
| 20531 | Increase and Copy | binary search constructive algorithms math | Statement | C | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 1100 | |
| 8120 | Rock, Paper, Scissors | brute force constructive algorithms flows greedy math | Statement | E | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 1800 | |
| 54844 | Floor Number | implementation math | Statement | A | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 800 | |
| 1630 | Xum | bitmasks constructive algorithms math number theory | Statement | E | Codeforces Global Round 11 {1427} | PROGRAMMING | 1500.0 | Editorial of Global Round 11 | 2500 |
| 18024 | Avoiding Zero | math sortings | Statement | A | Codeforces Global Round 11 {1427} | PROGRAMMING | 500.0 | Editorial of Global Round 11 | 900 |
| 4199 | Carrots for Rabbits | binary search data structures greedy math | Statement | E | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1750.0 | Codeforces Raif Round 1 Editorial | |
| 17003 | Box is Pull | math | Statement | A | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 500.0 | Codeforces Raif Round 1 Editorial | |
| 868 | Yet Another DAG Problem | bitmasks dp flows math | Statement | G | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 21744 | Number of Apartments | brute force dp math | Statement | A | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 28143 | Numbers on Whiteboard | constructive algorithms data structures games implementation math | Statement | C | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 19813 | Two Round Dances | combinatorics math | Statement | E | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 62459 | Boring Apartments | implementation math | Statement | A | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 621 | Sum Over Subsets | combinatorics math number theory | Statement | F | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 3000.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 21716 | Prime Square | constructive algorithms math | Statement | B | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 1000.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 23501 | Reorder | math | Statement | A | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 500.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 18460 | Marketing Scheme | brute force constructive algorithms greedy math | Statement | A | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 1605 | Emotional Fishermen | combinatorics dp math | Statement | F | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 30159 | Sum of Medians | greedy math | Statement | B | Codeforces Round 684 (Div. 2) {1440} | PROGRAMMING | 1000.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 20369 | Buy the String | implementation math | Statement | A | Codeforces Round 684 (Div. 2) {1440} | PROGRAMMING | 500.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 1543 | Long Permutation | brute force combinatorics math | Statement | E | Codeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final) {1443} | PROGRAMMING | 2500.0 | VK Cup 2019-2020 -- Engine Editorial | |
| 16671 | Kids Seating | constructive algorithms math | Statement | A | Codeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final) {1443} | PROGRAMMING | 500.0 | VK Cup 2019-2020 -- Engine Editorial | |
| 16552 | Saving the City | greedy math sortings | Statement | B | Codeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final) {1443} | PROGRAMMING | 1000.0 | VK Cup 2019-2020 -- Engine Editorial | |
| 6772 | Divide and Sum | combinatorics math | Statement | B | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 1000.0 | Codeforces Round #680 Editorial | |
| 14390 | Division | math number theory | Statement | A | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 500.0 | Codeforces Round #680 Editorial | |
| 15914 | Elimination | math | Statement | B | Codeforces Round 680 (Div. 2, based on Moscow Team Olympiad) {1445} | PROGRAMMING | 1000.0 | Codeforces Round #680 Editorial | |
| 14443 | Add Candies | constructive algorithms math | Statement | A | Codeforces Round 683 (Div. 2, by Meet IT) {1447} | PROGRAMMING | 500.0 | Meet IT Codeforces Round Editorial | |
| 26297 | Numbers Box | greedy math | Statement | B | Codeforces Round 683 (Div. 2, by Meet IT) {1447} | PROGRAMMING | 1000.0 | Meet IT Codeforces Round Editorial | |
| 513 | Multithreading (Easy Version) | combinatorics fft math | Statement | H1 | Codeforces Global Round 12 {1450} | PROGRAMMING | 2750.0 | Codeforces Global Round 12 Editorial | |
| 277 | Multithreading (Hard Version) | combinatorics implementation math | Statement | H2 | Codeforces Global Round 12 {1450} | PROGRAMMING | 1750.0 | Codeforces Global Round 12 Editorial | |
| 4168 | Errich-Tac-Toe (Hard Version) | constructive algorithms math | Statement | C2 | Codeforces Global Round 12 {1450} | PROGRAMMING | 750.0 | Codeforces Global Round 12 Editorial | |
| 4900 | Bitwise Queries (Easy Version) | bitmasks constructive algorithms interactive math | Statement | E1 | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1500.0 | Editorial — Codeforces Round #685 | |
| 3363 | Bitwise Queries (Hard Version) | bitmasks constructive algorithms interactive math | Statement | E2 | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1000.0 | Editorial — Codeforces Round #685 | |
| 10141 | Circle Game | games geometry math | Statement | D | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1750.0 | Editorial — Codeforces Round #685 | |
| 25271 | Subtract or Divide | greedy math | Statement | A | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 500.0 | Editorial — Codeforces Round #685 | |
| 15475 | Toy Blocks | binary search greedy math sortings | Statement | B | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 8675 | Radio Towers | combinatorics dp math | Statement | D | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 22931 | Robot Program | math | Statement | A | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 4435 | Checkpoints | brute force constructive algorithms greedy math probabilities | Statement | D | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 2000.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 22096 | Number into Sequence | constructive algorithms math number theory | Statement | D | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 1646 | Four Points | brute force constructive algorithms flows geometry greedy math ternary search | Statement | E | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 20434 | Ping-pong | constructive algorithms games math | Statement | C | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 23219 | Jumps | constructive algorithms math | Statement | B | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 438 | Range Diameter Sum | Statement | F | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 3500.0 | Codeforces Round #691 Editorial (finished) | ||
| 1683 | Latin Square | data structures implementation math matrices | Statement | C | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 1500.0 | Codeforces Round #691 Editorial (finished) | |
| 25153 | Row GCD | math number theory | Statement | A | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 500.0 | Codeforces Round #691 Editorial (finished) | |
| 20796 | Move and Turn | dp math | Statement | B | Codeforces Round 691 (Div. 2) {1459} | PROGRAMMING | 1000.0 | Codeforces Round #691 Editorial (finished) | |
| 17647 | Red-Blue Shuffle | math probabilities | Statement | A | Codeforces Round 691 (Div. 2) {1459} | PROGRAMMING | 750.0 | Codeforces Round #691 Editorial (finished) | |
| 10279 | Divide and Summarize | binary search brute force data structures divide and conquer implementation sortings | Statement | D | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 1500.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 2212 | Water Level | brute force graphs greedy implementation math | Statement | E | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 2250.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 601 | Mathematical Expression | constructive algorithms dp greedy | Statement | F | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 2750.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 12419 | Random Events | math probabilities | Statement | C | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 1250.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 11345 | Close Tuples (hard version) | binary search combinatorics implementation math sortings two pointers | Statement | E2 | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 15203 | Close Tuples (easy version) | binary search combinatorics math sortings two pointers | Statement | E1 | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 36398 | Unique Number | dp greedy math | Statement | C | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 18102 | Add to Neighbour and Remove | greedy math number theory | Statement | D | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 6052 | Busy Robot | implementation math | Statement | C | Educational Codeforces Round 100 (Rated for Div. 2) {1463} | PROGRAMMING | Educational Codeforces Round 100 Editorial | ||
| 27909 | Dungeon | math | Statement | A | Educational Codeforces Round 100 (Rated for Div. 2) {1463} | PROGRAMMING | Educational Codeforces Round 100 Editorial | ||
| 8351 | Apollo versus Pan | bitmasks math | Statement | E | Good Bye 2020 {1466} | PROGRAMMING | 1500.0 | Good Bye 2020 Editorial | |
| 23203 | Bovine Dilemma | brute force math | Statement | A | Good Bye 2020 {1466} | PROGRAMMING | 500.0 | Good Bye 2020 Editorial | |
| 3060 | Euclid's nightmare | dfs and similar dsu graphs math | Statement | F | Good Bye 2020 {1466} | PROGRAMMING | 1750.0 | Good Bye 2020 Editorial | |
| 1008 | Song of the Sirens | divide and conquer hashing math strings | Statement | G | Good Bye 2020 {1466} | PROGRAMMING | 2500.0 | Good Bye 2020 Editorial | |
| 489 | Finding satisfactory solutions | dp graphs greedy math | Statement | H | Good Bye 2020 {1466} | PROGRAMMING | 3500.0 | Good Bye 2020 Editorial | |
| 3993 | Sum of Paths | combinatorics dp math | Statement | D | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 1750.0 | Codeforces Round #695 (Div. 2) Editorial | 2200 |
| 25298 | Wizard of Orz | greedy math | Statement | A | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 500.0 | Codeforces Round #695 (Div. 2) Editorial | 900 |
| 1995 | K and Medians | constructive algorithms math | Statement | H | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) |