Leftmost Digit

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1060

Problem Description

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

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.

   
   
   
    
  
  

 

题目描述：给定整数N(1<=N<=1,000,000,000).求N的N次幂的最高位。思路：记M=N^N，则lg(M)=N*lg(N),M=10^(N*lg(N))，假设N*lg(N)=X.ABCDEF...由于10的X次幂首位是1,M=10^X*10^(0.ABCDE..),所以M的高位由小数点后的位数决定，代码如下：

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