Leading and Trailing LightOJ - 1282

求前导3位数与后导3位数

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll qpow(ll a,ll b)
{
	ll ans=1;
	ll base=a;
	while(b)
	{
		if(b&1)
		ans=ans%1000*base%1000,ans%=1000;
		base=base%1000*base%1000,base%=1000;
		b>>=1;
	}
	return ans%1000;
}
int main()
{
	ll t;
	scanf("%lld",&t);
	for(int k=1;k<=t;k++)
	{
		ll a,b;
		scanf("%lld%lld",&a,&b);
		ll s2=qpow(a,b);
		ll s1=pow(10,2+fmod(b*log10(a),1));
		printf("Case %d: %lld %03lld\n",k,s1,s2);
	}
}