找周期
#include <iostream>
#include <string.h>
using namespace std;
#define MAXN 100000 + 10
int f[MAXN];
void input()
{
int a, b, n;
f[1] = 1;
f[2] = 1;
while (cin >> a >> b >> n, a || b || n)
{
int i;
for (i = 3; i <= 100000; i++)
{
f[i] = (a * f[i - 1] + b * f[i - 2]) % 7;
if (f[i] == 1 && f[i - 1] == 1)
{
break;
}
}
n = n % (i - 2);
f[0] = f[i - 2];
cout << f[n] << endl;
}
}
int main()
{
input();
return 0;
}