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
这道题后三个数直接%1000就可以了,注意要考虑后三位数不足三位要补零的情况。主要就是前三个数不好求。假设n^k
=a.bc10^m
。方程两边同时对10求log,得到klog10(n)=m+log10(a.bc)。然后直接减去前面的整数部分,再求10^log10(a.bc)最后在*100就可以了。
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
typedef long long ll;
ll mod=1000;
ll rpow(ll x,ll k)
{
ll ans=1;
while(k)
{
if(k%2)
ans=ans*x%mod;
x=x*x%mod;
k/=2;
}
return ans;
}
int main()
{
int t,kase=0;
ll n,k,ans;
scanf("%d",&t);
while(t--)
{
scanf("%lld%lld",&n,&k);
ll q=rpow(n,k);
double c=k*log10(n)-(int)(k*log10(n));
c=pow(10,c);
ans=c*100;
printf("Case %d: %lld %03lld\n",++kase,ans,q);
}
return 0;
}