結果
問題 | No.2527 H and W |
ユーザー |
|
提出日時 | 2023-11-03 22:08:59 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 115 ms / 2,000 ms |
コード長 | 3,563 bytes |
コンパイル時間 | 4,074 ms |
コンパイル使用メモリ | 250,848 KB |
最終ジャッジ日時 | 2025-02-17 18:23:30 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>#define SELECTER(_1,_2,_3,SELECT,...) SELECT#define rep1(i,n) for(int i=0;i<(int)n;++i)#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT#define rrep1(i,n) for(int i=(int)n-1;i>=0;--i)#define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i)#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)#define all(a) a.begin(),a.end()#define rall(a) a.rbegin(),a.rend()#define fi first#define se second#define PrintR LogOutput#ifdef _DEBUG#define Log(...) LogOutput(__VA_ARGS__)#else#define Log(...)#endifusing namespace std;using namespace atcoder;using ll=long long;using ld=long double;using pii=pair<int,int>;using pll=pair<long long,long long>;using pdd=pair<long double,long double>;using tp=tuple<int,int,int>;using tpll=tuple<ll,ll,ll>;using veci=vector<int>;using vecpii=vector<pair<int,int>>;using vecll=vector<long long>;using vecpll=vector<pair<long long,long long>>;using vecpdd=vector<pair<long double,long double>>;using vecs=vector<string>;using vecb=vector<bool>;using vecd=vector<long double>;using vectp=vector<tp>;using vectpll=vector<tpll>;using mint=modint998244353;using mint10=modint1000000007;template<typename T, typename S>istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}template<typename T, typename S>ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}ostream& operator<<(ostream& out, const mint& a){return out << a.val();}ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}ostream& operator<<(ostream& out, const modint& a){return out << a.val();}template<typename T>ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}template<typename T, typename S>pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}template<typename T, typename S>pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}constexpr ll INF=numeric_limits<ll>::max() / 4;constexpr ll MOD=998244353;const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};template<typename... Args>void LogOutput(Args&&... args){stringstream ss;((ss << args << ' '), ...);cout << ss.str().substr(0, ss.str().length() - 1) << endl;}template<typename T>void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}constexpr int _MAX = 2001000;mint fac[_MAX], inv[_MAX], finv[_MAX];void init(){const long long MOD = 998244353;int n = _MAX;fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;for(int i = 2;i<n;++i){fac[i] = fac[i-1] * i;inv[i] = MOD - inv[MOD % i] * (MOD / i);finv[i] = finv[i-1] * inv[i];}}mint comb(int n, int k){if(n < 0 || k < 0 || n < k) return 0;return fac[n] * finv[k] * finv[n-k];}int main(){ios::sync_with_stdio(false);std::cin.tie(nullptr);ll h, w, k;cin>>h>>w>>k;init();mint ans = 0;rep(i, h + 1){ll u = h * w - k - i * w;if(u < 0) break;if(u % (h - i) == 0) ans += comb(h, i) * comb(w, u / (h - i));}cout<<ans<<endl;}