hdoj.1060 Leftmost Digit 20141106

Leftmost Digit

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

Total Submission(s): 13502    Accepted Submission(s): 5186

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.

   
   
   
   

    
    
#include<stdio.h>
#include<math.h>
/*
公式：n^n = 10^(nlgn) 得 r=int( 10^( (nlgn) - int(nlgn) ) ) 
*/
int main(){
    int t;
    double q,n;
    scanf("%d",&t);
    while(t--){
        scanf("%lf",&n);
        q=n*(log(n)/log(10.0))-floor(n*(log(n)/log(10.0)));
        q=pow(10.0,q);
        printf("%d\n",int(q));
    }
    return 0;
}