Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- using lli = long long;
- lli GCD(lli a, lli b){
- if(a < b) swap(a, b);
- lli r = a;
- while(r > 0){
- r = a % b;
- a = b;
- b = r;
- }
- return a;
- }
- int main(){
- int Q;
- scanf("%d", &Q);
- for(int q=1;q<=Q;q++){
- lli n, k, c, p;
- scanf("%lld%lld%lld%lld", &n, &k, &c, &p);
- lli gcd = GCD(k, c);
- lli lcm = (k * c / gcd);
- if((lcm / c) * p <= n) printf("Yes");
- else printf("No");
- printf("\n");
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement