MLE*2
查看原帖
MLE*2
773533
FXHai楼主2024/8/4 19:32
#include<iostream>
#include<queue>
using namespace std;
long long n,a,b,c,sum=0;
queue<int>q;
int main(){
	cin>>n>>a>>b>>c;
	q.push(n);
	while(!q.empty()){
		n=q.front();
		q.pop();
		if(n<=c){
			sum++;
			continue;
		}
		q.push(n-a);
		q.push(n-b);
	}
	cout<<sum%1000000007;
}
2024/8/4 19:32
加载中...