#define LL long long
#define Mod 1000;//题面给Mod;
LL pow(LL a,LL b)
{
LL res = 1;
LL base = a;
while (b)
{
if (b & 1) res = res * base%Mod;
base = base * base%Mod;
b >>= 1;
}
return res;
}
#define Mod 1000;//题面给Mod;
LL pow(LL a,LL b)
{
LL res = 1;
LL base = a;
while (b)
{
if (b & 1) res = res * base%Mod;
base = base * base%Mod;
b >>= 1;
}
return res;
}
20万+

被折叠的 条评论
为什么被折叠?



