HDU 1005 循环节查找

最新推荐文章于 2020-07-12 20:18:12 发布

H1deonbush

最新推荐文章于 2020-07-12 20:18:12 发布

阅读量679

点赞数

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

本文链接：https://blog.csdn.net/h1deonbush/article/details/45110921

版权

HDU 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

Number Sequence

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 121076 Accepted Submission(s): 29399

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

2
5

这是一道查找循环节的题已知 f ( 1 ) =1 && f ( 2 ) =1 所以继续往下查找当 f ( i ) == 1 && f ( i -1 ) == 1 return i-2;
详见代码：

#include <iostream>
#include <stdio.h>
using namespace std;
int  data[10000];
int getloop(int a,int b)
{
    data[1]=1,data[2]=1;
    for(int i=3;i<=10000;i++)
    {
        data[i]=(a * data[i-1] + b * data[i-2]) % 7;
        if(data[i]==1&&data[i-1]==1)
        return i-2;
    }
}
int main()
{
    int a,b,n;
    while(cin>>a>>b>>n)
    {
        if(a==0&&b==0&&n==0)
        break;
        int loop=getloop(a,b);
        data[0]=data[loop];//注意循环节最后一个数的处理
        n%=loop;              
        cout<<data[n]<<endl;
    }
    return 0;
}