HDU 1051 - Rightmost Digit

找循环

 #include <iostream>
 #include <cmath>
 using namespace std;
 int t,m,p,q;
 long long n;
 int c[],ans;
 int main()
 {
     scanf("%d",&t);
     while(t--)
     {
         scanf("%lld",&n);
         m=n%;
         int cnt=,i;
         c[++cnt]=m;
         p=(m*m)%;
         while(p!=m)
         {
             c[++cnt]=p;
             p=(p*m)%;
         }
         ans=(n-)%cnt+;
         printf("%d\n",c[ans]);
     }
 }
 /*
 3 9 7 1 3
 4 6 4 6
 */