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;求出n的k次方,并把所得结果的前三位和后三位分离出来。
题解:快速幂+对数函数的一些性质。
注意:任何一个数都可以写成10的N次方。N有可能是一个小数。对于一个数想要分离出后三位需要对其结果对1000取余即可。而对于求前三位时需要对其使用对数函数。10的零点几次方肯定是大于1的。
//任何一个数都可以用10的n次方来表示
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<math.h>
#include<algorithm>
using namespace std;
long long quick(long long a,long long b)
{
long long ans=1;
while(b>0)
{
if(b%2==1)
ans=ans*a%1000;
a=a*a%1000;
b=b/2;
}
return ans;
}
int main()
{
int t,o=1;
long long n,k;
scanf("%d",&t);
while(t--)
{
double w;
scanf("%lld%lld",&n,&k);
w=k*log10(n);
w=w-(long long)w;//表示小数部分
long long ans1=(long long)(pow(10,w)*100);//强制转换
//printf("%lld\n",ans1);
//printf("%lld\n",quick(n,k));
printf("Case %d: %lld %03lld\n",o++,ans1,quick(n,k));//03--
}
return 0;
}