HDU 5411
题意:
Count the number of different patterns by counting the number of different paths of length at most m-1.
思路:
其实这类问题就是求:
S=I+A+A2+...+Am
一般普适的计算方式是:
(AmS)=(AI0I)m∗(I0)
这样做的好处是可以得到最后的矩阵S,然后求S的所有元素和即是答案-1(没统计 ∅
Count the number of different patterns by counting the number of different paths of length at most m-1.
其实这类问题就是求:
S=I+A+A2+...+Am
一般普适的计算方式是: