Leftmost Digit

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

baother0

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

阅读量678

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/xiao_niu_1/article/details/12917663

版权

数论专栏收录该内容

5 篇文章 0 订阅

订阅专栏

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.

分析：

m=n^n;两边同取对数，得到，log10(m)=n*log10(n);再得到，m=10^(n*log10(n));
然后，对于10的整数次幂，第一位是1，所以，第一位数取决于n*log10(n)的小数部分
总之，log很强大啊，在求一个数的位数上，在将大整数化成范围内的整数上，在指数问题上。

package _5;
import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner input = new Scanner (System.in);
		int N = input.nextInt();
		for (int i = 0;i < N;i++) {
			int n = input.nextInt();
			double a = n * Math.log10(n);
			double b = a - (long)a;
			int ans = (int)Math.pow(10, b);
			System.out.println(ans);
		}
	}
}