hdoj1060_Leftmost Digit

最新推荐文章于 2017-09-10 11:18:23 发布

_上善若水_

最新推荐文章于 2017-09-10 11:18:23 发布

阅读量324

点赞数

分类专栏：数学题

本文链接：https://blog.csdn.net/u012631715/article/details/40316649

版权

数学题专栏收录该内容

8 篇文章 0 订阅

订阅专栏

Leftmost Digit

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

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

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.

   
   
   
    
  
  


一个数可以表示成A * 10 ^ x 的形式， 答案就是A的整数部分
lg(N^N) = N * lg(N) = a.b
10 ^a.b = N^N
10^b = 上面的A，再取整就是答案

#include <iostream>
#include <cstdio>
#include <math.h>
using namespace std;

int main()
{
    int t;
    scanf("%d", &t);
    while (t--)
    {
        int num;
        scanf("%d", &num);
        double temp = num * log10(num);
        long long a = temp;
        int res = pow(10.0, temp - a);
        printf("%d\n", res);
    }
    return 0;
}