# Leftmost Digit

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7028 Accepted Submission(s): 2703

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
2 3 4

Sample Output
2 2 AC代码：
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int T;
cin>>T;
while(T--)
{
long long n;
cin>>n;
double k=n*log10(double(n));
k=k-(long long )k;//注意这里应是1long long 类型
k=pow(10.0,k);
while(k<1)
k*=10;
cout<<(int)k<<endl;
}return 0;
}

#### Red and Black&&http://acm.hdu.edu.cn/showproblem.php?pid=1312

2012-07-25 13:17:27

#### http://acm.hdu.edu.cn/showproblem.php?pid=1541

2012-02-27 19:51:20

#### Robberies&&http://acm.hdu.edu.cn/showproblem.php?pid=2955

2012-01-10 09:46:54

#### 字符输入时注意的格式（特殊情况）http://acm.hdu.edu.cn/showproblem.php?pid=1860

2013-05-05 19:33:55

#### HDU-1274-展开字符串（dfs分段字符串处理）

2017-03-04 13:41:00

#### POJ2255 HDU1710【树的遍历】【水题】

2017-03-28 19:31:04

#### HDU 2141 Can you find it? 二分查找

2015-07-29 19:35:01

#### 题解： HDU 2141 Can you find it? （二分查找）

2015-12-06 19:03:48

#### HDU 2866 Special Prime 找规律

2016-03-18 18:55:21

#### HDU 1083 二分匹配

2012-09-24 15:54:03

## 不良信息举报

http://acm.hdu.edu.cn/showproblem.php?pid=1060