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 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
题意:求N^k的前3位和后3位;
思路:后3位用快速幂求解,前3位用取对数来求解;
n^k=a.bc*10^m ( m为n^k的位数,即m=(int)lg(n^k)=(int)(k*lgn) );
求对数: k*lgn=lg(a.bc)+m
即 a.bc=10^(k*lgn-m)=10^(k*lgn-(int)(k*lgn));
abc=a.bc*100;
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
long long qp(long long x,long long y,long long z)
{
long long base=1;
while(y)
{
if(y&1)
base=base*x%z;
x=x*x%z;
y>>=1;
}
return base;
}
int main()
{
long long t,n,k,h=1;
scanf("%lld",&t);
while(t--)
{
int ans=0;
scanf("%lld%lld",&n,&k);
printf("Case %lld: ",h++);
ans=qp(n,k,1000);
double cnt=k*log10(n)-(int)(k*log10(n));
int temp=pow(10,cnt)*100;
printf("%d %03d\n",temp,ans);//后三位写成%03d
}
}