LightOj1282(n^k前三位)

求n^k的前三位和後三位

原博客

#include <cstdio>
#include <cmath>

long long pow_mod(long long a, long long b)
{
	long long ans = 1;
	while (b > 0)
	{
		if (b & 1) ans = ans * a % 1000;
		a = a * a % 1000;
		b /= 2;
	}
	return ans;
}

int main()
{
	int T,kase = 0;
	scanf("%d",&T);
	
	while (T--)
	{
		int n, k;
		scanf("%d%d",&n,&k);
		int ans1, ans2;
		ans1 = pow(10,fmod(log10(n)*k,1.0)+2);
		ans2 = pow_mod(n,k);
		printf("Case %d: %d %03d\n",++kase,ans1,ans2);
	}
	
	return 0;
}