2122.md (1108B)
1 Source: https://codeforces.com/blog/entry/144876 2 3 #### [2122A - Greedy Grid](/contest/2122/problem/A) 4 5 **Solution** 6 7 Tutorial is loading... 8 9 **Bonus** 10 11 Solve the problem for when the integers have to be in the range $[1, k]$ for some $k$. 12 13 #### [2122B - Pile Shuffling](/contest/2122/problem/B) 14 15 **Solution** 16 17 Tutorial is loading... 18 19 **Bonus** 20 21 Solve the problem for multisets faster than $\mathcal{O}(n^3)$. 22 23 #### [2122C - Manhattan Pairs](/contest/2122/problem/C) 24 25 **Solution** 26 27 Tutorial is loading... 28 29 #### [2122D - Traffic Lights](/contest/2122/problem/D) 30 31 **Solution** 32 33 Tutorial is loading... 34 35 **Bonus** 36 37 Prove and construct exact bound for the answer. 38 39 #### [2122E - Greedy Grid Counting](/contest/2122/problem/E) 40 41 **Solution** 42 43 Tutorial is loading... 44 45 **Bonus** 46 47 Solve the problem in $\mathcal{O}(nk)$. 48 49 #### [2122F - Colorful Polygon](/contest/2122/problem/F) 50 51 **Solution** 52 53 Tutorial is loading... 54 55 **Bonus** 56 57 Write a checker for this problem. 58 59 #### [2122G - Tree Parking](/contest/2122/problem/G) 60 61 **Solution** 62 63 Tutorial is loading... 64 65 **Bonus** 66 67 Solve the problem purely with generating functions.