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 |
|---|---|---|---|---|---|---|---|---|---|
| 3079 | Ring Road 2 | 2-sat dfs and similar dsu graphs | Statement | D | Codeforces Beta Round 27 (Codeforces format, Div. 2) {27} | PROGRAMMING | Solution of ABC @ Round#27 | 2300 | |
| 2809 | The Road to Berland is Paved With Good Intentions | 2-sat dfs and similar dsu graphs | Statement | E | Codeforces Round 141 (Div. 2) {228} | PROGRAMMING | Codeforces Round #141 (Div. 2) Tutorial | 2000 | |
| 5229 | Two Sets | 2-sat dfs and similar dsu graph matchings greedy | Statement | B | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 2000 | |
| 733 | Summer Dichotomy | 2-sat data structures dfs and similar greedy | Statement | H | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 3100 | |
| 943 | New Language | 2-sat greedy | Statement | C | Codeforces Round 315 (Div. 1) {568} | PROGRAMMING | Codeforces Round #315 Editorial | 2600 | |
| 868 | Duff in Mafia | 2-sat binary search | Statement | D | Codeforces Round 326 (Div. 1) {587} | PROGRAMMING | Codeforces Round #326 (Editorial) | 2900 | |
| 241 | Little Artem and 2-SAT | Statement | F | VK Cup 2016 - Round 2 {641} | PROGRAMMING | VK Cup 2016 — Раунд 2 (editorial) | 2900 | ||
| 6163 | The Door Problem | 2-sat dfs and similar dsu graphs | Statement | D | ICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined) {776} | PROGRAMMING | ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Editorial | 2000 | |
| 3040 | Innokenty and a Football League | 2-sat graphs greedy implementation shortest paths strings | Statement | D | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 2000 | |
| 2358 | National Property | 2-sat dfs and similar graphs implementation | Statement | C | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | Codeforces Round #441. Editorial. | 2100 | |
| 321 | Ants | 2-sat data structures trees | Statement | D | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 3200 | |
| 127 | Harder Satisfiability | 2-sat dfs and similar graphs | Statement | H | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | 3500 | ||
| 1181 | Radio Stations | 2-sat | Statement | F | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 2800 | |
| 734 | The Light Square | 2-sat dfs and similar greedy | Statement | I | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2200 | |
| 2589 | Catowice City | 2-sat dfs and similar graph matchings graphs | Statement | D | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 2400 | |
| 1809 | Columns Swaps | 2-sat dfs and similar dsu graphs implementation | Statement | G | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 2300 | |
| 18475 | Binary String Reconstruction | 2-sat constructive algorithms greedy strings | Statement | C | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 11572 | Engineer Artem | 2-sat constructive algorithms | Statement | C | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 1250.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 1848 | Team-Building | 2-sat dfs and similar dsu graphs | Statement | C | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 1500.0 | Codeforces Round #680 Editorial | |
| 5869 | Unusual Matrix | 2-sat constructive algorithms greedy | Statement | F | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 1255 | Flip the Cards | 2-sat constructive algorithms data structures dsu greedy sortings | Statement | D | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1750.0 | T | 2600 |
| 10611 | Kavi on Pairing Duty | 2-sat dp | Statement | B | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 1000.0 | Codeforces Round #722 Editorial | |
| 877 | One-Four Overload | 2-sat constructive algorithms dfs and similar geometry graphs implementation | Statement | F | Codeforces Round 742 (Div. 2) {1567} | PROGRAMMING | 2750.0 | Codeforces Round #742 Editorial | |
| 2129 | X(or)-mas Tree | 2-sat bitmasks dfs and similar graphs trees | Statement | D | Codeforces Global Round 18 {1615} | PROGRAMMING | 2250.0 | Global Round 18 Editorial | |
| 744 | Words on Tree | 2-sat implementation trees | Statement | F | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 704 | Too Many Constraints | 2-sat | Statement | F | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 21675 | Almost Ternary Matrix | 2-sat bitmasks constructive algorithms matrices | Statement | B | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 1000.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 6059 | 2+ doors | 2-sat bitmasks graphs greedy schedules | Statement | D | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 2250.0 | Codeforces Round #816 (Div. 2) editorial | |
| 1007 | Tick, Tock | 2-sat combinatorics dfs and similar dsu graphs | Statement | E | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 2250.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 850 | Tenzing and Random Real Numbers | 2-sat bitmasks dp probabilities | Statement | H | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 3750.0 | CodeTON Round 5 Editorial | |
| 2712 | Autosynthesis | 2-sat constructive algorithms dfs and similar dp flows graphs trees | Statement | C | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 1250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 895 | Babysitting | 2-sat binary search data structures graphs | Statement | F | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 3500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 2709 | ±1 | 2-sat dfs and similar graphs | Statement | H | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 2100 | |
| 396 | Let Me Teach You a Lesson (Hard Version) | 2-sat bitmasks data structures dp graphs matrices two pointers | Statement | E2 | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 508 | Let Me Teach You a Lesson (Easy Version) | 2-sat data structures dp two pointers | Statement | E1 | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 2500.0 | Video Tutorial | |
| 754 | Billetes MX (Easy Version) | 2-sat binary search combinatorics dfs and similar dsu graphs | Statement | E1 | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 2250.0 | Codeforces Round 978 (Div 2) Editorial | |
| 455 | Superb Graphs | 2-sat graphs | Statement | F | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 3000.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 9658 | Rabbits | 2-sat dp graphs greedy implementation | Statement | C | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 1500.0 |