Description
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 Input
2 3 3
1
0 -1 2
1000000006
Hint
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<stdio.h>
#include<string.h>
#define N 1001
int main()
{
int n,m,i,j,k;
int a[20];
while(~scanf("%d%d",&n,&m))
{
a[1]=n;
a[2]=m;
scanf("%d",&k);
for(i=3;i<=6;i++)
{
a[i]=a[i-1]-a[i-2];
}
a[0]=a[6];
printf("%d\n",((a[k%6]%1000000007)+1000000007)%1000000007);
}
return 0;
}
版权声明：本文为博主原创文章，未经博主允许不得转载。
原文地址：http://blog.csdn.net/sh_tomorrow/article/details/47682847
