CodeForces 450B-Jzzhu and Sequences

 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).

Examples

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).

#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>

using namespace std;

#define ll long long
#define mod 1000000007

struct matrix
{
    ll a[3][3];
    matrix()
    {
        memset(a,0,sizeof a);
    }
}t,k,p;

matrix mul(matrix x,matrix y)
{
    matrix sum;
    for(int i=1;i<=2;i++)
    {
        for(int j=1;j<=2;j++)
        {
            for(int k=1;k<=2;k++)
            {
                sum.a[i][j]+=x.a[i][k]*y.a[k][j];
                sum.a[i][j]%=mod;
            }
        }
    }
    return sum;
}

matrix qmul(long long int xx)
{
    matrix sum=k,q=p;
    while(xx)
    {
        if(xx&1) sum=mul(sum,q);
        xx>>=1;
        q=mul(q,q);
    }
    return sum;
}

int main()
{
    ll x,y,n;
    while(~scanf("%I64d %I64d %I64d",&x,&y,&n))
    {
        if(n==1) {printf("%I64d\n",(x+mod)%mod);continue;}
        else if(n==2) {printf("%I64d\n",(y+mod)%mod);continue;}
        p.a[1][1]=p.a[1][2]=1;
        p.a[2][1]=-1;p.a[2][2]=0;
        k.a[1][1]=k.a[2][2]=1;
        t=qmul(n-2);
        ll sum=(t.a[1][1]*y+mod+t.a[2][1]*x+mod)%mod;
        printf("%I64d\n",sum);
    }
    return 0;
}

另一种找到规律：

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>

using namespace std;

const int mod=1000000007;

int main()
{
    int n,m,k;
    int a[20];
    while(~scanf("%d %d %d",&n,&m,&k))
    {
        a[1]=(n+mod)%mod;
        a[2]=(m+mod)%mod;
        for(int i=3;i<=6;i++)
        {
            a[i]=(a[i-1]-a[i-2]+mod)%mod;
        }
        a[0]=a[6];
        printf("%d\n",a[k%6]);
    }
    return 0;
}