HDU1005 規律題

#include<iostream>
#include<cstdlib>
#include<stdio.h>
#include<algorithm>
#include<cmath>
#include<queue>
#include<string>
#include<string.h>
#include<map>
using namespace std;
#define MAXN 100000
int prime[MAXN];//第i個素數
bool isprime[MAXN + 10];//is_pri[i]表示i是素數
                       //返回n以內素數的個數
int sieve(int n) {
    int p = 0;
    for (int i = 0;i <= n;i++)isprime[i] = true;
    isprime[0] = isprime[1] = false;
    for (int i = 2;i <= n;i++) {
        if (isprime[i]) {
            prime[++p] = i;
            for (int j = 2 * i;j <= n;j += i)isprime[j] = false;
        }
    }
    return p;
}
int main()
{
    int A, B, n;
    int a[50];
    a[1] = 1, a[2] = 1;
    while (cin >> A >> B >> n,A,B,n)
    {
        for (int i = 3;i < 48;i++)
        {
            a[i] = (A*a[i - 1] + B * a[i - 2]) % 7;
        }
        cout << a[n % 48] << endl;
    }

    
}