hdoj 1060 Leftmost Digit



http://acm.hdu.edu.cn/showproblem.php?pid=1060

Leftmost Digit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13107    Accepted Submission(s): 5019

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


   
   

    
    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.
   
   
   
   

    
    
#include<stdio.h>
#include<math.h>
__int64 N;
int main()
{
	int T;
	double t;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%I64d",&N);
		t=N*log10((double)N);
		//printf("%lf#\n",t);
		t-=(__int64)(t);
		//printf("%lf$\n",t);
		printf("%I64d\n",(__int64)(pow((double)10,t)));
	}
	return 0;
}