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
分析:任何一个正整数可以表达为每一位的基数乘以对应的权例如12345,
1的基数为1,权数是10的4次方;则123456=10的5次方乘以1.2345,
令1.2345=10的x次方,x必为小数,则12345=10的(4.x);
1,令M=N^N;
2,分别对等式两边取对数得 log10(M)=N*log10(N),得M=10^(N*log10(N));
3,令N*log10(N)=a+b,a为整数,b为小数;
4,C函数:log10(),计算对数,pow(a,b)计算a^b
5,由于10的任何整数次幂首位一定为1,所以,M的首位只和N*log10(N)的小数部分有关, 即只用求10^b救可以了;
6,最后对10^b取整,输出取整的这个数就行了。
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
int main()
{
int n,T;double a,t;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
a=n*log10(n);
t=a-floor(a);//floor()得到不大于a的整数,但将floor()改为(int)a则不行,改为long long和int64——则没问题
printf("%d\n",(int)pow(10.0,t));
}
return 0;
}