#include<stdio.h> long long quickpow(long long m,long long n,int k) { int b = 1; while (n > 0) { if (n & 1) b = (b*m)%k; n = n >> 1 ; m = (m*m)%k; } return b; } int main() { long long T,a,n; scanf("%lld",&T); while(T--) { scanf("%lld",&n); long long ans; ans=quickpow(n,n,10); printf("%lld\n",ans); } return 0; }
快速幂
最新推荐文章于 2023-06-08 11:16:54 发布