矩阵
文章平均质量分 86
丘大路
这个作者很懒,什么都没留下…
展开
-
矩阵乘法 Matrix Power Series
DescriptionGiven a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 + … + Ak.InputThe input contains exactly one test case. The first line of input contain原创 2016-08-17 15:51:33 · 189 阅读 · 0 评论 -
Fibonacci
DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5, 8, 13, 21,原创 2016-08-17 15:55:49 · 206 阅读 · 0 评论 -
UVA 108 Maximum Sum 最大连续子矩阵和
DescriptionBackgroundA problem that is simple to solve in one dimension is often much more difficult to solve in more than one dimension. Consider satisfying a boolean expression in conjun原创 2016-08-17 17:29:38 · 208 阅读 · 0 评论 -
POJ - 1222 EXTENDED LIGHTS OUT高斯消元
DescriptionIn an extended version of the game Lights Out, is a puzzle with 5 rows of 6 buttons each (the actual puzzle has 5 rows of 5 buttons each). Each button has a light. When a button is pres原创 2016-08-19 10:52:07 · 213 阅读 · 0 评论