hdu 1060 Leftmost Digit

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

234

 

Sample Output

22
这道题目考的是数学问题，不过还有些类型间的转换，m=log10(n^n)=n*log10(n);floor函数，这个函数是取不大于一个数的最大数，pow(a,b)函数，是求a^b;的函数代码如下：#include<stdio.h>#include<math.h>int main(){int T; int n;double m;scanf("%d",&T);while(T--){scanf("%d",&n);m=n*log10(n+0.0);m-=floor(m);double num=pow(10,m);printf("%.lf\n",floor(num));}return 0;}