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 ... 25 26 27 28 29 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 232 | Chess Match | *special | Statement | E | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 746 | Black Friday | *special implementation | Statement | C | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 6726 | Zero Remainder Sum | dp | Statement | F | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 29820 | Yet Another Bookshelf | greedy implementation | Statement | B | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 19813 | Two Round Dances | combinatorics math | Statement | E | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 5087 | Reducing Delivery Cost | dfs and similar graphs shortest paths | Statement | G | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 28576 | Dominant Piranha | constructive algorithms greedy | Statement | C | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 30459 | Districts Connection | constructive algorithms dfs and similar trees | Statement | D | 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 | ||
| 221 | A Convex Game | Statement | E | Codeforces Round 679 (Div. 1, based on Technocup 2021 Elimination Round 1) {1434} | PROGRAMMING | 2500.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 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 | |
| 23501 | Reorder | math | Statement | A | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 500.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 | |
| 2652 | Complicated Computations | binary search data structures sortings two pointers | Statement | E | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 2500.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 11653 | Binary Search | binary search combinatorics | Statement | C | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 1500.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 6490 | Bandit in a City | binary search dfs and similar greedy trees | Statement | D | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 2000.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 20822 | Reverse Binary Strings | constructive algorithms greedy | Statement | B | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 14343 | Minimal Height Tree | graphs greedy shortest paths trees | Statement | D | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 18460 | Marketing Scheme | brute force constructive algorithms greedy math | Statement | A | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 3913 | Make It Increasing | data structures dp implementation | Statement | E | 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 | ||
| 1255 | Death DBMS | data structures hashing string suffix structures strings trees | Statement | G | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 12159 | Chef Monocarp | dp flows graph matchings greedy | Statement | C | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 1465 | Yurii Can Do Everything | brute force divide and conquer greedy implementation | Statement | E | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 2250.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 28932 | Valerii Against Everyone | constructive algorithms greedy sortings | Statement | B | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 750.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 19740 | Specific Tastes of Andre | constructive algorithms | Statement | A | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 500.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 4542 | Powerful Ksenia | bitmasks constructive algorithms | Statement | D | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 1750.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 800 | Olha and Igor | interactive trees | Statement | F | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 3000.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 11581 | Engineer Artem | 2-sat constructive algorithms | Statement | C | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 1250.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 476 | INOI Final Contests | combinatorics dp | Statement | D | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 2500.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 2207 | Greedy Shopping | binary search data structures greedy | Statement | C | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 1750.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 1651 | Graph Subset Problem | brute force data structures graphs | Statement | B | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 1250.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 248 | Cheat and Win | bitmasks data structures games trees | Statement | E | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 2500.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 5395 | Binary Table (Hard Version) | constructive algorithms graphs greedy implementation | Statement | A2 | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 500.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 9801 | Binary Table (Easy Version) | constructive algorithms implementation | Statement | A1 | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 500.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 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 | |
| 2903 | Sum | data structures divide and conquer dp greedy | Statement | D | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 1750.0 | 84298 | |
| 5281 | Identify the Operations | brute force combinatorics data structures dsu greedy implementation | Statement | B | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 1000.0 | 84298 | |
| 2000 | Graph Transpositions | graphs greedy shortest paths | Statement | C | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 1500.0 | 84298 | |
| 9635 | Extreme Subtraction | dp greedy | Statement | A | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 500.0 | 84298 | |
| 170 | Differentiating Games | games interactive | Statement | F | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 2500.0 | 84298 | |
| 782 | Black, White and Grey Tree | dp trees | Statement | E | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 1750.0 | 84298 | |
| 16781 | The Delivery Dilemma | binary search greedy sortings | Statement | C | Codeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final) {1443} | PROGRAMMING | 1500.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 | |
| 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 | |
| 1853 | Team-Building | 2-sat dfs and similar dsu graphs | Statement | C | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 1500.0 | Codeforces Round #680 Editorial | |
| 643 | Rectangular Polyline | constructive algorithms dp geometry | Statement | D | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 2000.0 | Codeforces Round #680 Editorial | |
| 167 | Finding the Vertex | brute force dfs and similar dp interactive trees | Statement | E | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 3000.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 | |
| 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 | |
| 15914 | Elimination | math | Statement | B | Codeforces Round 680 (Div. 2, based on Moscow Team Olympiad) {1445} | PROGRAMMING | 1000.0 | Codeforces Round #680 Editorial | |
| 20347 | Array Rearrangment | greedy sortings | Statement | A | Codeforces Round 680 (Div. 2, based on Moscow Team Olympiad) {1445} | PROGRAMMING | 500.0 | Codeforces Round #680 Editorial | |
| 4080 | Xor Tree | binary search bitmasks data structures divide and conquer dp trees | Statement | C | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1250.0 | E | |
| 122 | Long Recovery | constructive algorithms dfs and similar | Statement | E | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 3000.0 | E | |
| 373 | Line Distance | binary search data structures geometry | Statement | F | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 3000.0 | E | |
| 17662 | Knapsack | constructive algorithms greedy sortings | Statement | A | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 500.0 | E | |
| 1722 | Frequency Problem (Hard Version) | data structures greedy | Statement | D2 | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 750.0 | E | |
| 2097 | Frequency Problem (Easy Version) | data structures greedy | Statement | D1 | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1750.0 | E | |
| 9015 | Catching Cheaters | dp strings | Statement | B | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1000.0 | E | |
| 26297 | Numbers Box | greedy math | Statement | B | Codeforces Round 683 (Div. 2, by Meet IT) {1447} | PROGRAMMING | 1000.0 | Meet IT Codeforces Round 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 | |
| 1466 | The Struggling Contestant | constructive algorithms greedy | Statement | F | Codeforces Global Round 12 {1450} | PROGRAMMING | 2750.0 | Codeforces Global Round 12 Editorial | |
| 5804 | Rating Compression | data structures implementation two pointers | Statement | D | Codeforces Global Round 12 {1450} | PROGRAMMING | 1750.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 | |
| 513 | Multithreading (Easy Version) | combinatorics fft math | Statement | H1 | Codeforces Global Round 12 {1450} | PROGRAMMING | 2750.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 | |
| 5912 | Errich-Tac-Toe (Easy Version) | constructive algorithms | Statement | C1 | Codeforces Global Round 12 {1450} | PROGRAMMING | 1000.0 | Codeforces Global Round 12 Editorial | |
| 349 | Communism | bitmasks dp trees | Statement | G | Codeforces Global Round 12 {1450} | PROGRAMMING | 3750.0 | Codeforces Global Round 12 Editorial | |
| 1421 | Capitalism | constructive algorithms dfs and similar graphs shortest paths | Statement | E | Codeforces Global Round 12 {1450} | PROGRAMMING | 2500.0 | Codeforces Global Round 12 Editorial | |
| 16029 | Balls of Steel | brute force geometry greedy | Statement | B | Codeforces Global Round 12 {1450} | PROGRAMMING | 750.0 | Codeforces Global Round 12 Editorial | |
| 18479 | Avoid Trygub | constructive algorithms sortings | Statement | A | Codeforces Global Round 12 {1450} | PROGRAMMING | 500.0 | Codeforces Global Round 12 Editorial | |
| 25271 | Subtract or Divide | greedy math | Statement | A | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 500.0 | Editorial — Codeforces Round #685 | |
| 17271 | String Equality | dp greedy hashing implementation strings | Statement | C | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #685 | |
| 1217 | Nullify The Matrix | bitmasks games | Statement | F | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 3000.0 | Editorial — Codeforces Round #685 | |
| 20183 | Non-Substring Subsequence | greedy implementation strings | Statement | B | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 750.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 | |
| 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 | |
| 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 | |
| 1690 | Two Editorials | brute force data structures greedy implementation | Statement | E | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 21109 | Two Brackets | data structures greedy | Statement | C | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 15475 | Toy Blocks | binary search greedy math sortings | Statement | B | 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 | ||
| 8675 | Radio Towers | combinatorics dp math | Statement | D | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 552 | Game On Tree | Statement | G | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | |||
| 366 | Divide Powers | constructive algorithms greedy | Statement | F | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 6257 | Triangles | greedy implementation | Statement | C | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 1500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 14059 | Suffix Operations | constructive algorithms implementation | Statement | B | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 1000.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 967 | Even Harder | dp | Statement | F | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 3500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 2217 | Dog Snacks | binary search dfs and similar dp greedy trees | Statement | E | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 2500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 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 | |
| 24113 | Cancel the Trains | implementation | Statement | A | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 30019 | Unique Bid Auction | implementation | Statement | B | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 43980 | Special Permutation | constructive algorithms probabilities | Statement | A | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 22477 | Sequence Transformation | greedy implementation | Statement | C | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 6605 | Number of Simple Paths | combinatorics data structures dfs and similar dsu graphs trees | Statement | E | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) 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 | ||
| 4649 | Array Partition | binary search brute force data structures greedy two pointers | Statement | F | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 519 | String and Operations | dp greedy | Statement | F | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 27386 | Strange Functions | constructive algorithms | Statement | A | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 13192 | Sequence and Swaps | dp greedy sortings | Statement | D | 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 | ||
| 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 | ||
| 476 | Forbidden Value | data structures | Statement | G | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 378 | XOR-ranges | dp | Statement | E | Codeforces Round 687 (Div. 1, based on Technocup 2021 Elimination Round 2) {1456} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 25153 | Row GCD | math number theory | Statement | A | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 500.0 | Codeforces Round #691 Editorial (finished) | |
| 438 | Range Diameter Sum | Statement | F | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 3500.0 | Codeforces Round #691 Editorial (finished) | ||
| 555 | Nim Shortcuts | data structures games | Statement | E | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 2250.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) | |
| 4054 | Glass Half Spilled | dp | Statement | B | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 1000.0 | Codeforces Round #691 Editorial (finished) | |
| 1558 | Flip and Reverse | graphs greedy | Statement | D | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 2000.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) | |
| 20796 | Move and Turn | dp math | Statement | B | Codeforces Round 691 (Div. 2) {1459} | PROGRAMMING | 1000.0 | Codeforces Round #691 Editorial (finished) | |
| 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 | |
| 18996 | String Generation | constructive algorithms greedy | Statement | A | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 500.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 | |
| 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 | |
| 13224 | Find the Spruce | brute force dp | Statement | B | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 1000.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 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 | |
| 36398 | Unique Number | dp greedy math | Statement | C | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 8458 | The Treasure of The Segments | binary search data structures greedy sortings | Statement | F | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 29137 | Last Year's Substring | implementation strings | Statement | B | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 48800 | Favorite Sequence | implementation two pointers | Statement | A | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) 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 | ||
| 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 | ||
| 1731 | Plan of Lectures | dfs and similar dsu graphs | Statement | E | Educational Codeforces Round 100 (Rated for Div. 2) {1463} | PROGRAMMING | Educational Codeforces Round 100 Editorial | ||
| 4830 | Pairs | binary search constructive algorithms greedy | Statement | D | Educational Codeforces Round 100 (Rated for Div. 2) {1463} | PROGRAMMING | Educational Codeforces Round 100 Editorial | ||
| 733 | Max Correct Set | bitmasks dp | Statement | F | Educational Codeforces Round 100 (Rated for Div. 2) {1463} | PROGRAMMING | Educational Codeforces Round 100 Editorial | ||
| 21155 | Find The Array | constructive algorithms | Statement | B | 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 | ||
| 6052 | Busy Robot | implementation math | Statement | C | Educational Codeforces Round 100 (Rated for Div. 2) {1463} | PROGRAMMING | Educational Codeforces Round 100 Editorial | ||
| 441 | My Beautiful Madness | data structures trees | Statement | F | Codeforces Round 692 (Div. 1, based on Technocup 2021 Elimination Round 3) {1464} | PROGRAMMING | 3000.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 232 | The Riddle of the Sphinx | binary search data structures data structures interactive | Statement | I | Good Bye 2020 {1466} | PROGRAMMING | 4000.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 | |
| 23587 | Last minute enhancements | greedy | Statement | B | Good Bye 2020 {1466} | PROGRAMMING | 750.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 | |
| 3060 | Euclid's nightmare | dfs and similar dsu graphs math | Statement | F | Good Bye 2020 {1466} | PROGRAMMING | 1750.0 | Good Bye 2020 Editorial | |
| 18715 | Canine poetry | dp greedy strings | Statement | C | Good Bye 2020 {1466} | PROGRAMMING | 1000.0 | Good Bye 2020 Editorial | |
| 23203 | Bovine Dilemma | brute force math | Statement | A | Good Bye 2020 {1466} | PROGRAMMING | 500.0 | Good Bye 2020 Editorial | |
| 8351 | Apollo versus Pan | bitmasks math | Statement | E | Good Bye 2020 {1466} | PROGRAMMING | 1500.0 | Good Bye 2020 Editorial | |
| 14586 | 13th Labour of Heracles | greedy trees | Statement | D | Good Bye 2020 {1466} | PROGRAMMING | 1000.0 | Good Bye 2020 Editorial | |
| 11536 | Hills And Valleys | brute force implementation | Statement | B | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 1000.0 | Codeforces Round #695 (Div. 2) Editorial | 1700 |
| 6784 | Three Bags | brute force constructive algorithms greedy | Statement | C | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 1500.0 | Codeforces Round #695 (Div. 2) Editorial | 1900 |
| 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 |
| 1759 | Distinctive Roots in a Tree | data structures dfs and similar trees | Statement | E | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 2500.0 | Codeforces Round #695 (Div. 2) Editorial | 2500 |
| 25298 | Wizard of Orz | greedy math | Statement | A | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 500.0 | Codeforces Round #695 (Div. 2) Editorial | 900 |
| 9114 | Waste Sorting | flows greedy implementation | Statement | N | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 5600 | The Robot | brute force implementation | Statement | K | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 1124 | Similar Sets | data structures | Statement | M | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) — Tutorials | ||
| 5882 | Road Reform | dsu graphs greedy | Statement | J | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) — Tutorials | ||
| 371 | Prime Divisors Selection | greedy math number theory | Statement | L | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 573 | Plane Tiling | implementation math | Statement | I | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 1946 | LaIS | data structures dp greedy | Statement | A | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 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) | ||
| 887 | Hobbits | geometry | Statement | G | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 4218 | Full Turn | geometry number theory | Statement | F | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 9815 | Four Segments | greedy | Statement | E | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 5269 | Firecrackers | binary search sortings | Statement | D | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 10289 | Berpizza | data structures implementation | Statement | C | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 241 | Bakery | data structures dsu | Statement | B | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 29989 | Regular Bracket Sequence | constructive algorithms greedy | Statement | A | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 31006 | Red and Blue | greedy | Statement | B | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 1080 | Power Sockets | binary search data structures greedy | Statement | F | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 10196 | Ceil Divisions | brute force constructive algorithms math number theory | Statement | D | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 11665 | Building a Fence | dp greedy implementation two pointers | Statement | C | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 2198 | A Bit Similar | bitmasks brute force hashing string suffix structures strings two pointers | Statement | E | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 1437 | Strange Shuffle | binary search brute force constructive algorithms interactive probabilities | Statement | C | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 1000.0 | 86464 | |
| 375 | Strange Permutation | binary search combinatorics data structures dp two pointers | Statement | E | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 2000.0 | 86464 | |
| 4182 | Strange Housing | constructive algorithms dfs and similar dsu graph matchings graphs | Statement | D | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 1500.0 | 86464 | |
| 6775 | Strange Definition | bitmasks brute force data structures graphs math number theory | Statement | B | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 750.0 | 86464 | |
| 162 | Strange Covering | divide and conquer | Statement | F | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 2500.0 | 86464 | |
| 29281 | Strange Birthday Party | dp greedy sortings two pointers | Statement | A | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 500.0 | 86464 | |
| 38049 | Strange Partition | greedy math number theory | Statement | A | Codeforces Round 694 (Div. 2) {1471} | PROGRAMMING | 500.0 | Codeforces Round #694 Editorial | |
| 19923 | Strange List | brute force greedy implementation math | Statement | B | Codeforces Round 694 (Div. 2) {1471} | PROGRAMMING | 750.0 | Codeforces Round #694 Editorial | |
| 3288 | New Year's Puzzle | brute force dp graph matchings greedy sortings | Statement | F | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 5625 | Moving to the Capital | dfs and similar dp graphs shortest paths | Statement | G | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 35273 | Long Jumps | dp graphs | Statement | C | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 59673 | Fair Division | dp greedy | Statement | B | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 30471 | Even-Odd Game | dp games greedy sortings | Statement | D | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 8840 | Correct Placement | binary search data structures sortings two pointers | Statement | E | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 45463 | Cards for Friends | greedy math | Statement | A | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 455 | Tiles | combinatorics dp fft math | Statement | G | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 35028 | String LCM | brute force math strings | Statement | B | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 1135 | Strange Set | flows | Statement | F | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 37297 | Replacing Elements | greedy implementation sortings | Statement | A | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 10947 | Program | data structures dp implementation | Statement | D | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 13408 | No More Inversions | constructive algorithms | Statement | C | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 4704 | Minimum Path | dp graphs implementation shortest paths | Statement | E | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 1463 | What Is It? | constructive algorithms greedy | Statement | E | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 2250.0 | Codeforces Round #696 Editorial | |
| 23346 | Puzzle From the Future | greedy | Statement | A | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 500.0 | Codeforces Round #696 Editorial | |
| 40136 | Different Divisors | binary search constructive algorithms greedy math number theory | Statement | B | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 1000.0 | Codeforces Round #696 Editorial | |
| 4299 | Cleaning | data structures dp greedy implementation | Statement | D | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 2000.0 | Codeforces Round #696 Editorial | |
| 14121 | Array Destruction | constructive algorithms data structures greedy implementation sortings | Statement | C | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 1500.0 | Codeforces Round #696 Editorial | |
| 322 | 1 2 3 4 ... | dp matrices | Statement | F | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 3000.0 | Codeforces Round #696 Editorial | |
| 5879 | Unusual Matrix | 2-sat constructive algorithms greedy | Statement | F | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 7801 | Strange Beauty | dfs and similar dp math number theory | Statement | G | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 86358 | Odd Divisor | bitmasks math number theory | Statement | A | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 57129 | New Year's Number | brute force dp math | Statement | B | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 11178 | Cleaning the Phone | binary search dp greedy sortings two pointers | Statement | D | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 27103 | Ball in Berland | combinatorics dfs and similar graphs hashing math | Statement | C | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 17614 | Advertising Agency | combinatorics implementation math sortings | Statement | E | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 2748 | Pattern Matching | bitmasks data structures dfs and similar graphs sortings strings | Statement | E | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 738 | Minimum Difference | data structures two pointers | Statement | G | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 12290 | Longest Simple Cycle | constructive algorithms dp graphs greedy | Statement | C | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 1136 | Lanterns | data structures dp | Statement | F | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 44769 | K-divisible Sum | binary search constructive algorithms greedy math | Statement | A | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 9233 | Journey | dfs and similar dp dsu implementation two pointers | Statement | D | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 21569 | Inflation | binary search brute force greedy math | Statement | B | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 6515 | Nezzar and Board | constructive algorithms math number theory | Statement | A | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 500.0 | 87294 | 1800 |
| 3547 | Nezzar and Binary String | data structures | Statement | B | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 1000.0 | 87294 | 1900 |
| 2584 | Nezzar and Nice Beatmap | constructive algorithms geometry greedy sortings | Statement | C | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 1500.0 | 87294 | 2200 |
| 782 | Nezzar and Hidden Permutations | constructive algorithms dfs and similar graphs | Statement | D | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 2250.0 | 87294 | 2800 |
| 179 | Nezzar and Tournaments | data structures greedy | Statement | E | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 2750.0 | 87294 | 3300 |
| 163 | Nezzar and Chocolate Bars | combinatorics fft math probabilities | Statement | F | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 4000.0 | 87294 | 3500 |
| 18994 | Nezzar and Lucky Number | brute force dp math | Statement | B | Codeforces Round 698 (Div. 2) {1478} | PROGRAMMING | 1000.0 | Tutorial | 1100 |
| 10619 | Nezzar and Symmetric Array | constructive algorithms implementation math sortings | Statement | C | Codeforces Round 698 (Div. 2) {1478} | PROGRAMMING | 1500.0 | Tutorial | 1700 |
| 27994 | Nezzar and Colorful Balls | brute force greedy | Statement | A | Codeforces Round 698 (Div. 2) {1478} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 13068 | Searching Local Minimum | binary search interactive ternary search | Statement | A | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #700 | |
| 264 | School Clubs | dp fft math number theory probabilities | Statement | E | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 4000.0 | Editorial of Codeforces Round #700 | |
| 4428 | Painting the Array II | data structures dp greedy implementation | Statement | B2 | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #700 | |
| 7465 | Painting the Array I | constructive algorithms data structures dp greedy implementation | Statement | B1 | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #700 | |
| 1329 | Odd Mineral Resource | bitmasks data structures hashing probabilities trees | Statement | D | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round #700 | |
| 1442 | Continuous City | bitmasks constructive algorithms | Statement | C | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #700 | |
| 27129 | Yet Another String Game | games greedy strings | Statement | A | Codeforces Round 700 (Div. 2) {1480} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #700 | |
| 17923 | The Great Hero | greedy implementation | Statement | B | Codeforces Round 700 (Div. 2) {1480} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #700 | |
| 25728 | Space Navigation | greedy implementation strings | Statement | A | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 500.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 2412 | Sorting Books | data structures dp greedy | Statement | E | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 2500.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 19900 | New Colony | brute force greedy implementation | Statement | B | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 750.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 12394 | Fence Painting | brute force constructive algorithms greedy implementation | Statement | C | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 1500.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 726 | AB Tree | dp greedy trees | Statement | F | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 3000.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 4849 | AB Graph | constructive algorithms graphs greedy implementation strings | Statement | D | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 2000.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 344 | Vabank | binary search interactive | Statement | G | Технокубок 2021 - Финал {1482} | PROGRAMMING | 3500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 1755 | Useful Edges | graphs shortest paths | Statement | F | Технокубок 2021 - Финал {1482} | PROGRAMMING | 2750.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 3743 | Skyline Photo | data structures dp | Statement | E | Технокубок 2021 - Финал {1482} | PROGRAMMING | 2500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 9592 | Restore Modulo | implementation math | Statement | B | Технокубок 2021 - Финал {1482} | PROGRAMMING | 1250.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 21287 | Prison Break | Statement | A | Технокубок 2021 - Финал {1482} | PROGRAMMING | 500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | ||
| 4113 | Playlist | data structures dsu implementation | Statement | D | Технокубок 2021 - Финал {1482} | PROGRAMMING | 2000.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 689 | Exam | trees | Statement | H | Технокубок 2021 - Финал {1482} | PROGRAMMING | 3500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 9973 | Basic Diplomacy | greedy | Statement | C | Технокубок 2021 - Финал {1482} | PROGRAMMING | 1500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 41 | Vabank | binary search interactive | Statement | E | Codeforces Round 709 (Div. 1, based on Technocup 2021 Final Round) {1483} | PROGRAMMING | 2500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 497 | Useful Edges | dp graphs shortest paths | Statement | D | Codeforces Round 709 (Div. 1, based on Technocup 2021 Final Round) {1483} | PROGRAMMING | 1750.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 919 | Skyline Photo | data structures dp | Statement | C | Codeforces Round 709 (Div. 1, based on Technocup 2021 Final Round) {1483} | PROGRAMMING | 1500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 1353 | Playlist | data structures dsu implementation two pointers | Statement | B | Codeforces Round 709 (Div. 1, based on Technocup 2021 Final Round) {1483} | PROGRAMMING | 1000.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 15 | Exam | trees | Statement | F | Codeforces Round 709 (Div. 1, based on Technocup 2021 Final Round) {1483} | PROGRAMMING | 2500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 3852 | Basic Diplomacy | constructive algorithms flows greedy implementation | Statement | A | Codeforces Round 709 (Div. 1, based on Technocup 2021 Final Round) {1483} | PROGRAMMING | 500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 4125 | Restore Modulo | implementation math | Statement | B | Codeforces Round 709 (Div. 2, based on Technocup 2021 Final Round) {1484} | PROGRAMMING | 1250.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 11270 | Prison Break | Statement | A | Codeforces Round 709 (Div. 2, based on Technocup 2021 Final Round) {1484} | PROGRAMMING | 500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial |