数学: HDU1005 Number Sequence
来源:互联网 发布:轰炸手机号码软件下载 编辑:程序博客网 时间:2024/06/09 08:13
Number Sequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 176080 Accepted Submission(s): 43527
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).
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
Author
CHEN, Shunbao
阅读全文
0 0
- hdu1005 Number sequence(数学)
- HDU1005 Number Sequence 数学
- 数学: HDU1005 Number Sequence
- (hdu1005)Number Sequence(组合数学)
- Number Sequence hdu1005
- (hdu1005)Number Sequence
- hdu1005 Number Sequence
- hdu1005 number sequence
- hdu1005 Number Sequence
- hdu1005 ( Number Sequence )
- Number Sequence(HDU1005)
- hdu1005 Number Sequence(数论)
- hdu1005 Number Sequence
- HDU1005 Number Sequence
- Hdu1005 Number Sequence
- hdu1005 Number Sequence
- HDU1005 Number Sequence
- hdu1005 Number Sequence
- Unity3D学习记录——NGUI Sprit3
- 3478数值分解
- VINS-Mono源码解析(三)后端: IMU预积分
- 小白一个 。。。搭建一个小小的静态网站
- MySQL 索引
- 数学: HDU1005 Number Sequence
- VINS-Mono源码解析(四)后端: Initialization
- 优先队列几个应用详解
- 0035_Search Insert Position
- 【HDU 6038 Problem Description】+ 思维
- 华为机试——合并表记录
- MySQL 临时表
- Dijkstra's Algorithm分析以及其优化
- 关于Tomcat中乱码的产生原因详解