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,你的任务是找出nk的最高有效的三位数和最低有效的三位数。
输入
输入以整数T开始(≤ 1000),表示测试用例的数量。
每种情况都从包含两个整数的行开始:n(2≤ n<231)和k(1≤ k≤ 107).
输出
对于每个案例,打印案例编号、三个前导数字(最高有效)和三个后尾数字(最低有效)。您可以假设给定的输入使得n的k次方至少包含六位数字。
样本输入
5
123456 1
123456 2
2 31
2 32
29 8751919
样本输出
案例1:123 456
案例2:152 936
案例3:214 648
案例4:429 296
案例5:665 669
题解:后三位,快速幂模板,前三位如下图所示
#include<stdio.h>
#include<math.h>
int main()
{
int t,q=1;
scanf("%d",&t);
while(t--)
{
long long n,m;
scanf("%lld%lld",&n,&m);
double k=m*log10(n);//小数部分
int x=k,p;//x为整数部分
p=pow(10,k-x)*100;
printf("Case %d: %03d",q++,p);
int u=1;
while(m)
{
if(m%2!=0)
u=u*n%1000;
n=n*n%1000;
m=m/2;
}
printf(" %03d\n",u);
}
}
//
快速幂模板
int s(int m, int k, int p)
{
int res=1%p,t=m;
while (k)
{
if (k&1)
res=res*t%p;
t=t*t%p;
k=k/2;
}
return res;
}