Problem Description
Given a positive integer N, you should output the most right digit of N^N.
Input
The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains a single positive integer N(1<=N<=1,000,000,000).
Output
For each test case, you should output the rightmost digit of N^N.
Sample Input
2
3
4
Sample Output
7
6
Hint
In the first case, 3 * 3 * 3 = 27, so the rightmost digit is 7.
In the second case, 4 * 4 * 4 * 4 = 256, so the rightmost digit is 6.
package OJ;
import java.util.*;
public class P8 { //需要找规律,来减少循环的次数 Rightmost Digit
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int times = in.nextInt();
int[] res = new int[times];
for(int i=0; i<times; i++){
int nums = in.nextInt();
int a = nums%10;
int b = nums%4 + 4;
int result = 1;
while(b>0){
result*=a;
b--;
}
res[i] = result%10;
}
for(int t : res)
System.out.println(t);
}
}