标签：c++
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).
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 a single integer representing fn modulo 1000000007 (109?+?7).
2 3 3
1
0 -1 2
1000000006
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<iostream>
using namespace std;
#define modulo 1000000007
int main()
{
__int64 q[6];
int m,n;
int k;
while(~scanf("%d%d",&m,&n))
{
q[1]=m;
q[2]=n;
q[3]=n-m;
q[4]=-m;
q[5]=-n;
q[0]=m-n;
cin>>k;
k=k%6;
while(q[k]<0)
q[k]=q[k]+modulo;
printf("%I64d\n",q[k]%modulo);
}
return 0;
}
Codeforces Round #257 (Div. 2) B Jzzhu and Sequences
标签：c++
原文地址：http://blog.csdn.net/axuan_k/article/details/37989521
