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
这个题,前三位用log写,后三位用快速幂取模写。
快速幂
快速幂取模模板
#include<cstdio>
#include<cmath>
int pow_mod(int a,int b)
{
int ans = 1,base=a;// ans:结果;base:底数
base = base % 1000;
//【考虑0次方的情况】
if(b==0)
{
return 1%1000;// 任意a的0次幂都是1,故直接用1%c即可
}
while(b)
{
if(b & 1) // 与运算,判断奇偶性
ans = (ans*base) % 1000;
b = b >> 1;// 右移一位,相当于除2
base = (base * base) % 1000;
}
return ans;
}
int main()
{
int t,a,n,cnt = 1;
scanf("%d",&t);
while(t--)
{
scanf("%d %d",&a,&n);
int l,r;
l=(int)pow( 10.0 , 2 + fmod(n*log10(a) , 1) );
while(l > 1000) l /= 10;
r = pow_mod(a,n);
printf("Case %d: %d %03d\n",cnt++,l,r);
}
return 0;
}