hduoj1005

Number Sequence


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




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 
 

Statistic | Submit | Discuss | Note

题解

因为f[i]取余后的值为0 1 2 3 4 5 6 共7种情况，共有7*7种排列情况，可以找到规律后，求解，暴力肯定会超时

#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<string.h>
using namespace std;
int main()
{
    int f[110];
    int a,b,n,i;
    f[1]=1;
    f[2]=1;
    while(scanf("%d%d%d",&a,&b,&n)!=EOF)
    {
        if(a==0&&b==0&&n==0)
        {
            break;
        }
        if(n>=3)
        {
            for(i=3;i<100;i++)
            {
                f[i]=a*f[i-1]+b*f[i-2];
                f[i]=f[i]%7;
                if(f[i]==1&&f[i-1]==1)
                {
                    break;
                }
            }
            i=i-2;
            n=n%i;
            if(n==0)
                n=i;
            printf("%d\n",f[n]);
        }
        else
        {
            printf("1\n");
        }
    }
}