Light OJ-----1282对数快速幂

最新推荐文章于 2021-06-12 20:01:56 发布

pupil_blue

最新推荐文章于 2021-06-12 20:01:56 发布

阅读量331

点赞数

分类专栏：数学题/思维题快速幂与同余

本文链接：https://blog.csdn.net/blue_hpu/article/details/52294334

版权

数学题/思维题同时被 2 个专栏收录

60 篇文章 0 订阅

订阅专栏

快速幂与同余

6 篇文章 0 订阅

订阅专栏

Description

You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits ofn^k.

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 < 2³¹) andk (1 ≤ k ≤ 10⁷).

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 thatn^k contains at least six digits.

Sample Input

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（k*log10（n）），log可以很快求出来，最终转化为求10的次方取前三位数

用pow函数，前三位的数只与k*log10（n）这个值的小数部分有关

还有后三位不一定满三位补出前导0

#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<cmath>
#define inf 0x3f3f3f3f
#define mes(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int maxn = 1e6+10;
LL solve(LL a, LL b){
	LL ans = 1;
	while(b){
		if(b & 1){
			ans = ans*a%1000;
		}
		b >>= 1;
		a = a*a%1000;
	}
	return ans;
}
int main(){
	int t, ans, kcase = 1;
	LL n, b;
    scanf("%d", &t);
    while(t--){
    	scanf("%lld%lld", &n, &b);
    	double c = b*log10(n+0.0);
    	c -= LL(c);
    	ans = (int)pow(10.0, c+2);
    	printf("Case %d: %d %03d\n", kcase++, ans, solve(n, b));
    }
    return 0;
}