杭电 Leftmost Digit

用log算，而且注意用longlong 型而不是int型

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