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


  
  
  
  


  
  
  
  

   
   
#include<iostream>
#include<cstdio>
#include<cmath>
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 m,n,i,j,k;
    cin>>m;
    while(m--)
    {
        cin>>n;
        cout<<vis((double)n)<<endl;
    }
    return 0;
}