leftmost digit

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

原创最新推荐文章于 2019-07-15 22:08:00 发布 · 602 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

数学专栏收录该内容

11 篇文章

订阅专栏

本文介绍了一种算法，用于解决给定正整数N时，如何高效计算N的N次方结果的最左（最高位）数字。该算法利用对数特性避免了直接计算大数，适用于编程竞赛及数学问题求解。

Leftmost Digit

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

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>
int main()
{
	int n,m,i,k;
	double y;
	while(~scanf("%d",&n))
	{
		for(i=1;i<=n;i++)
		{
			scanf("%d",&m);
			y=m*log10(m);
			y=y-(__int64)y;
			printf("%d\n",(int)pow(10,y));
		}
	}
}