@[watergod](/user/809399) 加个取模就可以了
```cpp
#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]) % 1000000007;
}
cout << dp[n] << endl;
return 0;
}
```
by Albatross_LC @ 2024-04-25 21:20:42
下载一下数据吧
by shimucheng @ 2024-04-25 21:20:46
@[watergod](/user/809399) Where is mod $10^9+7$
by nightwatch_ryan @ 2024-04-25 21:42:47
oh 谢谢大佬 @[Albatross_LC](/user/742845) @[nightwatch_ryan](/user/961351)
by watergod @ 2024-04-25 22:21:34