Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
< 1 2 3 ... 64 65 66 67 68 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 19540 | Reverse Binary Strings | constructive algorithms greedy | Statement | B | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 13042 | Minimal Height Tree | graphs greedy shortest paths trees | Statement | D | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 18077 | Marketing Scheme | brute force constructive algorithms greedy math | Statement | A | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 3532 | Make It Increasing | data structures dp implementation | Statement | E | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 1328 | Emotional Fishermen | combinatorics dp math | Statement | F | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 1034 | Death DBMS | data structures hashing string suffix structures strings trees | Statement | G | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 10702 | Chef Monocarp | dp flows graph matchings greedy | Statement | C | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 1365 | 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 | |
| 20678 | Valerii Against Everyone | constructive algorithms greedy sortings | Statement | B | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 750.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 19378 | Specific Tastes of Andre | constructive algorithms | Statement | A | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 500.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 4248 | Powerful Ksenia | bitmasks constructive algorithms | Statement | D | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 1750.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 653 | Olha and Igor | interactive trees | Statement | F | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 3000.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 10718 | Engineer Artem | 2-sat constructive algorithms | Statement | C | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 1250.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 393 | INOI Final Contests | combinatorics dp | Statement | D | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 2500.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 1954 | 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 | |
| 1487 | 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 | |
| 225 | 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 | |
| 5178 | 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 | |
| 9471 | 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 | |
| 19930 | Sum of Medians | greedy math | Statement | B | Codeforces Round 684 (Div. 2) {1440} | PROGRAMMING | 1000.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 19888 | Buy the String | implementation math | Statement | A | Codeforces Round 684 (Div. 2) {1440} | PROGRAMMING | 500.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 2382 | 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 | |
| 4537 | Identify the Operations | brute force combinatorics data structures ds greedy implementation | Statement | B | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 1000.0 | 84298 | |
| 1739 | 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 | |
| 9014 | Extreme Subtraction | dp greedy | Statement | A | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 500.0 | 84298 | |
| 140 | Differentiating Games | games interactive | Statement | F | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 2500.0 | 84298 | |
| 627 | 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 | |
| 15644 | 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 | |
| 15906 | 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 | |
| 1276 | 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 | |
| 16294 | 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 | |
| 1632 | Team-Building | 2-sat dfs and similar ds graphs | Statement | C | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 1500.0 | Codeforces Round #680 Editorial | |
| 615 | 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 | |
| 145 | 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 | |
| 13315 | Division | math number theory | Statement | A | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 500.0 | Codeforces Round #680 Editorial | |
| 6392 | 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 | |
| 15450 | Elimination | math | Statement | B | Codeforces Round 680 (Div. 2, based on Moscow Team Olympiad) {1445} | PROGRAMMING | 1000.0 | Codeforces Round #680 Editorial | |
| 19174 | Array Rearrangment | greedy sortings | Statement | A | Codeforces Round 680 (Div. 2, based on Moscow Team Olympiad) {1445} | PROGRAMMING | 500.0 | Codeforces Round #680 Editorial | |
| 3711 | 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 | |
| 96 | Long Recovery | constructive algorithms dfs and similar | Statement | E | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 3000.0 | E | |
| 341 | Line Distance | binary search data structures geometry | Statement | F | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 3000.0 | E | |
| 15810 | Knapsack | constructive algorithms greedy sortings | Statement | A | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 500.0 | E | |
| 1379 | Frequency Problem (Hard Version) | data structures greedy | Statement | D2 | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 750.0 | E | |
| 1803 | Frequency Problem (Easy Version) | data structures greedy | Statement | D1 | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1750.0 | E | |
| 7988 | Catching Cheaters | dp strings | Statement | B | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1000.0 | E | |
| 17564 | Numbers Box | greedy math | Statement | B | Codeforces Round 683 (Div. 2, by Meet IT) {1447} | PROGRAMMING | 1000.0 | Meet IT Codeforces Round Editorial | |
| 13892 | Add Candies | constructive algorithms math | Statement | A | Codeforces Round 683 (Div. 2, by Meet IT) {1447} | PROGRAMMING | 500.0 | Meet IT Codeforces Round Editorial | |
| 1356 | The Struggling Contestant | constructive algorithms greedy | Statement | F | Codeforces Global Round 12 {1450} | PROGRAMMING | 2750.0 | Codeforces Global Round 12 Editorial | |
| 5554 | Rating Compression | data structures implementation two pointers | Statement | D | Codeforces Global Round 12 {1450} | PROGRAMMING | 1750.0 | Codeforces Global Round 12 Editorial | |
| 232 | Multithreading (Hard Version) | combinatorics implementation math | Statement | H2 | Codeforces Global Round 12 {1450} | PROGRAMMING | 1750.0 | Codeforces Global Round 12 Editorial | |
| 451 | Multithreading (Easy Version) | combinatorics fft math | Statement | H1 | Codeforces Global Round 12 {1450} | PROGRAMMING | 2750.0 | Codeforces Global Round 12 Editorial | |
| 3761 | Errich-Tac-Toe (Hard Version) | constructive algorithms math | Statement | C2 | Codeforces Global Round 12 {1450} | PROGRAMMING | 750.0 | Codeforces Global Round 12 Editorial | |
| 5576 | Errich-Tac-Toe (Easy Version) | constructive algorithms | Statement | C1 | Codeforces Global Round 12 {1450} | PROGRAMMING | 1000.0 | Codeforces Global Round 12 Editorial | |
| 318 | Communism | bitmasks dp trees | Statement | G | Codeforces Global Round 12 {1450} | PROGRAMMING | 3750.0 | Codeforces Global Round 12 Editorial | |
| 1171 | Capitalism | constructive algorithms dfs and similar graphs shortest paths | Statement | E | Codeforces Global Round 12 {1450} | PROGRAMMING | 2500.0 | Codeforces Global Round 12 Editorial | |
| 15279 | Balls of Steel | brute force geometry greedy | Statement | B | Codeforces Global Round 12 {1450} | PROGRAMMING | 750.0 | Codeforces Global Round 12 Editorial | |
| 18071 | Avoid Trygub | constructive algorithms sortings | Statement | A | Codeforces Global Round 12 {1450} | PROGRAMMING | 500.0 | Codeforces Global Round 12 Editorial | |
| 24418 | Subtract or Divide | greedy math | Statement | A | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 500.0 | Editorial — Codeforces Round #685 | |
| 15933 | String Equality | dp greedy hashing implementation strings | Statement | C | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #685 | |
| 1005 | Nullify The Matrix | bitmasks games | Statement | F | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 3000.0 | Editorial — Codeforces Round #685 | |
| 19443 | Non-Substring Subsequence | greedy implementation strings | Statement | B | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 750.0 | Editorial — Codeforces Round #685 | |
| 9658 | Circle Game | games geometry math | Statement | D | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1750.0 | Editorial — Codeforces Round #685 | |
| 3049 | Bitwise Queries (Hard Version) | bitmasks constructive algorithms interactive math | Statement | E2 | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1000.0 | Editorial — Codeforces Round #685 | |
| 4485 | Bitwise Queries (Easy Version) | bitmasks constructive algorithms interactive math | Statement | E1 | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1500.0 | Editorial — Codeforces Round #685 | |
| 1575 | Two Editorials | brute force data structures greedy implementation | Statement | E | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 19843 | Two Brackets | data structures greedy | Statement | C | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 14888 | Toy Blocks | binary search greedy math sortings | Statement | B | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 22238 | Robot Program | math | Statement | A | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 8096 | Radio Towers | combinatorics dp math | Statement | D | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 494 | Game On Tree | Statement | G | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | |||
| 324 | Divide Powers | constructive algorithms greedy | Statement | F | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 6074 | Triangles | greedy implementation | Statement | C | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 1500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 13483 | Suffix Operations | constructive algorithms implementation | Statement | B | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 1000.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 860 | Even Harder | dp | Statement | F | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 3500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 2077 | 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 | |
| 4207 | 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 | |
| 22775 | Cancel the Trains | implementation | Statement | A | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 28790 | Unique Bid Auction | implementation | Statement | B | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 41206 | Special Permutation | constructive algorithms probabilities | Statement | A | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 21669 | Sequence Transformation | greedy implementation | Statement | C | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 5926 | Number of Simple Paths | combinatorics data structures dfs and similar ds graphs trees | Statement | E | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 20787 | Number into Sequence | constructive algorithms math number theory | Statement | D | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 4153 | 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 | ||
| 457 | String and Operations | dp greedy | Statement | F | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 26640 | Strange Functions | constructive algorithms | Statement | A | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 12460 | Sequence and Swaps | dp greedy sortings | Statement | D | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 19756 | Ping-pong | constructive algorithms games math | Statement | C | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 22187 | Jumps | constructive algorithms math | Statement | B | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 1554 | 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 | ||
| 426 | Forbidden Value | data structures | Statement | G | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 292 | 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) | |
| 19213 | Row GCD | math number theory | Statement | A | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 500.0 | Codeforces Round #691 Editorial (finished) | |
| 290 | Range Diameter Sum | Statement | F | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 3500.0 | Codeforces Round #691 Editorial (finished) | ||
| 501 | Nim Shortcuts | data structures games | Statement | E | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 2250.0 | Codeforces Round #691 Editorial (finished) | |
| 1392 | Latin Square | data structures implementation math matrices | Statement | C | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 1500.0 | Codeforces Round #691 Editorial (finished) | |
| 3613 | Glass Half Spilled | dp | Statement | B | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 1000.0 | Codeforces Round #691 Editorial (finished) | |
| 1196 | Flip and Reverse | graphs greedy | Statement | D | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 2000.0 | Codeforces Round #691 Editorial (finished) | |
| 17095 | Red-Blue Shuffle | math probabilities | Statement | A | Codeforces Round 691 (Div. 2) {1459} | PROGRAMMING | 750.0 | Codeforces Round #691 Editorial (finished) | |
| 15420 | Move and Turn | dp math | Statement | B | Codeforces Round 691 (Div. 2) {1459} | PROGRAMMING | 1000.0 | Codeforces Round #691 Editorial (finished) | |
| 2140 | 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 |