描述:后三位用幂取模来做,前三位用log10来做
#include <cstdio>
#include <cmath>
int pow_mode(int n,int m)
{
if(m==1) return n;
int c=pow_mode(n,m/2);
int d=c*c%1000;
if(m%2==1) d=d*n%1000;
return d;
}
int main()
{
// freopen("a.txt","r",stdin);
int n,m,flag,t,v;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
double p=log10(n)*m;
flag=p;
p=p-flag;
p=pow(10,p)*100;
flag=p;
v=pow_mode(n%1000,m);
printf("%d...%03d\n",flag,v);
}
return 0;
}
11029 - Leading and Trailing
最新推荐文章于 2022-04-13 16:41:09 发布