HDU 1060 Leftmost Digit

Problem Description

Given a positive integer N, you should output the leftmost 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 leftmost digit of N^N.

 

Sample Input

  
  

   
   2
3
4
  
  

 

Sample Output

  
  

   
   2
2


   
   

    
    

     
     Hint
    
    
    
    
In the first case, 3 * 3 * 3 = 27, so the leftmost digit is 2.
In the second case, 4 * 4 * 4 * 4 = 256, so the leftmost digit is 2.
   
   
   
   

    
    m=n^n,两边分别对10取对数得 log10(m)=n*log10(n),得m=10^(n*log10(n)),由于10的任何整数次幂首
   
   
   
   

    
    位一定为1,所以m的首位只和n*log10(n)的小数部分有关。

   
   
   
   

    
    
    
    
#include <cstdio>
#include <math.h>
int main()
{
    int t;
	scanf("%d",&t);
        while(t--)
        {
            unsigned long n;
            scanf("%lld",&n);
            double x=n*log10(n*1.0);
            x-=(__int64)x;
            int a=pow(10.0, x);
            printf("%d\n",a);
        }
    return 0;
}