HDU 1060 【取对数+科学记数法】

Whyckck

于 2018-10-30 20:14:22 发布

阅读量413

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/Whyckck/article/details/83547980

版权

数论专栏收录该内容

12 篇文章 0 订阅

订阅专栏

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

Recommend

We have carefully selected several similar problems for you: 1018 1061 1071 1573 1066

m = n^n,取对数,lg(m) = n*lg(n),所以 m = 10^( n*lg(n) ),因为10的整数次方都是以1为开头的数，所以第一位之和n*lg(n)的小数部分有关，所以用自身减去自身的整数部分，留下小数部分，用pow就OK了

#include<bits/stdc++.h>
//#include <iostream>
//#include <cstring>
//#pragma GCC optimize(2)
#include<time.h>
using namespace std;
#define maxn 1255
#define inf 1e18
#define eps 0.00001
typedef long long ll;
const ll mod = 1e9+7;
const double pi = acos(-1);

ll n,t;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);

    //freopen("D:\\test1.in","w",stdout);
    //srand((int)time(0));

    cin >> t;
    double temp;

    while(t--)
    {
        cin >> n;

        temp = n*log10(n); 

        temp -= (ll)temp;  //减去整数部分

        ll ans = pow(10,temp);

        cout << ans << endl;

    }

    return 0;
}