pursuit的专栏

如果一个人不愿意在平静中度过一生,就要像雄鹰一样忍住孤独,背负青天,傲然飞翔,以独特的眼力和胆略审视这个世界,用清晰而坚定的智慧眼光捕捉任何一个成功的机遇。...

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): 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;
}


阅读更多
个人分类: 数论 HDU
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

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

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭