首页 > 其他 > 详细

杭电 HDU 1060 Leftmost Digit

时间:2015-03-23 18:02:35      阅读:155      评论:0      收藏:0      [点我收藏+]

Leftmost Digit

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


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
Hint
In 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<iostream>
#include<cmath>
using namespace std;
int main()
{
  int  n;int T;
     cin>>T;
  while(T--)
  {
   scanf("%d",&n);
  double sum1=n*log10(double(n));
   double sum2=sum1-floor(sum1);
   printf("%d\n",int (pow(10,sum2)));
  }
  return 0;
}

杭电 HDU 1060 Leftmost Digit

原文:http://blog.csdn.net/lsgqjh/article/details/44565657

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!