如题，80 pts，WA on #4.

#include<bits/stdc++.h>
using namespace std;

long long n,a,b,c;
long long f,t;
long long dp[100000001];
 
int main(){
	cin >> n >> a >> b >> c;
	if(n == c){
		cout << 1 << endl;
		return 0;
	}
	for(int i=0;i<=c;i++){
		dp[i] = 1;
	}
	for(int i=c+1;i<=n;++i){
		f = i-a;
		t = i-b;
		if(f<0){
			f = 0;
		}
		if(t<0){
			t = 0;
		}
		dp[i] = dp[t] + dp[f];
	}
	cout << dp[n] << endl;
	return 0;
}