LightOJ 1282 Leading and Trailing（n阶的前三位，后三位）

Leading and Trailing

Description

You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of n^k.

Input

Input starts with an integer T (≤ 1000), denoting the number of test cases.

Each case starts with a line containing two integers: n (2 ≤ n < 2³¹) and k (1 ≤ k ≤ 10⁷).

Output

For each case, print the case number and the three leading digits (most significant) and three trailing digits (least significant). You can assume that the input is given such that n^k contains at least six digits.

Sample Input

5

123456 1

123456 2

2 31

2 32

29 8751919

Sample Output

Case 1: 123 456

Case 2: 152 936

Case 3: 214 648

Case 4: 429 296

Case 5: 665 669

解题思路：

求最后的三位，可以通过直接取余得到；求前三位则需要一些数学知识对于给定的一个数n,它可以写成10^a,其中这个a为浮点数，则n^k=(10^a)^k=10^a*k=(10^x)*(10^y);其中x,y分别是a*k的整数部分和小数部分，对于t=n^k这个数，它的位数由(10^x)决定，它的位数上的值则有(10^y)决定，因此我们要求t的前三位，只需要将10^y求出，在乘以100，就得到了它的前三位。

f(n) = n^k
tmp = log10(f(n)) = k*log10n
tmp = tmp-floor(tmp)
tmp = 10^tmp

AC代码：

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;

typedef long long ll;

int solve(ll a,ll b){
    double tmp = b*log10(a*1.0);
    tmp -= floor(tmp);
    tmp = pow(10,tmp);
    tmp *= 100;
    return (int) tmp;
}

int quickpow(ll a,ll b,ll c){
    ll ans = 1;
    a %= c;
    while(b){
        if(b & 1)
            ans = (ans*a)%c;
        b >>= 1;
        a = (a*a)%c;
    }
    return ans;
}

int main(){
    int T,t = 1;
    scanf("%d",&T);
    while(T--){
        ll n,k;
        scanf("%lld%lld",&n,&k);
        printf("Case %d: %.3d %.3d\n",t++,solve(n,k),quickpow(n,k,1000));
    }
    return 0;
}