思路:
f1=x, f2=y,f3=y-x,f4=-x,f5=-y,f6=x-y
循环规律
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <queue>
using namespace std;
const int mod=1e9+7;
int main()
{
int n,m;
cin>>n>>m;
int x;
cin>>x;
int ans;
if(x%6==0)
ans=n-m;
if(x%6==1)
ans=n;
if(x%6==2)
ans=m;
if(x%6==3)
ans=m-n;
if(x%6==4)
ans=-n;
if(x%6==5)
ans=-m;
while(ans<0)
ans+=mod;
ans=ans%mod;
cout<<ans<<endl;
}