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 |
|---|---|---|---|---|---|---|---|---|---|
| 2145 | Ray Tracing | greedy hashing implementation math number theory sortings | Statement | C | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | 1800 | ||
| 14734 | Lunar New Year and Number Division | greedy implementation math sortings | Statement | C | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 1000 | |
| 3641 | Johnny and Grandmaster | greedy implementation math sortings | Statement | B | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 1250.0 | Codeforces Round #647 Editorial | 1900 |