HDOJ 1061Rightmost Digit

Rightmost Digit

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

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次方以后在尾数的那个循环里是第几个，至于前面加个0是为了%4以后更好的找

#include<iostream>
#include <stdio.h>
using namespace std;
int main ()
{ int a[][5]={{0,0,0,0,0},{0,1,1,1,1},{0,2,4,8,6},{0,3,9,7,1},{0,4,6,4,6},{0,5,5,5,5},{0,6,6,6,6},{0,7,9,3,1},{0,8,4,2,6},{0,9,1,9,1}};
int n,max1,max2;
scanf("%d",&n);
while (n--)
{
    scanf("%d",&max1);
    max2=max1%10;
    printf ("%d\n",a[max2][max1%4==0?4:max1%4]);
}
    return 0;
}