Number Sequence

chen_zan_yu_

于 2019-09-17 12:53:16 发布

阅读量110

点赞数

分类专栏： VJ 夜深人静写算法（一） - 初等数论

本文链接：https://blog.csdn.net/chen_zan_yu_/article/details/100922679

版权

VJ 同时被 2 个专栏收录

105 篇文章 0 订阅

订阅专栏

夜深人静写算法（一） - 初等数论

5 篇文章 0 订阅

订阅专栏

Number Sequence

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

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

Author

CHEN, Shunbao

Source

ZJCPC2004

Recommend

JGShining | We have carefully selected several similar problems for you: 1008 1004 1021 1019 1002

#include <iostream>
#include<stdio.h>
using namespace std;
typedef long long ll;
const int maxn=1001;
int a,b,n;
int F[maxn];
int main()
{
    F[1]=F[2]=1;
    while(scanf("%d%d%d",&a,&b,&n)!=EOF)
    {
        if(!a&&!b&&!n)
            break;
            int k;
        for( k=3; k<1000; k++)
        {
            F[k]=(a*F[k-1]+b*F[k-2])%7;
            if(F[k]==1&&F[k-1]==1)break;//重新回到原点时即为一个周期

        }
        n=n%(k-2);//k-2为周期
        printf("k= %d\n",k);
        F[0]=F[k-2];
        printf("%d\n",F[n]);
    }
    return 0;
}