uva 11029 Leading and Trailing

最新推荐文章于 2019-03-04 10:51:26 发布

红鲤鱼遇绿鲤鱼

最新推荐文章于 2019-03-04 10:51:26 发布

阅读量523

点赞数

分类专栏：数学根本不会/就差一点/记得再看文章标签： uva 数学

本文链接：https://blog.csdn.net/tengfei461807914/article/details/76359842

版权

数学同时被 2 个专栏收录

80 篇文章 0 订阅

订阅专栏

根本不会/就差一点/记得再看

73 篇文章 0 订阅

订阅专栏

原题：
Apart from the novice programmers, all others know that you can’t exactly represent numbers raised to some high power. For example, the C function pow(125456, 455) can be represented in double data type format, but you won’t get all the digits of the result. However we can get at least some satisfaction if we could know few of the leading and trailing digits. This is the requirement of this problem.

Input
The first line of input will be an integer T<1001, where T represents the number of test cases. Each of the next T lines contains two positive integers, n and k. n will fit in 32 bit integer and k will be less than 10000001.

Output
For each line of input there will be one line of output. It will be of the format LLL…TTT, where LLL represents the first three digits of n^k and TTT represents the last three digits of n^k. You are assured that n^k will contain at least 6 digits.

Sample Input
2
123456 1
123456 2

Sample Output
123…456
152…936

中文：
让你计算n^k的前3位和最后3位。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1000;

ll quick_power(ll n, ll k)
{
    ll res = 1;
    while (k)
    {
        if (k & 1)
            res = res * n % mod;
        n = n * n % mod;
        k >>= 1;
    }
    return res;
}
int main()
{
//  ios::sync_with_stdio(false);
    int t;
    scanf("%d",&t);
    ll n,k;
    while(t--)
    {
        scanf("%lld %lld",&n,&k);
        ll b=quick_power(n,k);
        ll a=(ll)(pow(10.0, 2 + fmod(k*log10(1.0*n),1)));
        printf("%lld...%03lld\n",a,b);
    }
    return 0;
}