Jzzhu and Sequences CodeForces
来源:互联网 发布:ug编程安全几何体 编辑:程序博客网 时间:2024/05/21 09:19
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).
Input
2 33
Output
1
Input
0 -12
Output
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).
题意:给你f[1],f[2]的值,然后求任意一项的值,,,
思路:写几组数据就看出来,序列是以6个为循环,值分别为 f[1],f[2],f[3].-f[1],-f[2],-f[3].......取余求值即可》》》》》》》。
下面附上代码:
#include<bits/stdc++.h>using namespace std;typedef long long ll;const ll mod=1000000007;ll f[7];int main(){ll x,y,n;scanf("%lld %lld",&x,&y);f[1]=x,f[2]=y,f[3]=f[2]-f[1];scanf("%lld",&n);for(int i=4;i<=6;i++)f[i]=-f[i-3];f[0]=f[6];ll p=f[n%6];printf("%lld\n",(p%mod+mod)%mod);return 0;}
阅读全文
0 0
- Jzzhu and Sequences CodeForces
- Jzzhu and Sequences CodeForces
- Jzzhu and Sequences CodeForces
- Jzzhu and Sequences CodeForces
- codeforces B. Jzzhu and Sequences
- codeforces-DIV2-B- Jzzhu and Sequences
- Codeforces 450 B. Jzzhu and Sequences
- Codeforces Jzzhu and Sequences(循环节)
- Codeforces 450B Jzzhu and Sequences
- CodeForces 450-B. Jzzhu and Sequences
- Codeforces #257 div2 B. Jzzhu and Sequences
- CodeForces 450B Jzzhu and Sequences
- codeforces 450B Jzzhu and Sequences
- CodeForces-450B Jzzhu and Sequences
- codeforces 450B Jzzhu and Sequences
- CodeForces 450B Jzzhu and Sequences
- Codeforces 450B Jzzhu and Sequences
- CodeForces 450B-Jzzhu and Sequences
- 查看被锁的表和解锁
- java与C++的不同(笔记)
- 【HDU
- PHP支持ffmpeg,便用ffmpeg命令处理视频,开启exec权限
- CSS笔记(Bootstrap概览)
- Jzzhu and Sequences CodeForces
- Android 开发培训(04)--Android开发核心(三)
- 将 React Native 项目运行在 Web 浏览器上面
- S01E01 Python自动化测试环境搭建
- hdu 6168 Numbers【map】
- Mysql DB Browser的使用
- stm32不断的进入中断形成死循环
- 在Java中使用迭代器访问集合元素
- windows Nginx重启