0分求调试qwq

#include<bits/stdc++.h>
#define int long long 
using namespace std;
int n,y,s,t;
struct str{
	int l,r;
}a[103];
bool check(int l,int r){
	if(r<y)  return true;
	if((r-y)%t==0)  return false;
	if((l>y && (l-y)%t==0) || l==y)  return false;
	return true;
}

signed main(){
	freopen("jealousy.in","r",stdin);
	freopen("jealousy.out","w",stdout);
	cin>>n>>y>>s>>t;
	for(int i=1;i<=n;i++){
		a[i].l=a[i-1].r;
		a[i].r=a[i].l+s;
	}
	for(int i=1;i<=n;i++){
		if(check(a[i].l,a[i].r)){
			printf("Yes");
			return 0;
		}
	}
	printf("No");
	return 0;
}