N^N 数字的最右边

Rightmost Digit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 32966    Accepted Submission(s): 12634

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.

   
   
  
  

 

 

//这道题目中N^N可以转换为求N的N%10即转化为求N的个位，再根据N的个位与在不同情况下时

//根据循环的第几次的不同来求尾位数字；
//1,0,5,6的任意次方都为1
//2^1 2 2^2 4 2^3 6 2^4 2 可知1.2.4.6为一个循环
//3^1 3 3^2 9 3^3 7 3^4 1     3 9 7 1
//7^1 7 7^2 9 7^3 3 7^4 1     7 9 3 1
//4^1 4 4^2 6                 4 6
//8^1 8 8^2 4                 8 4
//9^1 9 9^2 1                 9 1
//用c++方式写提交却错了，感觉莫名其妙，感觉每次都是c++写错啦，c又对了。想不明白。
//找规律的题目，虐心
#include<stdio.h>
int main()
{int n,k,m;
scanf("%d",&k);
while(k--)
{
scanf("%d",&n);
m=n%10;
if(m==0||m==1||m==5||m==6) printf("%d\n",m);
if(m==2)
{
if (n%4==1) printf("2\n");
if (n%4==2) printf("4\n");
if (n%4==3) printf("8\n");
if (n%4==0) printf("6\n");
}
if(m==3)
{
if (n%4==1) printf("3\n");
if (n%4==2) printf("9\n");
if (n%4==3) printf("7\n");
if (n%4==0) printf("1\n");
}
if(m==7)
{
if (n%4==1) printf("7\n");
if (n%4==2) printf("9\n");
if (n%4==3) printf("3\n");
if (n%4==0) printf("1\n");
}
if(m==8)
{
if (n%4==1) printf("8\n");
if (n%4==2) printf("4\n");
if (n%4==3) printf("2\n");
if (n%4==0) printf("6\n");
}
if (m==4)
{
if (n%2==1) printf("4\n");
if (n%2==0) printf("6\n");
}
if (m==9)
{
if (n%2==1) printf("9\n");
if (n%2==0) printf("1\n");
}

}
return 0;
}