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 |
---|---|---|---|---|---|---|---|---|---|
54247 | Maximum GCD | brute force greedy implementation number theory | Statement | A | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 500.0 | Editorial — Codeforces Round #651 | |
2771 | 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 | ||
17198 | Big Vova | brute force greedy math number theory | Statement | B | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 1000.0 | Codeforces Round #669 Editorial | |
25885 | AvtoBus | brute force greedy math number theory | Statement | A | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 500.0 | Codeforces Round #791 (Div. 2) Editorial | |
3089 | Fibonacci Strings | brute force data structures greedy implementation math number theory | Statement | B | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 1250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
1651 | Tonya and Burenka-179 | brute force data structures greedy math number theory | Statement | C | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 1250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
25016 | Coprime | brute force greedy number theory | Statement | D | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
9206 | Lucky Chains | brute force dp greedy math number theory | Statement | D | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
19056 | GCD Partition | brute force greedy math number theory | Statement | B | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1000.0 | 111841 | |
12500 | Pull Your Luck | brute force greedy math number theory | Statement | C | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 1000.0 | Nebius Welcome Round Editorial | |
28694 | Longest Divisors Interval | brute force combinatorics greedy math number theory | Statement | B | Codeforces Round 889 (Div. 2) {1855} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
11664 | The Walkway | brute force greedy implementation math number theory | Statement | B | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 1250.0 | Codeforces Round #893 (Div. 2) Editorial | 1500 |
1053 | Two Permutations (Easy Version) | brute force constructive algorithms greedy number theory | Statement | E1 | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
14368 | Insert and Equalize | brute force constructive algorithms greedy math number theory | Statement | C | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
20690 | A Balanced Problemset? | brute force greedy math number theory | Statement | B | Codeforces Round 921 (Div. 2) {1925} | PROGRAMMING | 1000.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
8895 | Squaring | brute force constructive algorithms data structures greedy implementation math number theory | Statement | C | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 1750.0 | Video Tutorial | |
3384 | Prefix GCD | brute force dp greedy math number theory | Statement | E | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2500.0 | ||
15412 | Maximize Mex | brute force greedy math number theory | Statement | B | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 750.0 | ||
2724 | Common Generator | brute force constructive algorithms greedy math number theory | Statement | E | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 2500.0 |