首页 > 其他 > 详细

HDOJ-1060-Leftmost Digit(求n^n的最高位)

时间:2014-11-15 15:35:19      阅读:332      评论:0      收藏:0      [点我收藏+]

Leftmost Digit

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


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.
#include<cstdio>
#include<cstring>
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
    int t;
    while(~scanf("%d",&t))
    {
        while(t--)
        {
            __int64 n;
            cin>>n;
            double x=n*log10(n*1.0); 
            x-=(__int64)x;
            int a=pow(10.0, x);//a为10的小数次方的整数部分 
            cout<<a<<endl;
        }
    }
    return 0; 
}

HDOJ-1060-Leftmost Digit(求n^n的最高位)

原文:http://blog.csdn.net/holyang_1013197377/article/details/41145773

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