2018_multi

B.Harvest of Apples

Solved by ghk.3:50(+)

• 将行分成300一块，f[i][block_i] = f[i-1][block_i] + C(i-1,block_i_min-1) - C(i-1,block_i_max)

D.Nothing is Impossible

Solved by ghk.1:07(+)

E.Matrix from Arrays

Solved by ghk.4:29(+)

• n奇，循环节n/2，n偶数循环节n。(可能是的，忘了)
• 然后按四部分统计。

K.Expression in Memories

Solved by ghk.1:28(+2)

• 按+、*分开，每段区间的?能填1就填1。

L.Graph Theory Homework

Solved by ghk.0:22(+)