Codeforces Round #257 (Div. 2)B. Jzzhu and Sequences

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:

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 存一下取模就行

#include <iostream>

using namespace std;
const int mod=1000000007;
int main()
{

   int a[10];
   long long x,y,z,n;
   cin>>x>>y>>n;
   z=y-x;
   a[1]=x;
   a[2]=y;
   a[3]=z;
   a[4]=a[3]-a[2];
   a[5]=a[4]-a[3];
   a[0]=a[5]-a[4];
   x%=mod;
   while(x<0)
    x+=mod;
   y%=mod;
   while(y<0)
    y+=mod;
   z%=mod;
   while(z<0)
    z+=mod;
    cout<<(a[n%6]%mod+mod)%mod<<endl;

    return 0;
}