快速乘模板

Destination

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
#include<stack>
#include<string>
#include<cstdlib>
#include<queue>
#include<vector>
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define ll long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define fep(i,a,b) for(int i=(a);i>=(b);i--)
#define ms(a,b) memset(a,b,sizeof(a))
#define PI acos(-1)
#define lowbit(x) (x & (-x))
#define INF 0x3f3f3f3f
#define mod 100003
using namespace std;
const int N=1e6;
int m;
ll n;
ll qpow(ll x,ll n){
	ll ans=1;
	while(n){
		if(n&1)ans=ans*x%mod;
		x=x*x%mod;
		n>>=1;
	}
	return ans;
}
int main(){
	ios;
	cin>>m>>n;
	ll k=((qpow(m,n)%mod)-(m%mod*qpow((m-1),(n-1)))%mod+mod)%mod;
	cout<<k;
	return 0;
}

另一个也可以AC这道题的做法：

#include <bits/stdc++.h>
#define ll long long
#define chushi(a, b) memset(a, b, sizeof(a))
#define endl "\n"
const int maxn = 2e5+10;
using namespace std;
int main(){
ll a, b, p;
cin >> a >> b >> p;
__int128 A = a, B = b, P = p;
ll res = A * B % P;
cout << res << endl;
return 0;
}