結果
問題 | No.2527 H and W |
ユーザー |
👑 ![]() |
提出日時 | 2023-11-03 21:28:59 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 38 ms / 2,000 ms |
コード長 | 7,796 bytes |
コンパイル時間 | 990 ms |
コンパイル使用メモリ | 94,832 KB |
最終ジャッジ日時 | 2025-02-17 17:39:25 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
#ifdef NACHIA#define _GLIBCXX_DEBUG#else#define NDEBUG#endif#include <iostream>#include <string>#include <vector>#include <algorithm>#include <utility>#include <array>#include <atcoder/modint>#include <iterator>#include <functional>template<class Elem> struct vec;struct iotai;template<class Iter>struct seq_view{using Ref = typename std::iterator_traits<Iter>::reference;using Elem = typename std::iterator_traits<Iter>::value_type;Iter a, b;Iter begin() const { return a; }Iter end() const { return b; }int size() const { return (int)(b-a); }seq_view(Iter first, Iter last) : a(first), b(last) {}seq_view sort() const { std::sort(a, b); return *this; }Ref& operator[](int x){ return *(a+x); }template<class F = std::less<Elem>, class ret = vec<int>> ret sorti(F f = F()) const {ret x(iotai(0), iotai(size()));x().sort([&](int l, int r){ return f(a[l],a[r]); });return x;}template<class ret = vec<Elem>> ret col() const { return ret(begin(), end()); }template<class F = std::equal_to<Elem>, class ret = vec<std::pair<Elem, int>>>ret rle(F eq = F()) const {auto x = ret();for(auto& a : (*this)){if(x.size() == 0 || !eq(x[-1].first, a)) x.emp(a, 1); else x[-1].second++;} return x;}template<class F> seq_view sort(F f) const { std::sort(a, b, f); return *this; }Iter uni() const { return std::unique(a, b); }Iter lb(const Elem& x) const { return std::lower_bound(a, b, x); }Iter ub(const Elem& x) const { return std::upper_bound(a, b, x); }int lbi(const Elem& x) const { return lb(x) - a; }int ubi(const Elem& x) const { return ub(x) - a; }seq_view bound(const Elem& l, const Elem& r) const { return { lb(l), lb(r) }; }template<class F> Iter lb(const Elem& x, F f) const { return std::lower_bound(a, b, x, f); }template<class F> Iter ub(const Elem& x, F f) const { return std::upper_bound(a, b, x, f); }template<class F> Iter when_true_to_false(F f) const {if(a == b) return a;return std::lower_bound(a, b, *a,[&](const Elem& x, const Elem&){ return f(x); });}seq_view same(Elem x) const { return { lb(x), ub(x) }; }template<class F> auto map(F f) const {vec<typename Iter::value_type> r;for(auto& x : *this) r.emp(f(x));return r;}Iter max() const { return std::max_element(a, b); }Iter min() const { return std::min_element(a, b); }seq_view rev() const { std::reverse(a, b); return *this; }};struct iotai {using i64 = long long;using Me = iotai;using value_type = i64;using iterator_category = std::random_access_iterator_tag;using difference_type = ptrdiff_t;using pointer = i64*;using reference = i64&;i64 x;iotai(i64 y) : x(y) {}i64 operator*() const { return x; }std::size_t operator-(Me a) const { return x - a.x; }Me& operator++(){ ++x; return *this; }Me& operator--(){ --x; return *this; }Me operator++(int){ return { (i64)(x++) }; }Me operator--(int){ return { (i64)(x--) }; }Me operator+(std::size_t a) const { return { (i64)(x+a) }; }Me operator-(std::size_t a) const { return { (i64)(x-a) }; }Me& operator+=(std::size_t a){ x += a; return *this; }Me& operator-=(std::size_t a){ x -= a; return *this; }bool operator==(iotai r) const { return x == r.x; }static seq_view<iotai> range(i64 l, i64 r){ return { Me{l}, Me{r} }; }};template<class Elem>struct vec {using Base = typename std::vector<Elem>;using Iter = typename Base::iterator;using CIter = typename Base::const_iterator;using View = seq_view<Iter>;using CView = seq_view<CIter>;vec(){}explicit vec(int n, const Elem& value = Elem()) : a(0<n?n:0, value) {}template <class I2> vec(I2 first, I2 last) : a(first, last) {}vec(std::initializer_list<Elem> il) : a(std::move(il)) {}vec(Base b) : a(std::move(b)) {}operator Base() const { return a; }Iter begin(){ return a.begin(); }CIter begin() const { return a.begin(); }Iter end(){ return a.end(); }CIter end() const { return a.end(); }int size() const { return a.size(); }vec sortunied(){ vec x = *this; x().sort(); x.a.erase(x().uni(), x.end()); return x; }//Iter operator()(int x){ return (x < 0 ? a.end() : a.begin()) + x; }//CIter operator()(int x) const { return (x < 0 ? a.end() : a.begin()) + x; }Iter operator()(int x){ return a.begin() + x; }CIter operator()(int x) const { return a.begin() + x; }View operator()(int l, int r){ return { (*this)(l), (*this)(r) }; }CView operator()(int l, int r) const { return { (*this)(l), (*this)(r) }; }View operator()(){ return (*this)(0,size()); }CView operator()() const { return (*this)(0,size()); }Elem& operator[](int x){ return *((*this)(x)); }const Elem& operator[](int x) const { return *((*this)(x)); }Base& operator*(){ return a; }const Base& operator*() const { return a; }vec& push(Elem args){a.push_back(std::move(args));return *this;}template<class... Args>vec& emp(Args &&... args){a.emplace_back(std::forward<Args>(args) ...);return *this;}template<class Range>vec& app(Range& x){ for(auto& v : a) emp(v); }Elem pop(){Elem x = std::move(a.back());a.pop_back(); return x;}private: Base a;};template<class IStr, class T>IStr& operator>>(IStr& is, vec<T>& v){ for(auto& x:v){ is >> x; } return is; }namespace nachia{template<class Modint>class Comb{private:static constexpr int MOD = Modint::mod();std::vector<Modint> F;std::vector<Modint> iF;public:void extend(int newN){int prevN = (int)F.size() - 1;if(newN >= MOD) newN = MOD - 1;if(prevN >= newN) return;F.resize(newN+1);iF.resize(newN+1);for(int i=prevN+1; i<=newN; i++) F[i] = F[i-1] * Modint::raw(i);iF[newN] = F[newN].inv();for(int i=newN; i>prevN; i--) iF[i-1] = iF[i] * Modint::raw(i);}Comb(int n = 1){F.assign(2, Modint(1));iF.assign(2, Modint(1));extend(n);}Modint factorial(int n) const { return F[n]; }Modint invFactorial(int n) const { return iF[n]; }Modint invOf(int n) const { return iF[n] * F[n-1]; }Modint comb(int n, int r) const {if(n < 0 || n < r || r < 0) return Modint(0);return F[n] * iF[r] * iF[n-r];}Modint invComb(int n, int r) const {if(n < 0 || n < r || r < 0) return Modint(0);return iF[n] * F[r] * F[n-r];}Modint perm(int n, int r) const {if(n < 0 || n < r || r < 0) return Modint(0);return F[n] * iF[n-r];}Modint invPerm(int n, int r) const {if(n < 0 || n < r || r < 0) return Modint(0);return iF[n] * F[n-r];}Modint operator()(int n, int r) const { return comb(n,r); }};} // namespace nachiausing Modint = atcoder::static_modint<998244353>;using namespace std;using i64 = long long;using u64 = unsigned long long;#define rep(i,n) for(int i=0; i<(int)(n); i++)const i64 INF = 1001001001001001001;const char* yn(bool x){ return x ? "Yes" : "No"; }void testcase(){i64 H, W, K; cin >> H >> W >> K;auto comb = nachia::Comb<Modint>(H+W+1);Modint ans = 0;for(i64 h=1; h<=H; h++) if(K%h == 0 && K/h<=W){ans += comb(H, h) * comb(W, K/h);}cout << ans.val() << endl;}int main(){ios::sync_with_stdio(false); cin.tie(nullptr);#ifdef NACHIAint T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)#endiftestcase();return 0;}