2020-11-27

快速幂模板，爆long long了用__int128
https://ac.nowcoder.com/acm/contest/7872/F
题目来源

#include <iostream>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<bits/stdc++.h>

using namespace std;
#define ll __int128
ll fastPower(ll base, ll power) {
    ll result = 1;
    while (power > 0) {
        if (power & 1) {//if(power%2==1)
            result = result * base % 9999999967;
        }
        power >>= 1;
        base = (base * base) % 9999999967;
    }
    return result;
}
int main()
{
    int x,t;
    int kase;
    scanf("%d",&kase);
    while(kase--)
    {
        scanf("%d%d",&x,&t);
        printf("%lld\n",(long long)fastPower(x,t));
    }
    return 0;
}