hdu-1005

Number Sequence

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

 

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 1021 1019 1009 1012 

 

 

Statistic | Submit | Discuss | Note

 

心得：找规律，前49个是循环（其实一开始找的是前7个，但后来不对，参考网上的博文说是有规律的）。

#include<bits/stdc++.h>
using namespace std;
int v[120];
int a,b,n,i;
int main(void)
{
    while(~scanf("%d%d%d",&a,&b,&n))
    {
        if(a==0&&b==0&&n==0) break;
        memset(v,0,sizeof(v));
        v[1]=1,v[2]=1;
        for(i=3;i<=49;i++)
        {
            v[i]=(v[i-1]*a+v[i-2]*b)%7;
        }
        if(n>49)
        {
            if(n%49==0) n=49;
            else n=n%49; 
        } 
        printf("%d\n",v[n]);
    }
    return 0;
}