Number Sequence
来源:互联网 发布:unctad数据库怎么用 编辑:程序博客网 时间:2024/06/06 00:06
题目描述
A number sequence is defined as follows:
f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.
Given A, B, and n, you are to calculate the value of f(n).
f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.
Given A, B, and n, you are to calculate the value of f(n).
输入
The input consists of multiple test cases. Each test case contains 3 integers A, B and n on a single line (1 <= A, B <= 1000, 1 <= n <= 100,000,000). Three zeros signal the end of input and this test case is not to be processed.
输出
For each test case, print the value of f(n) on a single line.
示例输入
1 1 31 2 100 0 0
示例输出
25
- #include <iostream>
- #include <algorithm>
- using namespace std;
- long long int f[100000001];
- int main()
- {
- int n,m,k,a,b,i;
- f[1]=1;f[2]=1;
- while(cin>>a>>b>>n&&a!=0||b!=0||n!=0)
- {
- for(i=3;i<=n;i++)
- {
- f[i]=((f[i-1]*a%7)+(f[i-2]*b%7));
- }
- cout<<f[n]<<endl;
- }
- }
0 0
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- 人见人爱A^B
- 【CODEFORCES】 C. Number of Ways
- Balloon Comes!
- Fibonacci Again
- ubuntu下ibus无法启动
- Number Sequence
- Tcp与Udp
- java直接用jdbc操作oracle数据库
- memcached
- 不容易系列之一
- DSAPI多功能组件编程应用-文件类
- 过年回家晕车怎么办?给正在车上的小伙伴!
- 【网络流】 SGU 194 Reactor Cooling
- Uva 455-periodic strings