
矩阵快速幂
ACM__dongsheng
在校大学生
展开
-
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, 34, …An alt原创 2016-07-01 11:56:02 · 1871 阅读 · 0 评论 -
Gauss Fibonacci
Description Without expecting, Angel replied quickly.She says: “I’v heard that you’r a very clever boy. So if you wanna me be your GF, you should solve the problem called GF~. ” How good an opportun原创 2016-07-02 13:51:54 · 722 阅读 · 0 评论 -
XTU 1243 2016
2016Given a 2×2 matrix A=(a11a21a12a22), find An where A1=A,An=A×An−1. As the result may be large, you are going to find only the remainder after division by 7.Special Note: The problem is intended t原创 2016-06-17 11:32:33 · 815 阅读 · 0 评论