原题链接:https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1126
思路:矩阵快速幂 或者找循环节
AC代码:
#include <iostream>
using namespace std;
int f[300] = { 1, 1, 1 }; // 根据规律可知,一定存在循环节
int main()
{
int A, B, N;
scanf("%d %d %d", &A, &B, &N);
int i, ben, end, cycle;
bool flag = false;
for (i = 3; i <= N && !flag; i++)
{
f[i] = ((A * f[i - 1] + B * f[i - 2]) % 7 + 7) % 7;
for (int j = 2; j < i; j++) {
if (f[i] == f[j] && f[i - 1] == f[j - 1]) {
cycle = i - j;
end = i - 1;
ben = j - 1;
flag = true;
break;
}
}
}
if (flag) {
printf("%d\n", f[ben + (N - end) % cycle]);
}
else {
printf("%d\n", f[N]);
}
return 0;
}