C：log 推柿子
D：正难则反，dp 补集
比赛链接

Problems	AC
A. Diagonals	○
B1. Bouquet (Easy Version)	○
B2. Bouquet (Hard Version)	○
C. Squaring	⊕
D. Cases	⊕
E1. Let Me Teach You a Lesson (Easy Version)
E2. Let Me Teach You a Lesson (Hard Version)

比赛链接

Problems	AC
A. Submission Bait	○
B. Array Craft	○
C. Mad MAD Sum	○
D. Grid Puzzle	⊕
E1. Catch the Mole(Easy Version)
E2. Catch the Mole(Hard Version)
F. Polygonal Segments

最自闭的一集。

tbh 赛前一整天心理状态都不太好，压力也很大。稍微甩个锅吧。

出题人：I failed to find a Div2-A level proof. If you have a simpler proof please share it in the comments.

比赛链接

Problems	AC
A. Split the Multiset	○
B. Make Majority	○
C. Increasing Sequence with Fixed OR	○
D. The Omnipotent Monster Killer	⊕
E. Range Minimum Sum	⊕
F. Heartbeat

印度 Round = 拉马努金 Round

要做出题需要一点灵感，但是在某些方面还挺有启发性的。

比赛链接

Problems	AC
A. Array Divisibility	○
B. Corner Twist	○
C. Have Your Cake and Eat It Too	○
D. Swap Dilemma	○
E. I Love Balls	⊕
F. array-value	⊕
G. Your Loss

比赛链接

Problems	AC
A. Upload More RAM	○
B. K-Sort	○
C. Basil’s Garden	○
D. World is Mine	○
E. Wonderful Tree!	○
F1. Interesting Problem (Easy Version)	⊕
F2. Interesting Problem (Hard Version)	⊕
G1. Spinning Round (Easy Version)
G2. Spinning Round (Hard Version)
H. Fumo Temple

重生之我是 Jumping

比赛链接

Problems	AC
A. Soccer	○
B. Collatz Conjecture	○
C. Boring Day	○
D. Beauty of the mountains	○
E. Number of k-good subarrays	⊕
F. Sorting Problem Again	⊕

发现自己的小号已经 unrated for div3 了

这什么神笔场，F 不会求割边和点双被卡科技了，G1 G2 赛时想出正解但是以为自己的复杂度是错的就没写。。。

比赛链接

Problems	AC
A. X Axis	○
B. Matrix Stabilization	○
C. Update Queries	○
D. Mathematical Problem	○
E. Beautiful Array	○
F. Non-academic Problem	⊕
G1. Permutation Problem (Simple Version)	⊕
G2. Permutation Problem (Hard Version)	⊕

比赛链接

Problems	AC
A. Alice and Books	○
B. New Bakery	○
C. Manhattan Permutations	○
D. Elections	○
E. Computing Machine	⊕
F. Large Graph	⊕

赛后一个题一个题做的

比赛链接

Problems	AC
A. Creating Words	○
B. Maximum Multiple Sum	○
C. Good Prefixes	○
D. Manhattan Circle	○
E. Secret Box	○
F. Final Boss	○
G. D-Function	○
H1. Maximize the Largest Component (Easy Version)	○
H2. Maximize the Largest Component (Hard Version)	○

比赛链接

Problems	AC
A. Strange Splitting	○
B. Large Addition	○
C1. Magnitude (Easy Version)	○
C2. Magnitude (Hard Version)	○
D. ‘’a’’ String Problem	○
E. Shuffle
F. Reconstruction