【杭电ACM】1097 A hard puzzle

【杭电ACM】1097  A hard puzzle

http://acm.hdu.edu.cn/showproblem.php?pid=1097

先用int手写了算法结果竟然wrong answer，估计是测试数据很大，直接上BigInteger 和modPow()，轻松解决。

//author:pz

import java.math.BigInteger;
import java.util.Scanner;

public class Main{
    public static void main(String args[]){
        Scanner scan = new Scanner(System.in);
        while(scan.hasNext()){
            BigInteger a = scan.nextBigInteger();
            BigInteger b = scan.nextBigInteger();
            BigInteger ans = a.modPow(b, new BigInteger("10"));
            System.out.println(ans);
        }
    }
}