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): 15815 Accepted Submission(s): 6169
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
代码
#include<stdio.h>
#include<math.h>
int main() {
long long N;
double m,c;
int t,d;
scanf("%d",&t);
while(t--) {
scanf("%lld",&N);
m=N*log10(double(N));
c=m-(long long )m;
d=(int)pow(10.0,c);
printf("%d\n",d);
}
return 0;
}