HDOJ 1061 Rightmost Digit

Rightmost Digit

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

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.

   
   
   
    
  
  

 

Author

Ignatius.L

 

代码：

// Title : Rightmost Digit
// Addr : http://acm.hdu.edu.cn/showproblem.php?pid=1061
// Date : 2013-12-26 21:47:17

#include <iostream>
using namespace std;

int main()
{
	int n, T;
	int temp, rslt, tempx;
	int i, j;
	while(cin >> T)
	{
		for(j = 0; j < T; j++)
		{
			cin >> n;
			tempx = n % 10;
			switch(tempx)
			{
			case 0:
			case 1:
			case 5:
			case 6:
			case 9:
				rslt = tempx;
				break;
			case 2:
			case 3:
			case 4:
			case 7:
			case 8:
				temp = (n % 4);
				temp = temp ? temp : 4;
				rslt = 1;
				for(i = 0; i < temp; i++)
				{
					rslt = (rslt * tempx) % 10;
				}
				break;
			}
			cout << rslt << endl;
		}
	}
	return 0;
}