hdoj--1060--Leftmost Digit（数学）

Leftmost Digit

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  HDU 1060

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次方的第一位

暴力一定超时，log取底

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		__int64 n;
		scanf("%I64d",&n);
		double ans=n*log10(n);
     	<span style="white-space:pre">	</span>ans-=(long long)ans;
     	<span style="white-space:pre">	</span>int a=(int)pow(10,ans);
		printf("%d\n",a);
	}
	return 0;
}