HDOJ 1005 航电

最新推荐文章于 2020-07-13 09:39:47 发布

是子非啦啦啦

最新推荐文章于 2020-07-13 09:39:47 发布

阅读量78

点赞数

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

本文链接：https://blog.csdn.net/weixin_43917396/article/details/103297933

版权

ACM 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Number Sequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 230887 Accepted Submission(s): 58538

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

这是一个找规律题！

#include<iostream>
int f[100000005];
using namespace std;
int main(){
    int  a,b,n,j;
    f[1]=f[2]=1;
    while(cin>>a>>b>>n&&a&&b&&n)
    {
        int cir=0;//周期
         for(int i=3;i<=n;i++) 
         {
             f[i]=(a*f[i-1]+b*f[i-2])%7;
             for(j=2;j<i;j++)
             {
                 if(f[j-1]==f[i-1]&&f[j]==f[i])//操作中的数和前一个数确定下一个数是否相等
                 {
                     cir=i-j;
                     break;
                 }
             }
             if(cir)break;
         }
         if(cir)
         cout<<f[(n-j)%cir+j]<<endl;
         else
         cout<<f[n]<<endl;
    }
    return 0;
}