1005
来源:互联网 发布:天融信网络教育 编辑:程序博客网 时间:2024/06/05 08:17
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
#include <iostream>using namespace std;int modValue(int aA,int bB,int nN);int main(){ int A,B,n; while(cin>>A>>B>>n&&A!=0&&B!=0&&n!=0 &&A>=1&&A<=1000&&B>=1&&B<=1000 &&n>=1&&n<=100000000) { int value,t; t=n%49; value=modValue(A,B,t); cout<<value<<endl; } return 0;}int modValue(int aA,int bB,int nN){ int x; if(nN==1||nN==2) x=1; else x=(aA*modValue(aA,bB,nN-1)+bB*modValue(aA,bB,nN-2))%7; return x;}
虽然看了很多大神解释的循环周期为49,但还是有点一直半解,自己也有自己的理解方式,只是看起来自己理解的比较简单而已
0 0
- 1005
- 1005
- 1005
- 1005
- 1005
- 1005
- 1005
- 1005
- 1005
- 1005
- 1005
- 1005
- 1005
- 1005
- 1005
- 1005
- 1005
- 1005
- 友盟Could not find class 'com.umeng.analytics.d'
- Dev打包问题
- Window 分析
- 巨额奖金在向你招手!这款iOS应用悬赏10万美金找漏洞
- 小波变换
- 1005
- 读取彩信的附件内容
- C语言之运算符总览与运算符优先级
- CSDN如何转载别人的文章
- Java学习笔记--控制流程语句
- FL2440驱动入门——helloworld
- C语言实验——时间间隔
- ccf 最优灌溉
- webpack入门(2)