hdu_1060_数学求解n^n的第一位数

最新推荐文章于 2019-01-17 22:43:26 发布

Jianbagengmu

最新推荐文章于 2019-01-17 22:43:26 发布

阅读量286

点赞数

分类专栏：数学_脑洞题文章标签：数学

本文链接：https://blog.csdn.net/jianbagengmu/article/details/77872122

版权

数学_脑洞题专栏收录该内容

11 篇文章 0 订阅

订阅专栏

Leftmost Digit

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

题意:
    求n^n的第一位数;
解:
    设 m=n^n;
       log10(m)=log10(n^n);
       log10(m)=n*log10(n);
       m=10(n*log10(n));
10的幂次方第一位一定是1,就要考虑它的小数位

//time º¯ÊýµÄÊ¹ÓÃ
#include<cstdio>
#include<iostream>
#include<ctime>
#include<algorithm>
#include<cmath>
clock_t st,ed;
double ans;

using namespace std;
typedef long long ll;
int x,y;
ll solve(ll a,ll b)
{
    ll ans=1;
    a%=10;
    while(b)
    {
        if(b&1)
            ans=ans*a%10;
        b>>=1;
        a=a*a%10 ;
    }
    return ans;
}
int main()
{
    ll t,a,b;
   /* for(int i=1;i<=15;i++)
    {
        cout<<i<<" "<<solve(i,i)<<endl;
    }*/
    while(cin>>t)
    {
        while(t--)
        {
            cin>>b;
            double t=b*log10(b*1.0);
            double point=t-(ll)t;
            int ans=pow(10.0,point);
            cout<<ans<<endl;
        }
    }
    return 0;
}