HDU - 6185 :Covering(矩陣乘法&狀態壓縮)
To protect boys and girls from getting hurt when playing happily on the playground, rich boy Bob decided to cover the playground using his carpets.
Meanwhile, Bob is a mean boy, so he acquired that his carpets can not overlap one cell twice or more.
He has infinite carpets with sizes of
Can you tell Bob the total number of schemes where the carpets can cover the playground completely without overlapping?
InputThere are no more than 5000 test cases.
Each test case only contains one positive integer n in a line.