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 |
|---|---|---|---|---|---|---|---|---|---|
| 6331 | Nearest Beautiful Number (easy version) | binary search bitmasks brute force constructive algorithms dfs and similar greedy | Statement | F1 | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 1900 | |
| 4375 | Exact Change | binary search brute force constructive algorithms greedy | Statement | D | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 4037 | Martial Arts Tournament | binary search brute force greedy | Statement | D | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 345 | N Machines | binary search brute force greedy | Statement | E | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 2500.0 | Tutorial | 3300 |
| 6259 | Maximum And Queries (easy version) | binary search bitmasks brute force greedy | Statement | D1 | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 471 | MEX Game 2 (Easy Version) | binary search brute force greedy | Statement | E1 | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 2000.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 15781 | Chamo and Mocha's Array | binary search brute force greedy | Statement | C | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 1000.0 | editorial_zh.pdf | 1200 |
| 6539 | Perform Operations to Maximize Score | binary search brute force greedy | Statement | C | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1250.0 | ||
| 14257 | Black Cells | binary search brute force greedy | Statement | B | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | |||
| 14934 | Outstanding Impressionist | binary search brute force greedy | Statement | B | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 1000.0 | ||
| 17715 | XOR and Triangle | binary search bitmasks brute force greedy | Statement | C | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | |||
| 6754 | Min Max MEX | binary search brute force greedy | Statement | E | Codeforces Round 1016 (Div. 3) {2093} | PROGRAMMING |