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 |
---|---|---|---|---|---|---|---|---|---|
162 | Koxia and Bracket | divide and conquer fft math | Statement | G | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 3250.0 | Good Bye 2022 -- Editorial | |
332 | Deck-Building Game | divide and conquer math | Statement | K | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
126 | Yet Yet Another Permutation Problem | divide and conquer fft math | Statement | E | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 2500.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
728 | Iris and Adjacent Products | divide and conquer math | Statement | D | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 2000.0 |