简单的组合问题啊
用总共的减去不会发生越狱的
快速幂维护一下复杂度就好啦
#include <cstdio>
#define MOD 100003
inline long long fast_power(long long a, long long b) {
long long ans = 1, y = a;
while(b != 0) {
if((b & 1) == 1) ans = ans * y % MOD;
y = y * y % MOD; b>>= 1;
}
return ans;
}
int main() {
long long m; long long n; scanf("%lld%lld", &m, &n);
long long a1 = m % MOD;
long long tot = fast_power(a1, n);
long long a2 = (m - 1) % MOD;
long long wct = fast_power(a2, n - 1);
wct = (long long)wct * a1; wct%= MOD;
long long ans = tot - wct;
while(ans < 0) ans+= MOD;
ans%= MOD;
printf("%d", ans);
return 0;
}