Author: lllyouo
Date: 20250610
tag: 排列组合
link: https://www.luogu.com.cn/problem/P3197

问题描述

link

分析

略

参考代码

#include <bits/stdc++.h>
using namespace std;

const int MOD = 100003;
long long m, n;

long long qmi(long long a, long long b) {
	long long ans = 1;
	while (b) {
		if (b & 1) ans = ans * a % MOD;
		a = (long long)a * a % MOD;
		b >>= 1;
	}

	return ans % MOD;
}

int main() {
    cin >> m >> n;
    long long ans = (qmi(m, n) - m * qmi(m - 1, n - 1) % MOD + MOD) % MOD;
    cout << ans << endl;

    return 0;
}