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 ... 29 30 31 32 33 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 4800 | Exact Change | binary search brute force constructive algorithms greedy | Statement | D | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 23089 | Equal or Not Equal | constructive algorithms implementation | Statement | A | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 750 | Bipartite Array | dp | Statement | F | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 7268 | BA-String | bitmasks brute force dp greedy implementation math shortest paths | Statement | C | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 776 | Weighted Increasing Subsequences | data structures dp | Statement | G | Hello 2022 {1621} | PROGRAMMING | 3000.0 | ||
| 144 | Two Sequences | data structures hashing string suffix structures | Statement | I | Hello 2022 {1621} | PROGRAMMING | 4500.0 | ||
| 199 | Trains and Airplanes | graphs shortest paths | Statement | H | Hello 2022 {1621} | PROGRAMMING | 3500.0 | ||
| 4389 | The Winter Hike | constructive algorithms greedy math | Statement | D | Hello 2022 {1621} | PROGRAMMING | 1750.0 | ||
| 635 | Strange Instructions | greedy | Statement | F | Hello 2022 {1621} | PROGRAMMING | 2750.0 | ||
| 24751 | Stable Arrangement of Rooks | constructive algorithms | Statement | A | Hello 2022 {1621} | PROGRAMMING | 500.0 | ||
| 1917 | New School | binary search data structures greedy implementation sortings | Statement | E | Hello 2022 {1621} | PROGRAMMING | 2250.0 | ||
| 14545 | Integers Shop | data structures greedy implementation | Statement | B | Hello 2022 {1621} | PROGRAMMING | 1000.0 | ||
| 7498 | Hidden Permutations | dfs and similar interactive math | Statement | C | Hello 2022 {1621} | PROGRAMMING | 1500.0 | ||
| 4637 | Shuffle | combinatorics math two pointers | Statement | D | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 15520 | Set or Decrease | binary search greedy ternary search | Statement | C | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 857 | Quadratic Set | constructive algorithms hashing number theory | Statement | F | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 2241 | Math Test | bitmasks brute force greedy | Statement | E | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 32009 | Construct a Rectangle | math | Statement | A | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 22299 | Berland Music | greedy sortings | Statement | B | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 1468 | Robot Cleaner Revisit | dp implementation math probabilities | Statement | D | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 2500.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 20710 | Robot Cleaner | brute force implementation math | Statement | A | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 500.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 1255 | Middle Duplication | data structures dfs and similar greedy strings trees | Statement | E | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 2750.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 14653 | Game on Ranges | brute force implementation sortings | Statement | B | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 1000.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 14297 | Balanced Stone Heaps | binary search greedy | Statement | C | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 1750.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 60119 | Plus One on the Subset | math | Statement | A | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 19054 | Palindromes Coloring | binary search greedy sortings strings | Statement | D | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 7574 | MinOr Tree | bitmasks dfs and similar dsu greedy | Statement | G | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 4588 | Masha-forgetful | brute force constructive algorithms dp hashing implementation strings | Statement | E | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 52669 | Make AP | implementation math | Statement | B | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 3787 | Interacdive Problem | binary search constructive algorithms interactive | Statement | F | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 26804 | Division by Two and Permutation | constructive algorithms flows graph matchings greedy math | Statement | C | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 13250 | Road Optimization | data structures dp | Statement | C | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 16850 | Elementary Particles | greedy | Statement | B | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 660 | Cats on the Upgrade (hard version) | data structures dfs and similar graphs trees | Statement | E2 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 1148 | Cats on the Upgrade (easy version) | data structures dfs and similar divide and conquer dp graphs trees | Statement | E1 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 2315 | Binary Spiders | bitmasks data structures implementation sortings trees | Statement | D | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 18276 | Ancient Civilization | bitmasks greedy math | Statement | A | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 11798 | Monsters And Spells | data structures dp fft greedy implementation two pointers | Statement | C | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 23921 | Minor Reduction | greedy greedy strings strings | Statement | B | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 4326 | Martial Arts Tournament | binary search brute force greedy | Statement | D | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 30862 | Equidistant Letters | constructive algorithms | Statement | A | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 1853 | Black and White Tree | dp greedy trees | Statement | E | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 903 | A Random Code Problem | combinatorics dp math number theory | Statement | F | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 654 | Not Splitting | geometry graphs implementation shortest paths | Statement | F | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 2750.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 17554 | Not Sitting | games greedy sortings | Statement | B | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1250.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 24892 | Not Shading | constructive algorithms implementation | Statement | A | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 500.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 2778 | Not Escaping | data structures dp implementation shortest paths sortings two pointers | Statement | E | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 2000.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 16227 | Not Assigning | constructive algorithms dfs and similar number theory trees | Statement | C | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1250.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 9348 | Not Adding | dp math number theory | Statement | D | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1750.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 97 | Spaceship Crisis Management | binary search data structures geometry sortings | Statement | F | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 3000.0 | 99276 | |
| 12693 | Peculiar Movie Preferences | greedy strings | Statement | B | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 750.0 | 99276 | |
| 16965 | Meximum Array | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 500.0 | 99276 | |
| 1211 | Groceries in Meteor Town | data structures trees | Statement | E | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 2250.0 | 99276 | |
| 3573 | Grid Xor | constructive algorithms greedy implementation interactive math | Statement | C | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 1250.0 | 99276 | |
| 2615 | Game on Sum (Hard Version) | combinatorics dp games | Statement | D2 | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 750.0 | 99276 | |
| 3689 | Game on Sum (Easy Version) | combinatorics dp games | Statement | D1 | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 1000.0 | 99276 | |
| 25246 | GCD Arrays | greedy math number theory | Statement | B | Codeforces Round 767 (Div. 2) {1629} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #767 | |
| 30903 | Download More RAM | greedy sortings | Statement | A | Codeforces Round 767 (Div. 2) {1629} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #767 | |
| 6476 | Range and Partition | binary search data structures greedy two pointers | Statement | B | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #768 | |
| 3323 | Paint the Middle | data structures dp greedy sortings | Statement | C | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #768 | |
| 919 | Making It Bipartite | flows graphs number theory | Statement | F | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #768 | |
| 1944 | Flipping Range | dp greedy number theory | Statement | D | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #768 | |
| 554 | Expected Components | combinatorics number theory probabilities | Statement | E | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #768 | |
| 16130 | And Matching | bitmasks constructive algorithms | Statement | A | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #768 | |
| 31281 | Min Max Swap | greedy | Statement | A | Codeforces Round 768 (Div. 2) {1631} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #768 | |
| 26792 | Fun with Even Subarrays | dp greedy | Statement | B | Codeforces Round 768 (Div. 2) {1631} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #768 | |
| 14056 | Strange Test | binary search bitmasks brute force greedy math | Statement | C | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #769 | |
| 31395 | Roof Construction | bitmasks constructive algorithms | Statement | B | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #769 | |
| 5315 | New Year Concert | binary search data structures dp greedy math number theory two pointers | Statement | D | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #769 | |
| 1192 | Distance Tree (hard version) | dfs and similar shortest paths trees | Statement | E2 | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #769 | |
| 1334 | Distance Tree (easy version) | dfs and similar shortest paths trees | Statement | E1 | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #769 | |
| 31048 | ABC | implementation | Statement | A | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #769 | |
| 1739 | Spanning Tree Queries | binary search data structures dsu graphs implementation math sortings | Statement | E | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 369 | Perfect Matching | data structures interactive trees | Statement | F | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 29381 | Minority | greedy | Statement | B | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 18614 | Make Them Equal | dp greedy shortest paths | Statement | D | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 21237 | Kill the Monster | brute force math | Statement | C | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 35986 | Div. 7 | brute force | Statement | A | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 24648 | Reverse and Concatenate | brute force strings | Statement | A | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 19077 | OKEA | constructive algorithms math | Statement | C | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 1500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 22229 | Fortune Telling | bitmasks math | Statement | B | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 1250.0 | Codeforces Round #770 (Div. 2) editorial | |
| 4722 | Finding Zero | constructive algorithms greedy interactive | Statement | D | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 2000.0 | Codeforces Round #770 (Div. 2) editorial | |
| 1898 | Fibonacci Additions | brute force hashing math | Statement | F | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 3000.0 | Codeforces Round #770 (Div. 2) editorial | |
| 2167 | Fair Share | constructive algorithms data structures dfs and similar graph matchings graphs | Statement | E | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 2500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 25825 | Min Or Sum | bitmasks greedy | Statement | A | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 500.0 | Codeforces Round #772 Editorial | |
| 7043 | Infinite Set | dp math matrices number theory strings | Statement | D | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 25019 | Differential Sorting | constructive algorithms greedy | Statement | C | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 1500.0 | Codeforces Round #772 Editorial | |
| 1391 | Closest Pair | data structures greedy | Statement | F | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 3000.0 | Codeforces Round #772 Editorial | |
| 2723 | Cars | constructive algorithms dfs and similar dsu graphs greedy sortings | Statement | E | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 18455 | Avoid Local Maximums | greedy | Statement | B | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 1000.0 | Codeforces Round #772 Editorial | |
| 8898 | Yet Another Minimization Problem | dp math | Statement | D | Codeforces Global Round 19 {1637} | PROGRAMMING | 2000.0 | Tutorial | |
| 2158 | Towers | constructive algorithms dfs and similar dp greedy trees | Statement | F | Codeforces Global Round 19 {1637} | PROGRAMMING | 3250.0 | Tutorial | |
| 24123 | Sorting Parts | sortings | Statement | A | Codeforces Global Round 19 {1637} | PROGRAMMING | 500.0 | Tutorial | |
| 567 | Minimize Inversions Number | data structures math sortings | Statement | H | Codeforces Global Round 19 {1637} | PROGRAMMING | 4000.0 | Tutorial | |
| 15453 | MEX and Array | brute force dp greedy math | Statement | B | Codeforces Global Round 19 {1637} | PROGRAMMING | 1000.0 | Tutorial | |
| 620 | Birthday | constructive algorithms math | Statement | G | Codeforces Global Round 19 {1637} | PROGRAMMING | 4000.0 | Tutorial | |
| 3792 | Best Pair | binary search brute force | Statement | E | Codeforces Global Round 19 {1637} | PROGRAMMING | 2500.0 | Tutorial | |
| 18723 | Andrew and Stones | constructive algorithms greedy | Statement | C | Codeforces Global Round 19 {1637} | PROGRAMMING | 1500.0 | Tutorial | |
| 261 | Two Posters | data structures two pointers | Statement | F | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 3250.0 | Codeforces Round #771 Editorial | |
| 22141 | Reverse | greedy math | Statement | A | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 500.0 | Codeforces Round #771 Editorial | |
| 22533 | Odd Swap Sort | data structures math sortings | Statement | B | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 750.0 | Codeforces Round #771 Editorial | |
| 15914 | Inversion Graph | dsu graphs math | Statement | C | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 1250.0 | Codeforces Round #771 Editorial | |
| 2352 | Colorful Operations | data structures implementation | Statement | E | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 2500.0 | Codeforces Round #771 Editorial | |
| 4727 | Big Brush | dfs and similar greedy implementation | Statement | D | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 1750.0 | Codeforces Round #771 Editorial | |
| 0 | Treasure Hunt | graphs interactive | Statement | K | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | J | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | I | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | H | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | G | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | F | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | E | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs graphs graphs interactive interactive | Statement | D | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs graphs interactive interactive | Statement | C | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | B | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | A | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 1497 | Two Arrays | bitmasks brute force combinatorics hashing probabilities two pointers | Statement | D | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 1750.0 | Codeforces Round #773 editorial | |
| 290 | Special Positions | combinatorics fft | Statement | E | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 2250.0 | Codeforces Round #773 editorial | |
| 4060 | Repetitions Decoding | constructive algorithms implementation sortings | Statement | B | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 1250.0 | Codeforces Round #773 editorial | |
| 18972 | Great Sequence | brute force greedy sortings | Statement | A | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 500.0 | Codeforces Round #773 editorial | |
| 120 | Covering Circle | geometry | Statement | F | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 3000.0 | Codeforces Round #773 editorial | |
| 2839 | Anonymity Is Important | binary search data structures dsu sortings | Statement | C | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 1250.0 | Codeforces Round #773 editorial | |
| 18235 | Power Walking | greedy | Statement | B | Codeforces Round 773 (Div. 2) {1642} | PROGRAMMING | 750.0 | Codeforces Round #773 editorial | |
| 16729 | Hard Way | geometry | Statement | A | Codeforces Round 773 (Div. 2) {1642} | PROGRAMMING | 500.0 | Codeforces Round #773 editorial | |
| 14990 | Increase Subarray Sums | dp implementation | Statement | C | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 3488 | Expand the Path | brute force combinatorics implementation math | Statement | E | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 28619 | Doors and Keys | implementation | Statement | A | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 7870 | Cross Coloring | implementation math | Statement | D | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 428 | Basis | combinatorics fft math number theory | Statement | F | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 21285 | Anti-Fibonacci Permutation | brute force constructive algorithms implementation | Statement | B | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 19432 | Factorials and Powers of Two | bitmasks brute force constructive algorithms math | Statement | C | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 1250.0 | Codeforces Round #774 (Div. 2) Editorial | 1500 |
| 4435 | Weight the Tree | constructive algorithms dfs and similar dp implementation trees | Statement | D | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 2000.0 | Codeforces Round #774 (Div. 2) Editorial | 2000 |
| 2755 | Power Board | brute force math number theory | Statement | E | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 2500.0 | Codeforces Round #774 (Div. 2) Editorial | 2200 |
| 659 | Playing Around the Table | constructive algorithms greedy implementation | Statement | F | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 3000.0 | Codeforces Round #774 (Div. 2) Editorial | 2900 |
| 25372 | Square Counting | math | Statement | A | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 750.0 | Codeforces Round #774 (Div. 2) Editorial | 800 |
| 22659 | Quality vs Quantity | brute force constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 1000.0 | Codeforces Round #774 (Div. 2) Editorial | 800 |
| 1097 | Madoka and the Sixth-graders | dfs and similar greedy trees | Statement | E | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 2500.0 | Codeforces Round #777 Editorial | |
| 17113 | Madoka and the Elegant Gift | brute force graphs implementation | Statement | B | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 1250.0 | Codeforces Round #777 Editorial | |
| 5693 | Madoka and the Best School in Russia | dp math number theory | Statement | D | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 2000.0 | Codeforces Round #777 Editorial | |
| 23486 | Madoka and Math Dad | implementation math | Statement | A | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 500.0 | Codeforces Round #777 Editorial | |
| 543 | Madoka and Laziness | dp greedy | Statement | F | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 3000.0 | Codeforces Round #777 Editorial | |
| 13329 | Madoka and Childish Pranks | constructive algorithms greedy | Statement | C | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 1500.0 | Codeforces Round #777 Editorial | |
| 18688 | Weird Sum | combinatorics data structures geometry math matrices sortings | Statement | A | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 500.0 | Codeforces Round #775 Editorial | |
| 3339 | Tyler and Strings | combinatorics data structures implementation strings | Statement | C | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 1500.0 | Codeforces Round #775 Editorial | |
| 185 | Two Avenues | data structures dfs and similar graphs | Statement | F | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 3750.0 | Codeforces Round #775 Editorial | |
| 1051 | Serious Business | data structures divide and conquer dp shortest paths | Statement | D | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 2000.0 | Codeforces Round #775 Editorial | |
| 7250 | Integral Array | brute force constructive algorithms data structures math | Statement | B | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 1000.0 | Codeforces Round #775 Editorial | |
| 506 | Air Reform | data structures dfs and similar divide and conquer dsu graphs implementation trees | Statement | E | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 2500.0 | Codeforces Round #775 Editorial | |
| 13949 | Game of Ball Passing | greedy implementation | Statement | B | Codeforces Round 775 (Div. 2, based on Moscow Open Olympiad in Informatics) {1649} | PROGRAMMING | 1000.0 | Codeforces Round #775 Editorial | |
| 16038 | Game | implementation | Statement | A | Codeforces Round 775 (Div. 2, based on Moscow Open Olympiad in Informatics) {1649} | PROGRAMMING | 500.0 | Codeforces Round #775 Editorial | |
| 18494 | Weight of the System of Nested Segments | greedy hashing implementation sortings | Statement | C | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 1662 | Vitaly and Advanced Useless Algorithms | dp greedy | Statement | F | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 14340 | Twist the Permutation | brute force constructive algorithms math | Statement | D | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 4460 | Rescheduling the Exam | binary search data structures greedy implementation math sortings | Statement | E | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 29959 | DIV + MOD | math | Statement | B | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 37275 | Deletions of Two Adjacent Letters | implementation strings | Statement | A | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 2924 | Counting Shortcuts | dfs and similar dp graphs shortest paths | Statement | G | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 481 | Tower Defense | binary search brute force data structures | Statement | F | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 617 | Sum of Matchings | dfs and similar greedy implementation math | Statement | E | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 20478 | Prove Him Wrong | constructive algorithms greedy | Statement | B | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 26638 | Playoff | implementation | Statement | A | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 6471 | Nearest Excluded Points | binary search data structures dfs and similar graphs shortest paths | Statement | D | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 11574 | Fault-tolerant Network | brute force data structures implementation | Statement | C | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 14499 | Alice and the Cake | constructive algorithms data structures greedy sortings | Statement | C | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 1400 |
| 3060 | Potion Brewing Class | dfs and similar implementation math number theory trees | Statement | D | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2100 |
| 2359 | Arithmetic Operations | brute force divide and conquer graphs math | Statement | E | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2300 |
| 1481 | Minimal String Xoration | bitmasks data structures divide and conquer hashing strings | Statement | F | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2800 |
| 456 | Snowy Mountain | data structures graphs greedy shortest paths trees | Statement | G | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2900 |
| 100 | Three Minimums | combinatorics fft math | Statement | H | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 4000.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 3500 |
| 16770 | Prefix Removals | strings | Statement | B | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 800 |
| 19384 | Maximum Cake Tastiness | greedy implementation sortings | Statement | A | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 800 |
| 26705 | Subtract Operation | constructive algorithms data structures math two pointers | Statement | B | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 1000.0 | Tutorial | |
| 1214 | Parametric MST | binary search graphs greedy math ternary search | Statement | F | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3000.0 | Tutorial | |
| 154 | Neighbour Ordering | constructive algorithms graphs | Statement | I | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 4500.0 | Tutorial | |
| 20991 | Make Equal With Mod | math number theory sortings | Statement | C | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 1500.0 | Tutorial | |
| 7546 | K-good | constructive algorithms games math number theory | Statement | D | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 2000.0 | Tutorial | |
| 20446 | Good Pairs | constructive algorithms math sortings | Statement | A | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 500.0 | Tutorial | |
| 3853 | Equal Tree Sums | constructive algorithms dfs and similar trees | Statement | E | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 2500.0 | Tutorial | |
| 795 | Equal LCM Subsets | math number theory | Statement | H | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3750.0 | Tutorial | |
| 462 | Cycle Palindrome | constructive algorithms math | Statement | G | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3250.0 | Tutorial | |
| 23602 | XY Sequence | greedy | Statement | B | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 747 | Words on Tree | 2-sat implementation trees | Statement | F | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 2479 | Star MST | combinatorics dp math | Statement | E | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 24883 | Integer Moves | math | Statement | A | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 5287 | For Gamers. By Gamers. | binary search dp math sortings two pointers | Statement | D | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 17679 | Bracket Sequence Deletion | greedy hashing | Statement | C | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 9939 | Shinju and the Lost Permutation | constructive algorithms math | Statement | C | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 1750.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 20899 | Marin and Photoshoot | constructive algorithms math | Statement | A | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 500.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 19532 | Marin and Anti-coprime Permutation | combinatorics math | Statement | B | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 1000.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 918 | Juju and Binary String | brute force constructive algorithms math | Statement | F | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 3000.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 1175 | Gojou and Matrix Game | data structures dp games math number theory sortings | Statement | E | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 2500.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 3173 | 388535 (Hard Version) | bitmasks brute force data structures math | Statement | D2 | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 750.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 9986 | 388535 (Easy Version) | bitmasks data structures math | Statement | D1 | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 1250.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 249 | Tree and Permutation Game | dfs and similar games trees | Statement | F | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 3000.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 4445 | Reverse Sort Sum | constructive algorithms data structures greedy implementation math two pointers | Statement | D | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2000.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 30778 | Red Versus Blue | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 500.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 14991 | Line Empire | dp greedy implementation math | Statement | C | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 1500.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 12020 | Bit Flipping | bitmasks constructive algorithms greedy strings | Statement | B | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 750.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 1967 | AND-MEX Walk | bitmasks brute force data structures dfs and similar dsu graphs greedy | Statement | E | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2250.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 29726 | Vlad and Candies | math | Statement | B | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 39163 | Vasya and Coins | math | Statement | A | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 3142 | Promising String (hard version) | data structures implementation math strings | Statement | F2 | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 7945 | Promising String (easy version) | brute force implementation math strings | Statement | F1 | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 11458 | Maximum Product Strikes Back | binary search implementation math | Statement | D | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 8085 | Matrix and Shifts | constructive algorithms greedy implementation | Statement | E | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 21985 | Get an Even String | dp greedy strings | Statement | C | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 10486 | Water the Trees | binary search greedy math | Statement | C | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 809 | Teleporters | binary search greedy math | Statement | F | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 5384 | Progressions Covering | data structures greedy implementation | Statement | D | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 1120 | Narrow Components | data structures dfs and similar dsu trees | Statement | E | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 20604 | Getting Zero | brute force dfs and similar graphs greedy shortest paths | Statement | B | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 19339 | Array Balancing | greedy math | Statement | A | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 297 | Training Camp | flows graphs | Statement | J | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 152 | Toys | greedy greedy strings strings | Statement | B | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 179 | Round Table | math | Statement | E | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 389 | Pandemic Restrictions | geometry ternary search | Statement | K | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 4837 | Organizing SWERC | Statement | A | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | |||
| 1330 | Il Derby della Madonnina | data structures dp | Statement | L | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 2466 | Ice Cream Shop | sortings | Statement | I | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 555 | Gastronomic Event | trees | Statement | G | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 2153 | Evolution of Weasels | strings | Statement | D | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 383 | European Trip | graphs | Statement | C | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 928 | Drone Photo | math sortings | Statement | N | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 1590 | Circular Maze | dfs and similar graphs implementation | Statement | O | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 3365 | Boundary | math | Statement | H | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 3874 | Bottle Arrangements | constructive algorithms | Statement | M | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 1244 | Antennas | data structures dfs and similar graphs graphs implementation implementation shortest paths shortest paths | Statement | F | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 10885 | Who Tested? | trees | Statement | A | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | ||
| 225 | Six Characters | Statement | G | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | |||
| 5875 | Pōja Verdon | implementation | Statement | C | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | ||
| 3569 | Mike's Sequence | math | Statement | B | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | ||
| 1483 | Is it rated - 3 | Statement | D | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | |||
| 377 | In Every Generation... | Statement | F | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | |||
| 1351 | Cross-Language Program | constructive algorithms | Statement | H | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | ||
| 587 | Are You Safe? | implementation | Statement | E | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | ||
| 9843 | Tree Infection | binary search dfs and similar greedy trees | Statement | C | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 1250.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 1795 | MinimizOR | binary search bitmasks data structures dp greedy implementation | Statement | E | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 2250.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 26174 | GCD vs LCM | constructive algorithms math | Statement | A | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 500.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 4640 | GCD Guess | bitmasks chinese remainder theorem constructive algorithms interactive math number theory | Statement | D | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 1500.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 32742 | Array Cloning Technique | constructive algorithms greedy sortings | Statement | B | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 750.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 3692 | Labyrinth | dfs and similar graphs | Statement | L | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 356 | Kingdom Partition | Statement | K | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | |||
| 1581 | Job Lookup | constructive algorithms dp | Statement | J | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 1767 | Interactive Treasure Hunt | brute force interactive math | Statement | I | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 86 | Heroes of Might | math | Statement | H | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | |||
| 153 | Global Warming | geometry math | Statement | G | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | |||
| 1517 | Fancy Stack | combinatorics dp | Statement | F | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 882 | Even Split | binary search constructive algorithms greedy | Statement | E | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 19971 | Deletive Editing | greedy | Statement | D | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 3691 | Connect the Points | brute force constructive algorithms geometry | Statement | C | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 66 | Budget Distribution | Statement | B | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) |