Submission #20391448

---

Source Code Expand

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<bitset>
#include<deque>
#define mod  998244353
#include<cstdlib>
#include<set>
#include<ctime>
#define ll long long
#define mp make_pair
using namespace std;
ll read()
{
	ll x=0,f=1;
	char c=getchar();
	while(c>'9'||c<'0')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+c-'0';
		c=getchar();
	}
	return f*x;
}
ll pow_mod(ll a,int b)
{
	ll ans=1;
	while(b)
	{
		if(b&1) ans=ans*a%mod;
		b>>=1;
		a=a*a%mod; 
	}
	return ans;
}
int n,m,k;
ll ans;
int main()
{
	n=read(),m=read(),k=read();
	if(n==1||m==1)
	{
		if(n<m) swap(n,m);
		cout<<pow_mod(k,n)<<'\n';
		return 0;
	}
	for(int i=1;i<=k;++i)
	{
		ll tn=(pow_mod(i,n)-pow_mod(i-1,n)+mod)%mod;
		ll tm=pow_mod(k-i+1,m);
		ans=(ans+tn*tm%mod)%mod;
	}
	cout<<ans<<'\n';
	return 0;
 }

Submission Info

Judge Result