原题
这题的思路很nb,暂时想不出来
#include<bits/stdc++.h>
using namespace std;
const int N = 1010, mod = 1e8 + 7;
int a, b, n, s;
int f[N][N];
int get(int a, int b){
return (a % b + b) % b;
}
int main()
{
cin>>n>>s>>a>>b;
f[0][0] = 1;
for(int i = 1; i < n; i ++ ){
for(int j = 0; j < n; j ++ ){
f[i][j] = (f[i - 1][get(j - a * (n - i), n)] + f[i - 1][get(j + b * (n - i), n)]) % mod;
}
}
cout<<f[n - 1][get(s, n)]<<endl;;
}