Colossal Fibonacci Numbers! UVA - 11582

紫书的思路，打表法，找出循环的周期，然后递归求解即可，实现不难，但有一些细节，具体实现见如下代码：

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
#include<functional>
using namespace std;
const int maxn = 1010;

int f[maxn][maxn*6];//f相当于是一个查询表格
int p[maxn];

class Solve{
public:
	unsigned long long a, b;
	int n;

	int Cal(unsigned long long a1,unsigned long long b1,int rec){
		if (!b1) return 1;
		unsigned long long K = Cal(a1, b1 / 2, rec);
		K = ((K%rec)*(K%rec)) % rec;
		if (b1 % 2)
			K = K*a1%rec;
		return K;
	}

	void getPeriod(){
		for (int i = 2; i <= 1000; i++){
			f[i][0] = 0, f[i][1] = 1;
			for (int j = 2;;j++){
				f[i][j] = (f[i][j - 1]%i + f[i][j - 2]%i) % i;
				if (f[i][j] == 1 && f[i][j - 1] == 0){
					p[i] = j-1;
					break;
				}
			}
		}
	}

	void Deal(){
		cin >> a >> b >> n;
		if (a == 0 || n == 1){
			cout << 0 << endl;
			return;
		}
		int res = Cal(a%p[n],b,p[n]);
		cout << f[n][res] << endl;
	}
};

int main(){
	Solve a;
	int t;
	a.getPeriod();
	cin >> t;
	while (t--){
		a.Deal();
	}
	return 0;
}