HDU 1005 Number Sequence
2016-01-12 17:15
543 查看
我就在想到底有没有循环节,最后我决定,本题目是有循环节的,因为只要出现两个相邻的数值相同,那么他就会重置f(n)的值进入循环,至于是不是1,是不能确定的。如果出现5和5相邻,是不是就从5开始循环了 ,这 也是确定的。这题目真是有点乱。原解释矩阵快速幂。不过还搞不懂,加油。
[align=left]Problem Description[/align]
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).
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each test case, print the value of f(n) on a single line.
[align=left]Sample Input[/align]
[align=left]Sample Output[/align]
代码:
[align=left]Problem Description[/align]
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).
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each test case, print the value of f(n) on a single line.
[align=left]Sample Input[/align]
1 1 3 1 2 10 0 0 0
[align=left]Sample Output[/align]
2 5
代码:
#include<stdio.h> #include<iostream> using namespace std; int a[10005]; int A, B, n; int main() { a[1] = a[2] = 1; while(scanf("%d%d%d", &A, &B, &n), A || B || n) { int i; for(i=3; i<10000; i++) { a[i] = (A*a[i-1] + B*a[i-2]) % 7; if(a[i] == 1 && a[i-1] == 1) break; } n = n % (i-2); a[0] = a[i-2]; cout<<a <<endl; } return 0; }
相关文章推荐
- DIY:利用Arduino制作智能家居系统
- EasyUI Sping MVC 树形网格 Treegrid 简单实例
- vs2012 build boost
- JUI编辑器的使用
- Arduino入门教程--连载
- UIView的动画
- UITableViewCell选中无色
- iOS开发中UISlider的简单使用
- United UI
- Fuel 管理节点
- iOS分享【OC】—— UITableView 的 cell 自适应
- (绝对有用)iOS获取UUID,并使用keychain存储
- 如何让Arduino用2颗5号电池运行1年以上--Arduino低功耗
- POJ 3061 Subsequence(二分查找 or 尺取法)
- Android酷炫实用的开源框架(UI框架)
- 【Arduino】开发入门教程
- afnetworking 和 asihttprequest 强制修改http连接的host地址
- 工程师应该怎样选择Arduino开发板
- 导航栏的UIBarButtonItem的位置调整,(需求来的太突然)
- poj--1679--The Unique MST(次小生成树)