巨大的斐波那契数！

复制代码

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#define ll unsigned long long
using namespace std;

ll qmod(ll a, ll b, ll mod)
{
    ll ans = 1;
    a = a%mod;
    while (b)
    {
        if (b & 1)
        {
            ans = (ans*a) % mod;
        }
        b = b / 2;
        a = (a*a) % mod;
    }
    return ans;
}

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        ll a, b, n, cnt;
        cin >> a >> b >> n;
        cnt = 0;
        vector <ll> fib;
        fib.push_back(0);
        fib.push_back(1);
        for (int i = 2; i <= n*n; i++)
        {
            fib.push_back((fib[i - 1] + fib[i - 2]) % n);
            cnt++;
            if (fib[i] == 1 && fib[i - 1] == 0)
            {
                break;
            }
        }
        if (n != 1)
            cout << fib[qmod(a, b, cnt)] << endl;
        else
        {
            cout << "0" << endl;
        }
    }
    //system("pause");
    return 0;
}