E - Leading and Trailing (快速幂取模)

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

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 < 231) and k (1 ≤ k ≤ 107).

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 nk 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

思路：后三位很好求，快速幂取模就好了，同样前三位我们也可以模拟快速幂来写，用double存储答案，模拟一下快速幂，中间记得转换就好了，注意输出为3位，如果后三位是022，那么必须输出022，不能输出22

代码：

//Full of love and hope for life

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <queue>
#define inf 0x3f3f3f3f
//https://paste.ubuntu.com/

using namespace std;

typedef long long ll;
const ll maxn=1e6+100;

double check(double a){
    if(a>=1000.0){
        while(a>=1000.0){
            a/=10.0;
        }
    }
    return a;
}

double quickmi1(double a,ll x){
    double ans=1.0;
    while(x){
        if(x&1){
            ans=ans*a;
            ans=check(ans);
        }
        a=a*a;
        a=check(a);
        x/=2;
    }
    return ans;
}

ll quickmi2(ll a,ll x){
    ll ans=1;
    while(x){
        if(x&1){
            ans=(ans*a)%1000;
        }
        a=(a*a)%1000;
        x/=2;
    }
    return ans;
}

int main(){
    ll T,a,b,k=0;
    cin >> T;
    while(T--){
        k++;
        cin >> a >> b;
        double n=a*1.0;
        printf("Case %lld: %d %03lld\n",k,(int)quickmi1(n,b),quickmi2(a,b));
    }
    return 0;
}

//Full of love and hope for life

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <queue>
#define inf 0x3f3f3f3f
//https://paste.ubuntu.com/

using namespace std;

typedef long long ll;
const ll maxn=1e6+100;

double check(double a){
    if(a>=1000.0){
        while(a>=1000.0){
            a/=10.0;
        }
    }
    return a;
}

double quickmi1(double a,ll x){
    double ans=1.0;
    while(x){
        if(x&1){
            ans=ans*a;
            ans=check(ans);
        }
        a=a*a;
        a=check(a);
        x/=2;
    }
    return ans;
}

int quickmi2(int a,int x){
    int ans=1;
    int t=a%1000;
    while(x){
        if(x&1){
            ans=(ans*t)%1000;
        }
        t=(t*t)%1000;
        x/=2;
    }
    return ans;
}

int main(){
    int T,a,b,k=0;
    cin >> T;
    while(T--){
        k++;
        cin >> a >> b;
        double n=(double)b*log10(a*1.0);
        n-=(int)n;
        double aa=pow(10.0,n);
        printf("Case %d: %d %03d\n",k,(int)(aa*100),quickmi2(a,b));
    }
    return 0;
}