Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int w, p;
- int a, b;
- int dp[1000001];
- long dfs(int cur){
- if(cur<p) return 0;
- //cout << cur << '\n';
- if(cur==p){
- //cout << "---" << '\n';
- return 1;
- }
- if(dp[cur]>0){
- //cout << "HI" << ", dp[cur]: " << dp[cur] << '\n';
- //cout << "===" << '\n';
- return dp[cur];
- }
- dp[cur] = dfs(cur-a)+dfs(cur-b);
- return dp[cur];
- }
- int main(){
- //freopen("auction.in", "r", stdin);
- cin >> w >> p;
- cin >> a >> b;
- dfs(w);
- cout << dp[w] << '\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
