codeforces 742A-Arpa’s hard exam and Mehrdad’s naive cheat 快速幂

传送门 ： CF 742A

题解

直接做8的快速幂， 因为模数是10
用周期做也可以， 不过我优化不到0ms…

---

AC code

/*adrui's submission
  Language : C++
  Result : Accepted
  Lover :　zyy
  Favorite :　Dragon Balls
  Standing in the Hall of Fame
*/

#include<iostream>
using namespace std;

#define mod 10

int n;

int solve(){

    int res = 1, a = 8;

    while(n){

        if(n & 1) res = res * a % mod;
        a = a * a % mod;

        n >>= 1;
    }

    return res;
}

int main(){

    while(cin >> n) cout << solve() << endl;

    return 0;
}