A - Number Sequence

最新推荐文章于 2024-07-25 20:50:45 发布

雕栏玉砌应犹在，只是朱颜改

最新推荐文章于 2024-07-25 20:50:45 发布

阅读量341

点赞数

分类专栏： HDU 文章标签： ACM HDU

本文链接：https://blog.csdn.net/qq_40147944/article/details/81053315

版权

HDU 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

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

题意很简单，但这有个坑，如果直接递归写的话，复杂度太高，每48组一循环。但感觉这个题数据有问题，当n为49的时候...

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int a,b,n;
int f(int n){
if(n==1){
return 1;

    }else if(n==2){
        return 1;
    }else{
        return (a*f(n-1)+b*f(n-2))%7;
    }

}
int main() {
    while(cin>>a>>b>>n){
        if(a==0&&b==0&&n==0){
            break;
        }
        else{
            cout<<f(n%49)<<endl;
        }
    }
    return 0;
}