Rightmost Digit（hdu1061）

• Problem Description

• Givena 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 testcases. T test cases follow.

Each test case contains a single positive integer N(1<=N<=1,000,000,000).

注意：没什么难点 就是对周期取余如果是0说明是最后一个数，所以比如2486要把6 放前面才好

• intn;  

• inta[10][4] = {

• {0},{1},{6,2,4,8},{1,3,9,7},{6,4},{5},{6},{1,7,9,3},{6,8,4,2},{1,9}

• },d,num;

• scanf("%d",&num);  

• while(num--)  

• {  

•     scanf("%ld",&n);  

•     d = n % 10;  

•     if(d == 0||d == 1||d == 5||d == 6)  

•          printf("%d\n",d);  

•     else if(d == 4||d == 9)   

•          printf("%d\n",a[d][n %2]);  

•     else if(d == 2||d == 3||d == 7||d ==8)  

•          printf("%d\n",a[d][n %4]);  

• }