Leftmost Digit

Leftmost Digit

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

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.

   
   
   
    
  
  

 

Author

Ignatius.L

//数论，巧妙的应用了log和科学计数法的作用

#include<stdio.h>
#include<math.h>
double Get_Digit(double num)
{
 return num*log10(num);
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
     double N;
     scanf("%lf",&N);
     double digit=Get_Digit(N);
     double a=pow(10.0,N*log10(N)-(__int64)digit);
     printf("%d\n",(int)a);        
    }
return 0;    
}