hdu_2.1.8_Leftmost Digit

最新推荐文章于 2019-07-15 22:08:00 发布

xiaoleiacm

最新推荐文章于 2019-07-15 22:08:00 发布

阅读量414

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/xiaoleiacmer/article/details/8619433

版权

数论专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Leftmost Digit

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 1602 Accepted Submission(s): 724

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.

Author

Ignatius.L

比我想象的要麻烦

code:

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
	int cas;
	cin>>cas;
	int num;
	while(cas--)
	{
		cin>>num;
		double a=num*log10(num*1.0)-(__int64)(num*log10(num*1.0));
		double b=pow(10.0,a);		
		cout<<int(b)<<endl;
	}
	return 0;
}