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 4 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 9100 | k-rounding | brute force math number theory | Statement | A | Технокубок 2018 - Отборочный Раунд 1 {858} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 1200 | |
| 26108 | Mahmoud and Ehab and the bipartiteness | dfs and similar graphs trees | Statement | B | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 1400 | |
| 9783 | Maximum splitting | dp greedy math number theory | Statement | C | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 1300 | |
| 683 | Paths | data structures number theory | Statement | F | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 2600 | |
| 10356 | Divisiblity of Differences | implementation math number theory | Statement | B | Codeforces Round 441 (Div. 2, by Moscow Team Olympiad) {876} | PROGRAMMING | Codeforces Round #441. Editorial. | 1300 | |
| 14503 | Pride | brute force dp greedy math number theory | Statement | A | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 1600 | |
| 4248 | Counting Arrays | combinatorics dp math number theory | Statement | E | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 55989 | 2000 | |
| 4708 | Ralph And His Magic Field | combinatorics constructive algorithms math number theory | Statement | B | Codeforces Round 447 (Div. 2) {894} | PROGRAMMING | Codeforces Round #447 (Div.2 Only) Editorial | 1800 | |
| 621 | Nephren Runs a Cinema | chinese remainder theorem combinatorics math number theory | Statement | D | Codeforces Round 449 (Div. 1) {896} | PROGRAMMING | Codeforces Round #449 Editorial | 2800 | |
| 10684 | Proper Nutrition | brute force implementation number theory | Statement | B | Codeforces Round 451 (Div. 2) {898} | PROGRAMMING | Codeforces Round #451 (Div.2) Editorial | 1300 | |
| 8392 | Position in Fraction | math number theory | Statement | B | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 1300 | |
| 3824 | Unusual Sequences | bitmasks combinatorics dp math number theory | Statement | D | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 2100 | |
| 11990 | Coloring a Tree | dfs and similar dsu greedy | Statement | B | Codeforces Round 453 (Div. 2) {902} | PROGRAMMING | Codeforces Round #453 (Div. 1 & Div. 2) Editorial | 1300 | |
| 2703 | Power Tower | chinese remainder theorem math number theory | Statement | D | Codeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4) {906} | PROGRAMMING | Editorial Codeforces Round 454 (and Technocup 2018 — Elimination Round 4) | 2600 | |
| 13960 | New Year's Eve | bitmasks constructive algorithms number theory | Statement | B | Codeforces Round 456 (Div. 2) {912} | PROGRAMMING | Codeforces Round #456 (Div. 2) Editorial | 1400 | |
| 2067 | Prime Gift | binary search dfs and similar math meet-in-the-middle number theory two pointers | Statement | E | Codeforces Round 456 (Div. 2) {912} | PROGRAMMING | Codeforces Round #456 (Div. 2) Editorial | 2600 | |
| 5146 | Too Easy Problems | binary search brute force data structures greedy sortings | Statement | D | Hello 2018 {913} | PROGRAMMING | Tutorial | 1800 | |
| 235 | Power Substring | math number theory | Statement | G | Hello 2018 {913} | PROGRAMMING | Tutorial | 3100 | |
| 6423 | Bash and a Tough Math Puzzle | data structures number theory | Statement | D | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 1900 | |
| 1464 | Coprime Arrays | math number theory | Statement | G | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 2500 | |
| 31729 | Perfect Number | binary search brute force dp implementation number theory | Statement | B | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 1100 | |
| 2467 | Congruence Equation | chinese remainder theorem math number theory | Statement | E | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 2100 | |
| 8690 | SUM and REPLACE | brute force data structures dsu number theory | Statement | F | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2000 | |
| 2009 | List Of Integers | binary search bitmasks brute force combinatorics math number theory | Statement | G | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2300 | |
| 7713 | Cave Painting | brute force number theory | Statement | C | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 1600 | |
| 745 | Divisibility | constructive algorithms dp greedy number theory | Statement | F | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 2500 | |
| 5430 | Primal Sport | math number theory | Statement | A | VK Cup 2018 - Round 1 {923} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 1700 | |
| 7268 | Vile Grasshoppers | brute force math number theory | Statement | B | Codeforces Round 467 (Div. 2) {937} | PROGRAMMING | Codeforces Round #467, Editorial | 1500 | |
| 11483 | Weird Subtraction Process | math number theory | Statement | B | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 1200 | |
| 2897 | Sad powers | binary search math number theory | Statement | C | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 2100 | |
| 3275 | Mahmoud and Ehab and another array construction task | constructive algorithms greedy math number theory | Statement | D | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 2000 | |
| 1634 | Partitions | combinatorics math number theory | Statement | G | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 2700 | |
| 3649 | Alternating Sum | math number theory | Statement | A | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) {963} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 1800 | |
| 672 | Cutting Rectangle | brute force math number theory | Statement | C | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) {963} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 2600 | |
| 25884 | Cyclic Components | dfs and similar dsu graphs | Statement | E | Codeforces Round 479 (Div. 3) {977} | PROGRAMMING | Codeforces Round #479 (Div. 3) Editorial | 1500 | |
| 2193 | Kuro and GCD and XOR and SUM | binary search bitmasks brute force data structures dp dsu greedy math number theory strings trees | Statement | D | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | 1750.0 | Codeforces Round #482 (Div. 2) Editorial | 2200 |
| 3017 | Perfect Groups | dp math number theory | Statement | D | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2100 | |
| 829 | Billiard | geometry number theory | Statement | E | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 2500 | |
| 8387 | Fair | graphs greedy number theory shortest paths | Statement | A | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 1600 | |
| 911 | Prince's Problem | brute force data structures math number theory trees | Statement | E | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 2900 | |
| 750 | Oppa Funcan Style Remastered | graphs math number theory shortest paths | Statement | F | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 3200 | |
| 2342 | GCD Counting | divide and conquer dp dsu number theory trees | Statement | G | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 2400 | |
| 6781 | Nastya Studies Informatics | math number theory | Statement | B | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 1700 | |
| 937 | Number Clicker | divide and conquer graphs meet-in-the-middle number theory | Statement | E | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 2700 | |
| 11390 | Polycarp and Div 3 | dp greedy number theory | Statement | D | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 1500 | |
| 1039 | Pave the Parallelepiped | bitmasks brute force combinatorics math number theory | Statement | B | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 2400 | |
| 5977 | Border | number theory | Statement | C | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 1800 | |
| 318 | Appropriate Team | bitmasks math number theory | Statement | G | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2800 | |
| 8527 | Weakened Common Divisor | brute force greedy number theory | Statement | B | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 1600 | |
| 4150 | Recovering BST | brute force dp math number theory trees | Statement | D | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 2000 | |
| 361 | X-mouse in the Campus | bitmasks math number theory | Statement | G | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 2800 | |
| 2772 | Multicolored Markers | binary search brute force math number theory | Statement | F | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 2100 | |
| 6262 | Vasya and Triangle | geometry number theory | Statement | D | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 1700 | |
| 398 | Linear Congruential Generator | number theory | Statement | G | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 3000 | |
| 12020 | Square Difference | math number theory | Statement | B | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 1100 | |
| 2627 | Divisors | interactive math number theory | Statement | D | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 2000 | |
| 9985 | Enlarge GCD | number theory | Statement | A | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 1700 | |
| 999 | Region Separation | combinatorics dp number theory trees | Statement | C | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 2900 | |
| 1772 | Covered Points | fft geometry number theory | Statement | E | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 2300 | |
| 1864 | Relatively Prime Powers | combinatorics math number theory | Statement | F | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 2400 | |
| 3020 | Make It One | bitmasks combinatorics dp math number theory shortest paths | Statement | F | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 2500 | |
| 597 | Space Isaac | hashing number theory | Statement | B | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 2500 | |
| 18872 | Relatively Prime Pairs | greedy math number theory | Statement | B | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 1000 | |
| 214 | Epic Convolution | chinese remainder theorem fft math number theory | Statement | H | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 3400 | |
| 2057 | Lucky Days | math number theory | Statement | C | Mail.Ru Cup 2018 Round 2 {1055} | PROGRAMMING | Mail.Ru Cup 2018 Round 2 — analysis | 1900 | |
| 4559 | Divide Candies | math number theory | Statement | B | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 1600 | |
| 10825 | Multiplicity | data structures dp implementation math number theory | Statement | C | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 1700 | |
| 9945 | Math | greedy math number theory | Statement | B | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 1600 | |
| 13071 | LCM | math number theory | Statement | B | Codeforces Round 518 (Div. 2) [Thanks, Mail.Ru!] {1068} | PROGRAMMING | E | 1200 | |
| 2625 | Find a Number | dp graphs number theory shortest paths | Statement | A | 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {1070} | PROGRAMMING | Solution to problem M. Algoland and Berland of 2018-2019 ICPC, NEERC | 2200 | |
| 14633 | Divisor Subtraction | implementation math number theory | Statement | B | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1200 | |
| 2829 | Missing Numbers | binary search constructive algorithms greedy math number theory | Statement | E | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 1900 | |
| 10576 | New Year and the Sphere Transmission | math number theory | Statement | C | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 1400 | |
| 227 | New Year and the Factorisation Collaboration | interactive math number theory | Statement | G | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 3100 | |
| 3201 | Makoto and a Blackboard | dp math number theory probabilities | Statement | D | Hello 2019 {1097} | PROGRAMMING | 64310 | 2200 | |
| 1477 | Alex and a TV Show | bitmasks combinatorics number theory | Statement | F | Hello 2019 {1097} | PROGRAMMING | 64310 | 2400 | |
| 274 | Fedya the Potter | binary search implementation math number theory | Statement | E | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 3400 | |
| 5452 | GCD Counting | data structures dfs and similar dp number theory trees | Statement | D | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 2000 | |
| 284 | Radix sum | fft math number theory | Statement | E | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 3300 | |
| 1187 | Lunar New Year and a Recursive Sequence | math matrices number theory | Statement | F | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 2400 | |
| 17783 | Digital root | math number theory | Statement | B | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 1100 | |
| 3905 | Compression | dp implementation math number theory | Statement | D | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 1800 | |
| 25273 | Divisors of Two Integers | brute force greedy math number theory | Statement | B | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1100 | |
| 1507 | Sasha and Interesting Fact from Graph Theory | brute force combinatorics dp math trees | Statement | D | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2600 | |
| 599 | Sasha and a Very Easy Test | data structures number theory | Statement | E | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2700 | |
| 10031 | Meaningless Operations | constructive algorithms math number theory | Statement | C | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 1500 | |
| 8183 | Sasha and Magnetic Machines | greedy number theory | Statement | B | Codeforces Round 539 (Div. 2) {1113} | PROGRAMMING | Codeforces Round #539 Editorial | 1300 | |
| 7917 | Trailing Loves (or L'oeufs?) | brute force implementation math number theory | Statement | C | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 1700 | |
| 3202 | Arithmetic Progression | binary search interactive number theory probabilities | Statement | E | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 2100 | |
| 2460 | Please, another Queries on Array? | bitmasks data structures divide and conquer math number theory | Statement | F | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 2500 | |
| 14433 | Preparation for International Women's Day | math number theory | Statement | B | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1300 | |
| 16690 | Zero Quantity Maximization | hashing math number theory | Statement | D | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1500 | |
| 2175 | Cooperative Game | constructive algorithms interactive number theory | Statement | D | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2500 | |
| 2712 | Steps to One | dp math number theory probabilities | Statement | D | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 2300 | |
| 11614 | Nirvana | brute force math number theory | Statement | B | Codeforces Round 549 (Div. 2) {1143} | PROGRAMMING | Codeforces Round #549 Editorial | 1300 | |
| 4434 | Median String | bitmasks math number theory strings | Statement | E | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1900 | |
| 1207 | Frog Jumping | dfs and similar math number theory | Statement | D | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2100 | |
| 390 | Gold Experience | constructive algorithms graphs math number theory probabilities | Statement | G | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 3100 | |
| 17979 | Prefix Sum Primes | constructive algorithms greedy math number theory | Statement | A | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 1300 | |
| 7102 | Neko does Maths | brute force math number theory | Statement | C | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 1800 | |
| 3299 | Minimum Possible LCM | brute force greedy math number theory | Statement | G | Codeforces Round 552 (Div. 3) {1154} | PROGRAMMING | Codeforces Round #552 (Div. 3) Editorial | 2400 | |
| 9798 | Alarm Clocks Everywhere | math number theory | Statement | C | Educational Codeforces Round 63 (Rated for Div. 2) {1155} | PROGRAMMING | 66687 | 1300 | |
| 19852 | Almost All Divisors | math number theory | Statement | D | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 1600 | |
| 11933 | All the Vowels Please | constructive algorithms math number theory | Statement | B | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 1100 | |
| 3013 | The LCMs Must be Large | bitmasks brute force constructive algorithms math number theory | Statement | E | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 2000 | |
| 12807 | Ehab and a Special Coloring Problem | constructive algorithms number theory | Statement | C | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 1300 | |
| 1785 | Ehab and the Expected GCD Problem | combinatorics dp math number theory | Statement | E | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 2500 | |
| 5845 | Recover it! | dfs and similar graphs greedy number theory sortings | Statement | D | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1900 | |
| 7935 | Prime Graph | constructive algorithms greedy math number theory | Statement | D | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1600 | |
| 3379 | Product Oriented Recurrence | dp math matrices number theory | Statement | E | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2200 | |
| 402 | Maximum Sine | binary search data structures number theory | Statement | F | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2900 | |
| 6602 | Heidi Learns Hashing (Easy) | brute force math number theory | Statement | A1 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 1200 | |
| 1130 | Heidi Learns Hashing (Medium) | brute force number theory | Statement | A2 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2100 | |
| 155 | Heidi Learns Hashing (Hard) | fft math number theory | Statement | A3 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 3100 | |
| 5190 | Count Pairs | math matrices number theory two pointers | Statement | B | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 2200 | |
| 108 | Tokitsukaze and Powers | number theory probabilities | Statement | F | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 3300 | |
| 1223 | Crossword Expert | combinatorics dp number theory probabilities two pointers | Statement | F | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 2500 | |
| 8210 | Submarine in the Rybinsk Sea (easy edition) | combinatorics math number theory | Statement | D1 | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1500 | |
| 4905 | Submarine in the Rybinsk Sea (hard edition) | combinatorics math number theory | Statement | D2 | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1700 | |
| 1080 | GCD Groups 2 | greedy number theory probabilities | Statement | F | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2900 | |
| 10644 | Round Corridor | math number theory | Statement | C | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1500 | |
| 1164 | Graph Traveler | brute force data structures dfs and similar dp graphs implementation math number theory | Statement | F | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 2500 | |
| 2085 | Natasha, Sasha and the Prefix Sums | combinatorics dp math number theory | Statement | E | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 2400 | |
| 929 | Polygons | greedy math number theory | Statement | G | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 2700 | |
| 8521 | Koala and Lights | implementation math number theory | Statement | B | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 1300 | |
| 3601 | Kamil and Making a Stream | math number theory trees | Statement | C | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2100 | |
| 84 | King's Path | *special math trees | Statement | G | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2500 | |
| 52 | Unusual Graph | *special graphs | Statement | I | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 3000 | |
| 10824 | Substring Game in the Lesson | games greedy strings | Statement | C | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 1300 | |
| 12161 | Multiplication Table | math number theory | Statement | B | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 1300 | |
| 4144 | Alex and Julian | bitmasks math number theory | Statement | D | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 1900 | |
| 276 | Wooden Raft | binary search math number theory | Statement | G | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 3100 | |
| 10250 | Power Products | hashing math number theory | Statement | D | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 1900 | |
| 661 | To Make 1 | bitmasks constructive algorithms dp greedy number theory | Statement | G | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 3000 | |
| 9663 | Primes and Multiplication | math number theory | Statement | C | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 1600 | |
| 28253 | Prime Subtraction | math number theory | Statement | A | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 900 | |
| 7797 | Ivan the Fool and the Probability Theory | combinatorics dp math | Statement | A | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 1700 | |
| 13280 | Tile Painting | constructive algorithms math number theory | Statement | A | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 1500 | |
| 9397 | 0-1 MST | dfs and similar dsu graphs sortings | Statement | B | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 1900 | |
| 8336 | The Football Season | brute force math number theory | Statement | C | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 1900 | |
| 14922 | Good ol' Numbers Coloring | math number theory | Statement | A | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1000 | |
| 5033 | Send Boxes to Alice (Easy Version) | constructive algorithms greedy math number theory ternary search two pointers | Statement | B1 | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2000 | |
| 3430 | Send Boxes to Alice (Hard Version) | constructive algorithms greedy math number theory ternary search two pointers | Statement | B2 | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2100 | |
| 740 | Divisor Set | divide and conquer fft greedy math number theory | Statement | G | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 2700 | |
| 8810 | Infinite Fence | greedy math number theory | Statement | C | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1700 | |
| 14687 | Everyone is a Winner! | binary search math meet-in-the-middle number theory | Statement | C | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 1400 | |
| 1100 | Beautiful Fibonacci Problem | constructive algorithms number theory | Statement | F | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 3600 | |
| 10076 | Diverse Matrix | constructive algorithms greedy math number theory | Statement | C | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 1400 | |
| 17102 | Make Them Odd | greedy number theory | Statement | B | Codeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4) {1277} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1200 | |
| 2529 | Cards | combinatorics dp math number theory probabilities | Statement | F | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2600 | |
| 28324 | Fadi and LCM | brute force math number theory | Statement | C | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 1400 | |
| 1371 | Classical? | binary search combinatorics number theory | Statement | F | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 2800 | |
| 977 | Chaotic V. | dp graphs greedy math number theory trees | Statement | D | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 1750.0 | Codeforces Round #614 Editorial | 2700 |
| 46851 | Product of Three Numbers | greedy math number theory | Statement | C | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 1300 | |
| 10284 | Same GCDs | math number theory | Statement | D | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 1800 | |
| 51 | Amazing bitset | Statement | E | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | |||
| 19102 | Kuroni and Impossible Calculation | brute force combinatorics math number theory | Statement | C | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 1250.0 | Ozon Tech Challenge 2020 Editorial | 1600 |
| 3248 | Kuroni and the Punishment | math number theory probabilities | Statement | F | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 2500.0 | Ozon Tech Challenge 2020 Editorial | 2500 |
| 103 | Bad Cryptography | math number theory | Statement | F | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 3500.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 3300 |
| 18399 | Adding Powers | bitmasks greedy implementation math number theory ternary search | Statement | C | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 27585 | Two Regular Polygons | geometry math number theory | Statement | A | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 2721 | Instant Noodles | graphs hashing math number theory | Statement | C | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 1500.0 | Codeforces Round #626 Editorial | |
| 27365 | Yet Another Tetris Problem | implementation number theory | Statement | A | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 13665 | Ehab the Xorcist | bitmasks constructive algorithms greedy number theory | Statement | D | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 1750.0 | 74235 | 1700 |
| 2346 | Ehab's REAL Number Theory Problem | brute force dfs and similar graphs number theory shortest paths | Statement | E | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 2500.0 | 74235 | 2700 |
| 46473 | EhAb AnD gCd | constructive algorithms greedy number theory | Statement | A | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 500.0 | 74235 | 800 |
| 32728 | Bad Ugly Numbers | constructive algorithms number theory | Statement | A | Codeforces Global Round 7 {1326} | PROGRAMMING | 500.0 | 74961 | 1000 |
| 3558 | Infinite Path | brute force dfs and similar graphs math number theory | Statement | D | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2200 | |
| 7163 | Limericks | math number theory | Statement | B | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 19886 | Exercising Walk | greedy implementation math | Statement | A | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 500.0 | Codeforces Round #630 Editorial | 1200 |
| 19191 | Composite Coloring | brute force constructive algorithms greedy math number theory | Statement | B | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1000.0 | Codeforces Round #630 Editorial | 1500 |
| 1132 | Independent Set | dfs and similar dp trees | Statement | F | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 2250.0 | Codeforces Round #630 Editorial | 2500 |
| 4585 | Kate and imperfection | greedy implementation math number theory sortings two pointers | Statement | F | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 2500.0 | Codeforces Round #632 (Div. 2) editorial | |
| 3187 | Divisor Paths | combinatorics graphs greedy math number theory | Statement | E | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 15017 | Yet Another Counting Problem | math number theory | Statement | C | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 1700 | |
| 16533 | Hilbert's Hotel | math number theory sortings | Statement | A | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 500.0 | Codeforces Round #639 Editorial | 1600 |
| 150 | Two IP Cameras | *special math number theory | Statement | G | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 2300 | |
| 21889 | Orac and LCM | data structures math number theory | Statement | A | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 500.0 | Codeforces Round #641 Editorial | 1600 |
| 29828 | Orac and Models | dp math number theory | Statement | B | Codeforces Round 641 (Div. 2) {1350} | PROGRAMMING | 1000.0 | Codeforces Round #641 Editorial | 1400 |
| 27437 | Orac and Factors | math | Statement | A | Codeforces Round 641 (Div. 2) {1350} | PROGRAMMING | 500.0 | Codeforces Round #641 Editorial | 900 |
| 967 | Guess Divisors Count | constructive algorithms interactive number theory | Statement | F | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 3000.0 | Codeforces Round #643 (Div. 2) Editorial | 2600 |
| 6756 | Modular Stability | combinatorics math number theory | Statement | E | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 2000 | |
| 43467 | Buying Shovels | math number theory | Statement | D | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1300 | |
| 8370 | A/B Matrix | constructive algorithms flows greedy math number theory | Statement | G | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1900 | |
| 31460 | XXXXX | brute force data structures number theory two pointers | Statement | A | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 750.0 | Codeforces round #649 editorial | 1200 |
| 12443 | Two Divisors | constructive algorithms math number theory | Statement | D | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 5907 | Necklace Assembly | binary search brute force dp greedy number theory | Statement | E | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 25141 | GCD Compression | brute force constructive algorithms math number theory | Statement | B | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 1000.0 | Editorial — Codeforces Round #651 | |
| 65262 | Maximum GCD | brute force greedy implementation number theory | Statement | A | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 500.0 | Editorial — Codeforces Round #651 | |
| 27240 | Number Game | games math number theory | Statement | C | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 1500.0 | Editorial — Codeforces Round #651 | |
| 2517 | Asterism (Hard Version) | binary search math number theory sortings | Statement | E2 | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1250.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 5536 | Asterism (Easy Version) | brute force combinatorics implementation math number theory sortings | Statement | E1 | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1500.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 36820 | Omkar and Last Class of Math | constructive algorithms greedy math number theory | Statement | B | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 1000.0 | Codeforces Round #655 Editorial | 1300 |
| 2963 | Sum of Digits | brute force constructive algorithms dp greedy math number theory | Statement | E | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 278 | Cubic Lattice | geometry math matrices number theory | Statement | I | Codeforces Global Round 9 {1375} | PROGRAMMING | 4000.0 | 79731 | |
| 13200 | Dubious Cyrpto | binary search brute force math number theory | Statement | B | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 750.0 | Codeforces Round #657 Editorial | 1500 |
| 12334 | Acacius and String | brute force implementation strings | Statement | A | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 500.0 | Codeforces Round #657 Editorial | 1500 |
| 25988 | Captain Flint and Crew Recruitment | brute force math number theory | Statement | A | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 750.0 | Codeforces Round #660 Editorial | 800 |
| 50336 | LCM Problem | constructive algorithms greedy math number theory | Statement | A | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 3733 | Calendar Ambiguity | math number theory | Statement | E | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 16742 | Multiples of Length | constructive algorithms greedy number theory | Statement | A | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 500.0 | Codeforces Round #666 — Editorial | |
| 15521 | Power Sequence | binary search brute force math number theory ternary search | Statement | B | Codeforces Round 666 (Div. 2) {1397} | PROGRAMMING | 1000.0 | Codeforces Round #666 — Editorial | |
| 1287 | Running Competition | bitmasks fft math number theory | Statement | G | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 1183 | x-prime Substrings | bitmasks dp greedy number theory string suffix structures strings | Statement | F | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 10580 | Maximum Distributed Tree | constructive algorithms dfs and similar greedy math number theory sortings trees | Statement | D | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1750.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 26952 | Mere Array | constructive algorithms math number theory number theory sortings sortings | Statement | C | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 28683 | Distance and Axis | math number theory | Statement | A | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 1278 | Game of Pairs | constructive algorithms dfs and similar interactive math number theory | Statement | D | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 2250.0 | Codeforces Round #668 Editorial | |
| 1889 | Deleting Numbers | binary search brute force interactive number theory | Statement | E | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 2750.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 18103 | Big Vova | brute force greedy math number theory | Statement | B | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 1000.0 | Codeforces Round #669 Editorial | |
| 31067 | Fair Numbers | brute force number theory | Statement | B | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 1000.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 435 | Equal Product | data structures math number theory two pointers | Statement | F | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 3523 | Decryption | bitmasks constructive algorithms implementation math number theory | Statement | E | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 2250.0 | Codeforces Round #671 Editorial | |
| 1290 | Boring Queries | data structures number theory trees | Statement | F | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 2750.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 5465 | Lonely Numbers | binary search math number theory | Statement | K | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 1659 | Xum | bitmasks constructive algorithms math number theory | Statement | E | Codeforces Global Round 11 {1427} | PROGRAMMING | 1500.0 | Editorial of Global Round 11 | 2500 |
| 642 | Sum Over Subsets | combinatorics math number theory | Statement | F | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 3000.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 172 | Differentiating Games | games interactive | Statement | F | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 2500.0 | 84298 | |
| 14451 | Division | math number theory | Statement | A | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 500.0 | Codeforces Round #680 Editorial | |
| 22373 | Number into Sequence | constructive algorithms math number theory | Statement | D | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 25635 | Row GCD | math number theory | Statement | A | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 500.0 | Codeforces Round #691 Editorial (finished) | |
| 18199 | Add to Neighbour and Remove | greedy math number theory | Statement | D | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 4226 | 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) | ||
| 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) | ||
| 10228 | 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 | ||
| 6791 | Strange Definition | bitmasks brute force data structures graphs math number theory | Statement | B | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 750.0 | 86464 | |
| 38911 | Strange Partition | greedy math number theory | Statement | A | Codeforces Round 694 (Div. 2) {1471} | PROGRAMMING | 500.0 | Codeforces Round #694 Editorial | |
| 40992 | 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 | |
| 88123 | Odd Divisor | bitmasks math number theory | Statement | A | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 7877 | Strange Beauty | dfs and similar dp math number theory | Statement | G | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 6553 | Nezzar and Board | constructive algorithms math number theory | Statement | A | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 500.0 | 87294 | 1800 |
| 266 | School Clubs | dp fft math number theory probabilities | Statement | E | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 4000.0 | Editorial of Codeforces Round #700 | |
| 11086 | Floor and Mod | binary search brute force data structures math number theory | Statement | C | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #701 (Div. 2) | 1700 |
| 5669 | Multiples and Power Differences | constructive algorithms math number theory | Statement | D | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #701 (Div. 2) | 2200 |
| 20699 | Pythagorean Triples | binary search math number theory | Statement | D | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 29137 | Cat Cycle | math number theory | Statement | B | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 135 | Painting Numbers | *special data structures greedy number theory | Statement | G | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 506 | Enchanted Matrix | bitmasks interactive number theory | Statement | F | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 3250.0 | Codeforces Round #705 (Div.2) Editorial | |
| 5778 | GCD of an Array | data structures math number theory sortings two pointers | Statement | D | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 2250.0 | Codeforces Round #705 (Div.2) Editorial | |
| 9134 | Square-free division (easy version) | data structures dp greedy math number theory | Statement | E1 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1500.0 | Codeforces Round #708 Editorial | 1700 |
| 1920 | Square-free division (hard version) | data structures dp greedy hashing math number theory | Statement | E2 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1500.0 | Codeforces Round #708 Editorial | 2500 |
| 7103 | The Number of Pairs | math number theory | Statement | D | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 2321 | Two chandeliers | binary search brute force chinese remainder theorem math number theory | Statement | B | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 750.0 | Codeforces Round #707 Editorial | 2200 |
| 2121 | Digits | brute force dp math number theory | Statement | D | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 24746 | GCD Length | constructive algorithms math number theory | Statement | B | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 9556 | Short Task | brute force dp math number theory | Statement | G | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 6527 | GCD and MST | constructive algorithms data structures dsu graphs implementation number theory sortings | Statement | D | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 2000.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 18432 | Product 1 Modulo N | constructive algorithms math number theory | Statement | C | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 1500.0 | Codeforces round #716 editorial | |
| 25397 | Perfectly Imperfect Array | math number theory | Statement | A | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 500.0 | Codeforces round #716 editorial | |
| 1365 | Phoenix and Odometers | dfs and similar graphs math number theory | Statement | G | Codeforces Global Round 14 {1515} | PROGRAMMING | 3500.0 | Editorial |