1005 Number Sequence
2015-08-28 20:10
363 查看
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
Sample Output
Author
CHEN, Shunbao
Source
ZJCPC2004
找规律题,因为对7取余数,因此49必定是一个循环。也可以像如下代码一样,求出具体的循环的最短周期。
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 3 1 2 10 0 0 0
Sample Output
2 5
Author
CHEN, Shunbao
Source
ZJCPC2004
找规律题,因为对7取余数,因此49必定是一个循环。也可以像如下代码一样,求出具体的循环的最短周期。
#include<iostream> using namespace std; int main() { int a[100],A,B,I,n; a[1]=1; a[2]=1; while(cin>>A>>B>>n) { if(A==0&&B==0&&n==0) break; int cnt=0; for(i=3;i<=99;i++) { a[i]=(A*a[i-1]+B*a[i-2])%7; if(a[i]==1&&a[i-1]==1) break; if(a[i]==0&&a[i-1]==0) {cnt=1;break;} } if(cnt&&n>i-2){cout<<"0"<<endl;continue;} i-=2; n%=i; if(n==0)n=i; cout<<a <<endl; } }
相关文章推荐
- UI动图的制作
- 简述UIView、UIWindow和CALayer的理解
- 【UI初级 连载一】------iPhone开发入门
- 详解CALayer 和 UIView的区别和联系
- 创建一个可重用的UITableViewCell代码
- iOS:选择器控件UIPickerView的详解和演示
- value="hello boy"
- 【codechef】Chef and the Number Sequence(构成最长公共子序列为L的可能性)
- Android UI设计:自定义Dialog
- UI初级连载九----------UITableView的使用
- iOS 笔记五:手势识别 UIGestureRecognizer
- flume+kafka+Druid 流数据查询聚合工具
- UI初级连载八------------标签控制器
- ueditor配置
- easyui-treegrid篇
- UITableView
- UIControl
- POJ 题目3581 Sequence(后缀数组+离散化)
- NGUI
- UIDatePicker