本文共 930 字，大约阅读时间需要 3 分钟。
题解：快速幂
/**@Author: STZG*@Language: C++*/#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include //#define DEBUG#define RI register int#define endl "\n"using namespace std;typedef long long ll;//typedef __int128 lll;const int N=100000+10;const int M=100000+10;const int MOD=1e9+7;const double PI = acos(-1.0);const double EXP = 1E-8;const int INF = 0x3f3f3f3f;int t,n,m,k,p,l,r,u,v;int ans,cnt,flag,temp,sum;int a[N];char str;struct node{};ll power(ll a,ll b, ll c){ ll res=1; ll base=a%c; while(b){ if(b&1)res=(base*res)%c; base=(base*base)%c; b>>=1; } return res;}int main(){#ifdef DEBUG freopen("input.in", "r", stdin); //freopen("output.out", "w", stdout);#endif //ios::sync_with_stdio(false); //cin.tie(0); //cout.tie(0); scanf("%d",&t); while(t--){ scanf("%d",&n); cout< <
转载地址：http://pqzof.baihongyu.com/