hdoj-1005-C

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.

刚开始看以为是递归调用，提交了一个错误代码，然后才看见N的取值范围很大，取模运算结果有规律可循。
不难发现，f(n)的值域为[0,6]，因为f(n) = (A * f(n - 1) + B * f(n - 2)) %7，又因为起点值为1，所以48个N的取值为一组。有了这个思路了以后就可以写出下面的代码了：

#include<stdio.h>
#include<stdlib.h>
int fun(int a,int b,int n);
int main()
{
    int a;
    int b;
    int n;
    while(scanf("%d%d%d",&a,&b,&n)==3 && a||b||n){
        printf("%d\n",fun(a,b,n%48));
    }
}

int fun(int a,int b,int n)
{
   return(n==1 || n==2)?1:(a*fun(a,b,n-1)+b*fun(a,b,n-2))%7;
}