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 |
|---|---|---|---|---|---|---|---|---|---|
| 115 | Rotary Laser Lock | binary search interactive | Statement | H | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 4000.0 | Codeforces Raif Round 1 Editorial | |
| 209 | The Riddle of the Sphinx | binary search data structures data structures interactive | Statement | I | Good Bye 2020 {1466} | PROGRAMMING | 4000.0 | Good Bye 2020 Editorial | |
| 315 | Vabank | binary search interactive | Statement | G | Технокубок 2021 - Финал {1482} | PROGRAMMING | 3500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 41 | Vabank | binary search interactive | Statement | E | Codeforces Round 709 (Div. 1, based on Technocup 2021 Final Round) {1483} | PROGRAMMING | 2500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 13012 | Guessing the Greatest (easy version) | binary search interactive | Statement | C1 | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 750.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 8971 | Guessing the Greatest (hard version) | binary search interactive | Statement | C2 | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 750.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 1040 | Magnets | binary search constructive algorithms interactive | Statement | F | Codeforces Global Round 13 {1491} | PROGRAMMING | 2000.0 | Codeforces Global Round 13 Editorial | |
| 3129 | Guess the K-th Zero (Hard version) | binary search data structures interactive | Statement | F2 | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 12712 | Guess the K-th Zero (Easy version) | binary search interactive | Statement | F1 | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 3530 | Interacdive Problem | binary search constructive algorithms interactive | Statement | F | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 2332 | notepad.exe | binary search constructive algorithms greedy interactive | Statement | E | Codeforces Global Round 20 {1672} | PROGRAMMING | 1500.0 | Global Round 20 Editorial | 2200 |
| 4643 | Guess The String | binary search brute force constructive algorithms ds interactive | Statement | D | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 10216 | Fixed Point Guessing | binary search constructive algorithms interactive | Statement | D | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 1500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 616 | Doremy's Perfect DS Class (Easy Version) | binary search interactive | Statement | G1 | Codeforces Global Round 24 {1764} | PROGRAMMING | 2000.0 | Codeforces Global Round 24 Editorial | |
| 554 | Doremy's Perfect DS Class (Medium Version) | binary search interactive | Statement | G2 | Codeforces Global Round 24 {1764} | PROGRAMMING | 500.0 | Codeforces Global Round 24 Editorial | |
| 490 | Doremy's Perfect DS Class (Hard Version) | binary search interactive | Statement | G3 | Codeforces Global Round 24 {1764} | PROGRAMMING | 500.0 | Codeforces Global Round 24 Editorial | |
| 389 | Hot and Cold | binary search interactive | Statement | H | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2600 | ||
| 5259 | Bit Guessing Game | binary search bitmasks interactive | Statement | D | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1500.0 | 111841 | |
| 14318 | Interview | binary search implementation interactive | Statement | E | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 345 | Stuck Conveyor | binary search interactive | Statement | F | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 3000.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 408 | Good Colorings | binary search constructive algorithms graphs interactive | Statement | E | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 2000.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 3339 | Asesino (Easy Version) | binary search constructive algorithms implementation interactive | Statement | D1 | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 1750.0 | ||
| 371 | Penchick and Even Medians | binary search constructive algorithms interactive | Statement | F | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 3000.0 | ||
| 1385 | Library of Magic | binary search bitmasks constructive algorithms interactive | Statement | G | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | |||
| 1332 | Broken Queries | binary search bitmasks interactive | Statement | E | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 2250.0 |