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 <bits/stdc++.h>
using namespace std;
int main()
{
int t,n;
double x;
while(cin>>t)
{
while(t--)
{
cin>>n;
x=n*log10(n);
x-=(long long)x;
x=(int)pow(10,x);
cout<<x<<endl;
}
}
return 0;
}