Number Sequence
来源:互联网 发布:神马快递单打印软件 编辑:程序博客网 时间:2024/06/02 05:28
Number Sequence
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 97 Accepted Submission(s) : 21
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
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).
Input
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.
Output
For each test case, print the value of f(n) on a single line.
Sample Input
1 1 31 2 100 0 0
Sample Output
25
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
- 微信支付错误两个问题的解决:curl出错,错误码:60
- java替换pdf模板出现中文乱码问题
- HDU 5606 tree
- django学习心得
- C++引用计数(reference counting)技术简介(3)
- Number Sequence
- Json 中对Key为空的判断
- HDU 5605 geometry
- PAT 1002. A+B for Polynomials (25)
- leetcode Verify Preorder Serialization of a Binary Tree
- 《VR入门系列教程》之13---相机与立体渲染
- Java编程中“为了性能”需做的26件事
- 搜狗扩展插件Hello World
- C++学习之多态篇(纯虚函数和接口类)