[数学]HDU1060Leftmost Digit

Problm 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.

$N^N=10^{N\times lgN}$

#include <vector>
#include <cmath>
#include <iostream>
using namespace std;
int main()
{
    int t, n;
    double x, y;
    cin >> t;
    while(t--)
    {
        cin >> n;
        x = n*log10(n);
        y = (long long)x;
        x = x - y;	//去掉大的系数，结果上的体现就是没了后面那一堆零
        cout << int(pow(10.0,x)) << endl;
    }
    return 0;
}