LightOJ 1282 Leading and Trailing（数学的简单变换，1 ms）

一、题目描述

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 位小于 100 时要在高位补 0，否则会 WA。

三、AC 代码（1 ms）

#include<cstdio>
#include<cmath>
#pragma warning(disable:4996)
unsigned long long n, k, l, t; double x; unsigned T;
template<class _Ty> inline _Ty PowerMod(_Ty radix, _Ty exp, const _Ty& mod) {
	_Ty ans = 1; radix %= mod;
	while (exp) {
		if (exp & 1)ans = (ans * radix) % mod;
		exp >>= 1, radix = (radix * radix) % mod;
	}
	return ans % mod;
}
int main() {
	scanf("%u", &T);
	for (unsigned i = 1; i <= T; ++i) {
		scanf("%llu%llu", &n, &k);
		t = PowerMod(n, k, 1000llu); x = k * log10(n); l = pow(10, x - floor(x) + 2);
		printf("Case %u: %llu %03llu\n", i, l, t);
	}
	return 0;
}