B. Jzzhu and Sequences
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Jzzhu has invented a kind of sequences, they meet the following property:
![](https://i-blog.csdnimg.cn/blog_migrate/b7fe78e2092ecddb07022544f792780f.png)
You are given x and y, please calculate fn modulo 1000000007 (109 + 7).
Input
The first line contains two integers x and y (|x|, |y| ≤ 109). The second line contains a single integer n (1 ≤ n ≤ 2·109).
Output
Output a single integer representing fn modulo 1000000007 (109 + 7).
Sample test(s)
Input
2 3 3
Output
1
Input
0 -1 2
Output
1000000006
Note
In the first sample, f2 = f1 + f3, 3 = 2 + f3, f3 = 1.
In the second sample, f2 = - 1; - 1 modulo (109 + 7) equals (109 + 6).
思路:有规律哒周期为6,就是最后取模的时候要注意。
AC代码:
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <stdlib.h>
using namespace std;
int main(){
int x,y;
scanf("%d",&x);
scanf("%d",&y);
int n;
scanf("%d",&n);
int f[6]={-y+x,x,y,y-x,-x,-y};
int temp=(f[n%6]%1000000007+1000000007)%1000000007;
printf("%d",temp);
return 0;
}