c语言Number Sequence

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 Input1 1 3
1 2 10
0 0 0

Sample Output2
5

错误代码超时了，最后借鉴·同学地才发现有规律

#include<stdio.h>
int main()
{
 int n,a,b,f[1000001],i,j;
 f[1]=1;
 f[2]=1;
 scanf("%d %d %d",&a,&b,&n);
 while(scanf("%d %d %d",&a,&b,&n)!=EOF)
  {
    if(a==0&&b==0&&n==0)
     return 0;
     for(i=3;i<=n;i++)
       {
        f[1]=1;
              f[2]=1;
         f[i]=(a*f[i-1]+b*f[i-2])%7;
         
    }
    printf("%d\n",f[n]);
  }
 } 

正确地代码：
49一循环，取余即可

#include <stdio.h>
int f(int a,int b,int n);
int main()
{
    int n,a,b;
    scanf("%d %d %d",&a,&b,&n);
 while(a!=0||b!=0||n!=0){
  a=a%7;
  b=b%7;
  n=n%48;
  printf("%d\n",f(a,b,n));
  scanf("%d %d %d",&a,&b,&n);
 }
    return 0;
}
int f(int a,int b,int n)
 {
 if(n==1){
  return 1;
 }else if(n==2){
  return 1;
 }else{
  return (a*f(a,b,(n-1))+b*f(a,b,(n-2)))%7;
 }
}