Number Sequence 找规律

最新推荐文章于 2020-08-10 13:56:42 发布

ZJU_warren

最新推荐文章于 2020-08-10 13:56:42 发布

阅读量364

点赞数

分类专栏： HDUOJ

本文链接：https://blog.csdn.net/hnust_V/article/details/51746699

版权

HDUOJ 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

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


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

来源： http://acm.hdu.edu.cn/showproblem.php?pid=1005

//找规律做法
#include <stdio.h>           // f(n) +7x=A*f(n-1) +B*f(n-2) // 2A7==49 f(n-1),f(n-2)排列   一共49情况
long long  Value[49]={0,1,1};

int A,B;

int Cal(long long n)

{

    for(int i=3;i<=48;i++)

        Value[i] = (A*Value[i-1]+B*Value[i-2])%7;

    return 1;

}

int main()

{



    long long n;

    while(~scanf("%d %d %lld",&A,&B,&n)&&(A||B||n)&&Cal(n))

        printf("%lld\n",Value[n%48==0?48:n%48]);

    return 0;

}