Leftmost Digit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14322 Accepted Submission(s): 5479
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).
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 2HintIn 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
Recommend
/*
m=n^n;
log10(m)=log10(n^n);
log10(m)=n*log10(n);
m=10^(n*log10(n))
设b=n*log10(n);
注意公式10^(a+b)=10^a*10^b我们假设这里a是整数b是小数
我们知道10的整数次方的第一位是1,所以要去全局的第一位肯定和有关*/
#include<stdio.h>
#include<math.h>
int main()
{
int times;
double b,a,n;
scanf("%d",×);
while(times--)
{
scanf("%lf",&n);
b=n*log10(n);
a=b-(long long)b;
printf("%d\n",(int)pow(10,a));
}
}