希望更丰富的展现？使用Markdown
by Itst @ 2018-10-04 19:26:44
```cpp
// luogu-judger-enable-o2
#include<cstdio>
using namespace std;
const int mod=100003;
long long m,n;
long long qui(long long a,long long b)
{
long long s=1,x=a;
while(b>0)
{
if(b&1)
{
x%=mod;
s=s*x%mod;
}
x=x*x%mod;
b>>=1;
}
return s;
}
inline int read()
{
char ch;
long long res;
while((ch=getchar())<'0'||ch>'9');
res=ch-'0';
while((ch=getchar())>='0'&&ch<='9')
res=res*10+ch-'0';
return res;
}
int main()
{
m=read();
n=read();
printf("%lld",((qui(m,n)-(m*qui(m-1,n-1)%mod)+mod)%mod));
}
```
by 啼笑皆非 @ 2018-10-04 19:28:58
第一次发讨论，被格式秀了QwQ
by 啼笑皆非 @ 2018-10-04 19:29:34
前排围观QWQ
by _ALIVE_LYY @ 2018-10-04 19:30:11
希望更丰富的展现？使用Markdown
by _ALIVE_LYY @ 2018-10-04 19:32:00
把读入优化去掉。
by _GTBA_ @ 2018-10-14 08:02:47
# inline int read()改成inline long long read()
by Froggy @ 2019-01-06 10:36:15
@[一钩残照](/space/show?uid=48401)
by Froggy @ 2019-01-06 10:36:26
@[Froggy](/user/100285) 多谢QwQ
by 啼笑皆非 @ 2019-11-12 10:40:43
是怎么做到隔了 10 个月才回来答复的 ……
by 一只书虫仔 @ 2020-05-03 11:22:01