AK_HuangYC的博客

有一个序列是这样定义的：f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7. 给出A，B和N，求f(n)的值。 Input 输入3个数：A,B,N。数字之间用空格分割。(-10000  Output 输出f(n)的值。 Input示例 3 -1 5 Output示例 6

斐波那契数列的定义如下： F(0) = 0 F(1) = 1 F(n) = F(n - 1) + F(n - 2) (n >= 2) (1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, ...) 给出n，求F(n)，由于结果很大，输出F(n) % 1000000009的结果即可。 Input

Jzzhu has invented a kind of sequences, they meet the following property: You are given x and y, please calculate fn modulo 1000000007 (109 + 7). Input The first line contains two inte