jzzhu and sequences
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).
inputthe first line contains two integers x and y (|x|, |y| ≤ 109). the second line contains a single integer n (1 ≤ n ≤ 2·109).
outputoutput a single integer representing fn modulo 1000000007 (109 + 7).
sample test(s)input
2 3
3
output
1
input
0 -1
2
1000000006
notein the first sample, f2 = f1 + f3, 3 = 2 + f3, f3 = 1.
in the second sample, f2 = - 1; - 1 modulo (109 + 7) equals (109 + 6).
斐波那契數列+負數取餘+找規律
ac代碼: