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']
< 1 2 3 4Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 156 | Book Sorting | Statement | K | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | ||||
| 1123 | Boarding Queue | Statement | L | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | ||||
| 48 | Can You Reach There? | Statement | M | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | ||||
| 8872 | Binary Matrix | Statement | A | Codeforces Round 1010 (Div. 2, Unrated) {2082} | PROGRAMMING | 500.0 | |||
| 5525 | Floor or Ceil | Statement | B | Codeforces Round 1010 (Div. 2, Unrated) {2082} | PROGRAMMING | 1000.0 | |||
| 57 | Black Cat Collapse | Statement | E | Codeforces Round 1012 (Div. 1) {2089} | PROGRAMMING | 3000.0 |