Number Sequence
2015-07-19 13:11
381 查看
Number Sequence
Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^
题目描述
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).
输入
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.
输出
For each test case, print the value of f(n) on a single line.
示例输入
1 1 3 1 2 10 0 0 0
示例输出
2 5
提示
知识扩展:本类算法在数字医疗、移动证券、手机彩票、益智类解谜类游戏软件中会经常采用。
来源
示例程序
矩阵快速幂!唉,事后听了大神的一般数很大又取莫之类的,都是有些思维题;#include <iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<queue> #include<stack> #include<cmath> using namespace std; void solve(int a,int b,int n) { int ans_1=1,ans_2=1,c=1,d=0; int tmp,w,x,y,z; n-=2; while(n) { if(n&1) { tmp=ans_1; ans_1=(ans_1*a%7+ans_2*b%7)%7; ans_2=tmp*c+ans_2*d; } w=a;x=b;y=c;z=d; a=(w*w+y*x)%7; c=(w*y+y*z)%7; b=(w*x+x*z)%7; d=(x*y+z*z)%7; n>>=1; } printf("%d\n",ans_1); } int main() { int a,b,n; while(~scanf("%d%d%d",&a,&b,&n)&&(a||b||n)) { if(n<=2) { printf("1\n"); continue; } solve(a,b,n); } return 0; }
相关文章推荐
- 数学 Codeforces Round #219 (Div. 2) B. Making Sequences is Fun
- 20150719 Navy blue is my color. You will describe the way people look
- 无限循环滚动大图(UICollectionView)
- runAllManagedModulesForAllRequests="true" 的思考
- IOS 中设置UITextView 显示文本的光标
- HDU 3836 Equivalent Sets(强连通分量 Tarjan缩点)
- 使用fastcgi_finish_request提高页面响应速度
- 图片水印(UIImage类目)
- [LeetCode]Implement Stack using Queues
- ZOJ 1926 Guessing Game
- HDU 2604 Queuing
- 转:抗锯齿方法两种(其一:paint.setAntiAlias(ture);paint.setBitmapFilter(true))
- Linking different libraries for Debug and Release builds in Cmake on windows?
- OpenCV Access pixel value
- 使用Fuel安装OpenStack juno之一安装Fuel Master
- 数据的刷新(UITableViewCell实现点击单元格弹窗更改数据)
- UITableView性能优化(复用池的使用原理)
- iOS切换到UiScrollView界面卡死
- 图片轮播器(UIScrollView-UIPageControl)
- 解决“Dynamic Web Module 3.0 requires Java 1.6 or newer.”错误