Hdu-1097-a Hard puzzle (fast power modulo)

A Hard PuzzleTime limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total submission (s): 32633 Accepted Submission (s): 11672


Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,jgshining and ignatius:gave A and b,how to know the A^b.everyb Ody objects to this BT problem,so LCY makes the problem easier than begin.
This puzzle describes That:gave A and b,how to know the A^b ' s, the last digit number. But everybody was too lazy to slove the problem,so they remit to you, who was wise.

Inputthere is mutiple test cases. Each test cases consists of numbers a and B (0<a,b<=2^30)

Outputfor Each test case, you should output of the a^b ' s last digit number.

Sample Input

7 668 800

Sample Output

96

Authoreddy

AC Code:

Hdu-1097-a Hard puzzle (fast power modulo)