Submission #2846924

Source Code Expand

from fractions import gcd

def solve(a, b, c, d):
    if d < b: return False
    g = gcd(d, b)
    a, ar = divmod(a, g)
    c, cr = divmod(c, g)
    d /= g
    b /= g
    if ar > cr: c -= 1
    if a < b: return False
    return c >= b - 1

for cas in xrange(input()):
    print 'Yes' if solve(*map(int, raw_input().split())) else 'No'

Submission Info

Submission Time
Task B - rng_10s
User kevinsogo
Language Python (2.7.6)
Score 600
Code Size 350 Byte
Status AC
Exec Time 33 ms
Memory 4392 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 2
AC × 5
Set Name Test Cases
Sample example_0, example_1
All example_0, example_1, multi_0, multi_1, multi_2
Case Name Status Exec Time Memory
example_0 AC 33 ms 4392 KiB
example_1 AC 19 ms 4008 KiB
multi_0 AC 21 ms 4008 KiB
multi_1 AC 21 ms 4008 KiB
multi_2 AC 21 ms 4008 KiB