Leftmost Digit

Problem   Link：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): 13177    Accepted Submission(s): 5046

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.

   
   
   
    
  
  

 

 
 

  
  对一个数num可写为 num=a*10^n , 即科学计数法，使a的整数部分即为num的最高位数字
 
 
 
 

  
  

 
 
 
 

  
  num
  
  num
  
  =10
  
  n
  
   * a  这里的n与上面的n不等
 
 
 
 

  
  

 
 
 
 

  
  两边取对数： num*lg(num) = n + lg(a);
 
 
 
 

  
  

 
 
 
 

  
  因为a<10，所以0<lg(a)<1
 
 
 
 

  
  

 
 
 
 

  
  令x=n+lg(a); 则n为x的整数部分，lg(a)为x的小数部分
 
 
 
 

  
  

 
 
 
 

  
  又x=num*lg(num);
 
 
 
 

  
  

 
 
 
 

  
  a=10
  
  (x-n)  
  
  =  10
  
  (x-int(x)))
 
 
 
 

  
  

 
 
 
 

  
  再取a的整数部分即得num的最高位
 
 
 
 

  
  -----------------------------------------------------------------------
 
 
 
 

  
  code:
 
 
 
 

  
  #include<stdio.h>
#include<math.h>
int main()
{
	int cas,ans;
	double x,num,a;
	while(scanf("%d",&cas)!=EOF)
	{
		while(cas--)
		{
			scanf("%lf",&num);
			x=num*log10(num);
			a=pow(10.0,x-(_int64)x);//int 为32位，转化时可能不够会导致数据丢失，应用_64int强制转换。
			ans=int(a);
			printf("%d\n",ans);
		}
	}
	return 0;
}

 
 
 
 

  
  总结：log很强大啊，在求一个数的位数上，在将大整数化成范围内的整数上，在指数问题上。。。