Submission #40652643

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define fastio cin.tie(0)->sync_with_stdio(0)
#define fi first
#define se second
#define nm (nl + nr >> 1)
#define xm (xl + xr >> 1)
#define pb(x) push_back(x)
#define all(v) (v).begin(), (v).end()
#define zip(v) (v).erase(unique(all(v)), (v).end())
#define dem_plc(x) cout << fixed << setprecision(x)
#define ox(t) cout << ((t) ? "Yes" : "No") << '\n'
#define continue(x) { cout << (x) << '\n'; continue; }
#define _exit(x) return cout << x, 0
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<pii, int> ppi;
typedef pair<int, pii> pip;
typedef pair<pll, ll> ppl;
typedef pair<ll, pll> plp;
const ll mod = 998244353;
const ll INF = 2e9;
const ll LINF = 4e18;
const db PI = acos(-1);
const int N = 101;

int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

// templete end

ll _pow(ll x, ll y) {
	ll ret = 1;
	for(; y; x = x * x % mod, y >>= 1) if(y & 1) ret = ret * x % mod;
	return ret;
}

int n, p, q;
ll P, Q, dp[N][N], pd[N][N];

ll g(int a, int b);

ll f(int a, int b) {
    if(a >= n) return 1;
    if(b >= n) return 0;
    ll &ret = dp[a][b];
    if(ret >= 0) return ret;
    ll sum = 0;
    for(int i = 1; i <= p; i++) sum = (sum + g(a + i, b)) % mod;
    return ret = sum * P % mod;
}

ll g(int a, int b) {
    if(a >= n) return 1;
    if(b >= n) return 0;
    ll &ret = pd[a][b];
    if(ret >= 0) return ret;
    ll sum = 0;
    for(int i = 1; i <= q; i++) sum = (sum + f(a, b + i)) % mod;
    return ret = sum * Q % mod;
}

int main()
{
    fastio;
    memset(dp, -1, sizeof dp);
    memset(pd, -1, sizeof pd);
    int a, b; cin >> n >> a >> b >> p >> q;
    P = _pow(p, mod - 2), Q = _pow(q, mod - 2);
    cout << f(a, b) << '\n';
}

Submission Info

Judge Result