HDU_1005_Number Sequence
来源:互联网 发布:mac mini 老款拆机 编辑:程序博客网 时间:2024/05/18 03:09
Number Sequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 176530 Accepted Submission(s): 43689
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
本题解题思路:
通常此类型的题目有一些特点:
1、公式固定。
2、n非常大。
由此判断应该找规律求解。
然而这道题的一个比较困难的地方就在于A和B是不固定的,因此需要自己找出循环节求解。
至于循环节的求法,O__O "…,参考了下他人的做法,较简单的是:因为已知f(1)=1,f(2)=1,所以可以判断所求的f(n)和f(n-1)是否都为1,如果都为1,那么就找到了循环节。(循环节为n-2)
阅读全文
0 0
- HDU_1005_Number Sequence
- 杭电hdu_1005_Number Sequence
- 【矩阵快速幂】HDU_1005_Number Sequence
- sequence
- SEQUENCE
- Sequence
- sequence
- sequence
- Sequence
- sequence
- sequence
- sequence
- Sequence
- Sequence
- Sequence
- Sequence
- sequence
- sequence
- 云服务被归类为IDC业务 提供云服务必须持证"上岗"
- noi多维数组 13:图像模糊处理
- Spring Data JPA
- linux下升级openssl到新版本
- gson解析json数据分析
- HDU_1005_Number Sequence
- Java设计模式14——中介者(Mediator)模式
- 搜索引擎爬虫原理
- 【Git学习】git回滚到任意版本号
- 《Unity 3D游戏客户端基础框架》消息系统
- 数字图像处理实验(一)
- 关于vue的那些小事
- Futures (based on version 22.0)
- python用urllib爬取百度