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
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 592 | New Year and Finding Roots | constructive algorithms implementation interactive trees | Statement | F | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 2700 | |
| 2571 | Pick Heroes | greedy implementation interactive sortings | Statement | C | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 1700 | |
| 505 | Tricky Interactor | constructive algorithms implementation interactive | Statement | F | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 2500 | |
| 3160 | Ehab and another another xor problem | bitmasks constructive algorithms implementation interactive | Statement | D | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 2000 | |
| 1956 | Ehab and the Big Finale | constructive algorithms divide and conquer graphs implementation interactive trees | Statement | F | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 2300 | |
| 1256 | Palindromic Paths | implementation interactive | Statement | C | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 2500 | |
| 1068 | Intriguing Selection | brute force constructive algorithms implementation interactive sortings | Statement | I | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 2700 | |
| 4405 | Guess The Maximums | binary search divide and conquer implementation interactive math | Statement | D | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 2000.0 | 78202 | 2100 |
| 1104 | Lamps on a Circle | games greedy implementation interactive math | Statement | F | Codeforces Global Round 8 {1368} | PROGRAMMING | 3000.0 | Codeforces Global Round 8: editorial | |
| 16051 | Is it rated - 2 | implementation interactive | Statement | A | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | ||
| 3569 | Grid Xor | constructive algorithms greedy implementation interactive math | Statement | C | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 1250.0 | 99276 | |
| 577 | Interactive Factorial Guessing | brute force games implementation interactive | Statement | I | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2500 | ||
| 16582 | Interview | binary search implementation interactive | Statement | E | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 3593 | Sum Graph | constructive algorithms graphs implementation interactive math shortest paths trees | Statement | B | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #865 | 2000 |
| 3709 | Rudolph and Mimic | constructive algorithms greedy implementation interactive | Statement | F | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 371 | Triangle Platinum? | implementation interactive | Statement | E | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 2750.0 | Tutorial | |
| 1565 | Interactive Game with Coloring | brute force constructive algorithms graphs implementation interactive math trees | Statement | E | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 2400 | |
| 2053 | ace5 and Task Order | binary search divide and conquer implementation interactive probabilities sortings | Statement | E | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 2500.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 3984 | Asesino (Easy Version) | binary search constructive algorithms implementation interactive | Statement | D1 | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 1750.0 | Codeforces Round 978 (Div 2) Editorial | |
| 7121 | Object Identification | graphs implementation interactive | Statement | A | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 750.0 | 139415 | |
| 3642 | Finding OR Sum | bitmasks constructive algorithms implementation interactive math | Statement | B | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 1000.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 604 | Baudelaire (hard version) | binary search dfs and similar divide and conquer implementation interactive trees | Statement | G2 | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 104 | Inter Active (Hard Version) | binary search bitmasks constructive algorithms graphs implementation interactive math probabilities | Statement | G2 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2750.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 8086 | MAD Interactive Problem | constructive algorithms implementation interactive | Statement | A | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 750.0 | Codeforces Round 1058 Editorial |