Submission #65624201

---

Source Code Expand

#include <bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using namespace atcoder;
#define all(a) a.begin(),a.end()
#define compress(a) sort(all(a));a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef modint998244353 mi;
typedef pair<ll,ll> P;
constexpr ll mod=998244353;
constexpr ll inf=3e18;

mi iii(mi n,mi h){
	mi sum_i0=h-2*n+1;
	mi sum_i1=sum_i0*(sum_i0+1)/2;
	mi sum_i2=sum_i0*(sum_i0+1)*(2*sum_i0+1)/6;
	mi sum_i3=sum_i1*sum_i1;
	mi c=h-2*n+2;
	return (sum_i3-(c+1)*sum_i2+(-c*c+2*c)*sum_i1+c*c*(c-1)*sum_i0)/2;
}
mi ii(mi x){
	return x*(x+1)*(x+2)*(x+3)/24;
}

mi bad(mi n,mi h,mi w){
	return ii(w-2*n)*ii(h-2*n);
}

mi X(mi n,mi h,mi w){
	return iii(n,h)*((w-2*n+2)*(w-2*n+1)/2)*((w-2*n+2)*(w-2*n+1)/2);
}

mi Z(mi n,mi h,mi w){
	return iii(n,h)*iii(n,w);
}

void solve(){
	ll n,h,w;
	cin>>n>>h>>w;
	if(h>w)swap(h,w);
	if(h<2*n){
		cout<<0<<endl;
		return;
	}
	mi ans=X(n,h,w)+X(n,w,h)-Z(n,h,w)-bad(n,h,w);
	cout<<ans.val()<<endl;
}

int main(){
	int t;
	cin>>t;
	rep(T,t)solve();
}

Submission Info

Judge Result