Leftmost Digit hdu 1060

Leftmost Digit

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

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

 

 

 

 

 

#include<iostream>
#include<cstdio>
#include<math.h>
using namespace std;
int vis(double n)
{
    double integer;
    double decimal=modf(n*log10(n),&integer);
    double p=pow((double)10,decimal);
    modf(p,&integer);
    return (int)integer;


}
int main()
{
       int n,c;
        scanf("%d",&c);
        while(c--)
        {
        scanf("%d",&n);
        printf("%d\n",vis((double)n));
        }






    return 0;
}