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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 |