快速幂

#include <bits/stdc++.h>#include <iostream>using namespace std;#define mod 100007long long int pow(long long x,long long b){long long int k=1;while(b){if(b&1==1)k*=x;b>>=1;x*=x;k%=mod;x%=mod;}return k;}int main (){long long int a;a=pow(3,500000000000000);cout<<a;return 0;}