Number Sequence

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

li__dawn

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

阅读量125

点赞数

文章标签：数学

本文链接：https://blog.csdn.net/LI__TH/article/details/99672017

版权

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
1 1 3
1 2 10
0 0 0

Sample Output
2
5

n过大要是直接求肯定超时，结果要对7取余，答案比为周期性的，打完表发现1-48是没有重复的，49以后和1-48一样所以48为周期，猜测应该从某个7的倍数开始循环

#include<cstdio>
#include<iostream>
using namespace std;
int f[1000000];
int main()
{
    int a,b,n;
    for(;;)
    {
        cin>>a>>b>>n;
        if(!a&&!b&&!n) break;
        f[1]=1;
        f[2]=1;
        for(int i=3;i<=49;i++)
        {
            f[i]=(a*f[i-1]+b*f[i-2])%7;
        }
        if(n>=49)printf("%d\n",f[n%48]);
        else printf("%d\n",f[n]);
    }
    return 0;
}