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']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
---|---|---|---|---|---|---|---|---|---|
28382 | 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 |
41894 | LCM Problem | constructive algorithms greedy math number theory | Statement | A | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
1095 | 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 | |
20588 | Number into Sequence | constructive algorithms math number theory | Statement | D | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
5994 | Nezzar and Board | constructive algorithms math number theory | Statement | A | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 500.0 | 87294 | 1800 |
5189 | 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 |
23018 | GCD Length | constructive algorithms math number theory | Statement | B | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
15345 | Product 1 Modulo N | constructive algorithms math number theory | Statement | C | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 1500.0 | Codeforces round #716 editorial | |
23342 | Plus and Multiply | constructive algorithms math number theory | Statement | B | Codeforces Round 729 (Div. 2) {1542} | PROGRAMMING | 1250.0 | ||
129 | Xor-quiz | constructive algorithms dp interactive math number theory | Statement | H | Codeforces Global Round 16 {1566} | PROGRAMMING | 3750.0 | Codeforces Global Round 16 Editorial | |
16737 | Di-visible Confusion | constructive algorithms math number theory | Statement | A | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #752 | 1300 |
13658 | Moderate Modular Mode | constructive algorithms math number theory | Statement | B | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #752 | 1600 |
6906 | K-good | constructive algorithms games math number theory | Statement | D | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 2000.0 | Tutorial | |
619 | Euclid Guess | constructive algorithms flows graph matchings math number theory | Statement | G | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 2500.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 2800 |
8461 | Equate Multisets | constructive algorithms data structures graph matchings greedy math number theory | Statement | F | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
2949 | Rectangular Congruence | constructive algorithms math number theory | Statement | E | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 2250.0 | Codeforces Round #822 (Div.2) Editorial | |
125 | Ela and Prime GCD | constructive algorithms math number theory | Statement | F | Dytechlab Cup 2022 {1737} | PROGRAMMING | 3500.0 | Editorial of Dytechlab Cup 2022 | |
17622 | Candies | constructive algorithms math number theory | Statement | B | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 750.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
14691 | No Prime Differences | constructive algorithms math number theory | Statement | C | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 1250.0 | Codeforces Round #877 (Div. 2) Editorial | |
23259 | Yet Another Permutation Problem | constructive algorithms math number theory | Statement | C | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 1500.0 | Codeforces Round #893 (Div. 2) Editorial | 1000 |
26140 | 2023 | constructive algorithms implementation math number theory | Statement | A | Good Bye 2023 {1916} | PROGRAMMING | 250.0 | ||
26133 | Two Divisors | constructive algorithms math number theory | Statement | B | Good Bye 2023 {1916} | PROGRAMMING | 750.0 | ||
1740 | Modular Sequence | constructive algorithms dp greedy implementation math number theory | Statement | E | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 2250.0 | Codeforces Round 924 Editorial | |
5751 | Funny Game | constructive algorithms ds graphs greedy math number theory | Statement | D | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2000.0 | Video Tutorial | |
23689 | Minimize Equal Sum Subarrays | constructive algorithms math number theory | Statement | B | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 750.0 | ||
14137 | Everyone Loves Tres | constructive algorithms greedy math number theory | Statement | B | Codeforces Global Round 27 {2035} | PROGRAMMING | 500.0 |