TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k = int(input())
a, b = map(int, input().split())

if b%k == 0: 
  print(“OK”)
else:
  tmp = b//k
  tmp *= k
  if tmp>=a:
    print("OK")
  else:
    print("NG")

k = int(input())
a, b = map(int, input().split())

if b%k == 0: 
  print("OK")
else:
  tmp = b//k
  tmp *= k
  if tmp>=a:
    print("OK")
  else:
    print("NG")


Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())

A, B = map(int, input().split())

if A % K == 0 and B % K == 0:
    print('OK')
else:
    print('NG')

K = int(input())

A, B = map(int, input().split())

b = B % K
w = B - A

if w - b >= 0:
    print('OK')
else:
    print('NG')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k=int(input())
a,b=map(int, input().split())

for i in range(a,b+1):
    if i % k ==0:
        print('OK')
    else:
        print('NG')

k=int(input())
a,b=map(int, input().split())

for i in range(a,b+1):
    if i % k ==0:
        print('OK')
        break

print('NG')

k=int(input())
a,b=map(int,input().split())

if k % 7 == 0 and a <= k <= b:
    print('OK')
else:
    print('NG')


k=int(input())
a,b=map(int, input().split())

for i in range(a,b+1):
    if i % k ==0:
        print('OK')
        exit

print('NG')

k=int(input())
a,b=map(int, input().split())

for i in range(a,b+1):
    if i % k ==0:
        print('OK')
        exit(0)

print('NG')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
import math

A, B, N = map(int, input().split())

ans = 0
if N == max(A, B, N):
    ans = math.floor((A*N)/B)-A*(N//B)
else:
    if N <= 1000000:
        for x in range(1, N+1):
            tmp = math.floor((A*x)/B)-A*(x//B)
            ans = max(ans, tmp)
    else:
        for x in range(1, 300000):
            tmp = math.floor((A*x)/B)-A*(x//B)
            ans = max(ans, tmp)

        base = N//2-150000
        for x in range(base, base+300000):
            tmp = math.floor((A*x)/B)-A*(x//B)
            ans = max(ans, tmp)

        for x in range(N-300000, N+1):
            tmp = math.floor((A*x/B))-A*(x//B)
            ans = max(ans, tmp)
print(int(ans))


K = int(input())
A, B = map(int, input().split())

for i in range(A, B+1):
    if i % K == 0:
        print('OK')
        exit(0)
print('NG')


Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())
A, B = map(int, input().split())


i = 1
while K * i <= 1000:
  if A <= K * i and K * i <= B:
    print("Yes")
    exit()
  else:
    i+=1

print("NG")

K = int(input())
A, B = map(int, input().split())


i = 1
while K * i <= 1000:
  if A <= K * i and K * i <= B:
    print("OK")
    exit()
  else:
    i+=1

print("NG")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k = int(input())
a, b = map(int, input().split())

c = a % k
for i in range(a, b+1):
    if i % k == 0:
        print('OK')
        break
    else:
        print('NG')
        break

k = int(input())
a, b = map(int, input().split())

c = 0
for i in range(a, b+1):
    if i % k == 0:
        print('OK')
        c += 1
        break
if c == 0:
    print('NG')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k = int(input(''))
ab = input('')
a = int(ab.split(' ')[0])
b = int(ab.split(' ')[1])

ret=0
for i in range(a,b):
    print(i)
    if i % k == 0:
        ret=1
if a==b:
    if a%k==0:
        ret=1

if ret==0:
    print('NG')
else:
    print('OK')


k = int(input(''))
ab = input('')
a = int(ab.split(' ')[0])
b = int(ab.split(' ')[1])

ret=0
for i in range(a,b+1):
    if i % k == 0:
        ret=1

if ret==0:
    print('NG')
else:
    print('OK')


Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k = int(input())
a, b = map(int, input().split())

if b -a >= k and k < a
  print('OK')
else:
  print('NG')

counter = 0
x = int(input())
yokin = 100

while x > yokin:
  yokin = int(yokin * 1.01)
  counter += 1

print (counter)


k = int(input())
a, b = map(int, input().split())

for cnt in range(a, b + 1):
  if cnt % k == 0:
    print('OK')
    break
  elif cnt + 1 == b + 1:
    print('NG')

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
n=int(input())

a,b=[int(x) for x in input().split()]
flag=0
for i in range(a,b+1):
    if i%k==0:
        flag=1
        break
if flag==0:
    print("NG")
else:
    print("OK")

n=int(input())

a,b=[int(x) for x in input().split()]
flag=0
for i in range(a,b+1):
    if i%n==0:
        flag=1
        break
if flag==0:
    print("NG")
else:
    print("OK")

Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())
A, B = map(int, input().split())
if (B//K - A//K)>=1 or B%K == 0 or A%K == 0:
    print("yes")
else:
    print("no")

K = int(input())
A, B = map(int, input().split())
if (B//K - A//K)>=1 or B%K == 0 or A%K == 0:
    print("OK")
else:
    print("NG")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = input()
A, B = map(int, input().split())

result = False
for i in range(A, B + 1):
    if (i % K) == 0:
        result = True
print("OK" if result else "NG")

K = int(input())
A, B = map(int, input().split())

result = False
for i in range(A, B + 1):
    if (i % K) == 0:
        result = True
print("OK" if result else "NG")

Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())
A, B = map(int, input().split())

for n in range(A, B+1):
    if K % n == 0:
        print('OK')
        quit()

print('NG')

K = int(input())
A, B = map(int, input().split())

for n in range(A, B+1):
    if n % K == 0:
        print('OK')
        quit()

print('NG')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k = int(input())
a, b = map(int, input().split())
 
for i in (a, b + 1):
  if i % k == 0:
    break
print('OK' if i % k == 0 else 'NG')

k = int(input())
a, b = map(int, input().split())

for i in rage(a, b):
  if i % k == 0:
    print('OK')
  else:
    print('NG')

k = int(input())
a, b = map(int, input().split())

for i in (a, b):
  if i % k == 0:
    break
print('OK' if i % k == 0 else 'NG')

k = int(input())
a, b = map(int, input().split())

for i in range(a, b+1):
    if i % k == 0:
        print('OK')
        exit()
print('NG')

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
from math import *
k=int(input())
a=int(input())
b=int(input())
m=0
while a<=b :
    if a%k==0:
        m=1
        break
    a+=1
if m==1:
    print("OK")
else :
    print("NG")

from math import *
k=int(input())
a=int(input())
b=int(input())
m=0
while a<=b :
    if a%k==0:
        m=1
        break
    a=a+1
if m==1:
    print("OK")
else :
    print("NG")

from math import *
k=int(input())
a,b =map(int,input().split())
m=0
while a<=b :
    if a%k==0:
        m=1
        break
    a=a+1
if m==1:
    print("OK")
else :
    print("NG")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())
A, B = map(int, input().split())
for i in range(A,B):
  if K%i == 0:
    print("OK")
    exit()
print("NG")

K = int(input())
A, B = map(int, input().split())
for i in range(A,B+1):
  if K%i == 0:
    print("OK")
    exit()
print("NG")

K = int(input())
A, B = map(int, input().split())
for i in range(A,B+1):
  if i%K == 0:
    print("OK")
    exit()
print("NG")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
a = int(input())
b,c = map(int,input().split())
for i in range(b,c):
    if i % a == 0:
        print('OK')
    else:
        print('NG')

a = int(input())
b,c = map(int,input().split())
for i in range(b,c+1):
    if i % a == 0:
        print('OK')
        exit()
print('NG')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
import itertools

n, m, q = map(int, input().split())

nums = []
for _ in range(q):
    nums.append(list(map(int, input().split())))

total = 0

l = [1,2,3,4,5,6,7,8,9,10]
for v in itertools.combinations_with_replacement(l, n):
    scores = []
    for a,b,c,d in nums:
        if v[b-1]-v[a-1] == c:
            scores.append(d)
        else:
            scores.append(0)
    if total <= sum(scores):
        total = sum(scores)

print(total)


k = int(input())
a, b = map(int, input().split())

n = a//k
if a <= (n+1)*k <= b or a <= n * k <=b:
    print("OK")
else:
    print("NG")

Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k = int(input())
a, b = map(int, input().split())
for i in range(a, b+1):
    if i % k == 0:
        print("OK")
    else:
        print("NG")

k = int(input())
a, b = map(int, input().split())
for i in range(a, b + 1):
    if (i % k) == 0:
        print("OK")
        break
else:
    print("NG")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K=int(input())
A,B=map(int,input().split())

for i in range(A,B+1):
  if i%K==0:
    print("Yes")
    break
else:
  print("No")

K=int(input())
A,B=map(int,input().split())

for i in range(A,B+1):
  if i%K==0:
    print("OK")
    break
else:
  print("NG")


Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
A,B,N = map(int, input().split())

def f(a, b, n):
    fl1 = (a * (n + 1)) // b
    fl2 = (n + 1) // b
    fl = fl1 - (a * fl2)
    return fl
   #return int(a * n / b) - a * int(n / b)

print(f(A, B, B-1) if N >= B-1 else f(A, B, N))

K = int(input())
A,B = map(int, input().split())
C = K
count = 1
ans = "NG"

while (C<=B):
    #print("test")
    if(A<=C and C<=B):
        ans ="OK"
    C = K*count
    count += 1
    print(C)


print(ans)



K = int(input())
A,B = map(int, input().split())
C = K
count = 1
ans = "NG"

while (C<=B):
    #print("test")
    if(A<=C and C<=B):
        ans ="OK"
    C = K*count
    count += 1
    #print(C)


print(ans)


Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())
a,b = map(int,input().split())
if a - b >= K:
    print("OK")
elif a%K == 0 or b%K == 0:
    print("OK")
elif a%K > b%K:
    print("OK")
else:
    print("NG")

K = int(input())
a,b = map(int,input().split())
if a//K < b//K:
    print("OK")
elif a%K == 0 or b%K == 0:
    print("OK")
else:
    print("NG")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
import math
k = input()
s, t = [int(i)/k for i in input().split()]

if math.ceil(s) <= math.floor(t):
  print('OK')
else:
  print('NG')

import math
k = int(input())
s, t = [int(i)/k for i in input().split()]

if math.ceil(s) <= math.floor(t):
  print('OK')
else:
  print('NG')


Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
x = int(input())
money = 100
year = 0
while money < x:
    money += money / 100
    year += 1
print(year)

k = int(input())
a, b = map(int, input().split())

for i in range(a, b+1):
    if i % k == 0:
        print ('OK')
        exit(0)
print('NG')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K=int(input())
A,B=map(int,input().split())
a=A//K
b=B//K
def f(x):
    return x//1
if f(b)-f(a)>=1:
    print("OK")
if A//K==0:
    print("OK")
else:
    print("NG")


K=int(input())
A,B=map(int,input().split())
a=A//K
b=B//K
def f(x):
    return x//1
if f(b)-f(a)>=1:
    print("OK")
elif A%K==0:
    print("OK")
else:
    print("NG")


Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())
A, B = map(int,input().split())

for i in range(A,B+1):
    if i%K == 0:
        print("Yes")
        exit()
print("No")

K = int(input())
A, B = map(int,input().split())

for i in range(A,B+1):
    if i%K == 0:
        print("OK")
        exit()
print("NG")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
def solve(n, x, y):
  for i in range(x, y+1):
    if i % n == 0:
      return "OK"
    
  return "NG"


n = int(input())
a, b = list(map(int, input().split()))
solve(n, a, b)

def solve(n, x, y):
  for i in range(x, y+1):
    if i % n == 0:
      return "OK"

  return "NG"


n = int(input())
a, b = list(map(int, input().split()))
print(solve(n, a, b))

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k = int(input())
a, b = map(int, input().split())
for i in range(a, b+1):
  if i % k == 0:
    print("OK")
else:
  print("NG")


k = int(input())
a, b = map(int, input().split())
def ok_ng():
    for i in range(a, b+1):
        if i % k == 0:
            return "OK"
    else:
        return "NG"
print(ok_ng())


Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K=input()
A=input()
B=input()

for i in range(A,B,1):
    if (i %= K) == 0:
        print("OK")
    else:
        print("NG")


K=input()
A=input()
B=input()

for i in range(A,B,1):
  if (i %= K) == 0:
    print("OK")


K=input()
A=input()
B=input()

for i in range(A,B):
  i %= K
  if i==0:
    print("OK")


K=input()
A=input()
B=input()

for i in range(A,B):
  if (i %= K) ==0:
    print("OK")


K=int(input())
A,B=map(int,input().split())

for i in range(A,B,1):
    if (i % K) == 0:
        print("OK")
        break
print("NG")


K=input()
A=input()
B=input()

for i in range(A,B)
i %= K
if i==0:
  print("OK")

K=int(input())
A,B=map(int,input().split())

for i in range(A,B+1,1):
    if (i % K) == 0:
        print("OK")
        break
print("NG")


K=int(input())
A,B=map(int,input().split())

for i in range(A,B,1):
    if (i %= K) == 0:
        print("OK")
        break
print("NG")


K=input()
A=input()
B=input()

i %= K
for i in range(A,B): 
  if i==0:
    print("OK")


K=int(input())
A,B=map(int,input().split())

yn=0
for i in range(A,B+1,1):
    if (i % K) == 0:
        print("OK")
        yn=1
        break
if yn==0:
    print("NG")


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())
A, B = map(int, input().split())

for i in range(A, B+1):
    if i % K == 0:
        print('Yes')
        break
else:
    print('No')

K = int(input())
A, B = map(int, input().split())

for i in range(A, B+1):
    if i % K == 0:
        print('OK')
        break
else:
    print('NG')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k=int(input())
a,b=map(int,input().split())
for i in range(a,b+1):
  if i%k==0:
    print("OK")
    break
else:
  print("NG")
  break

k=int(input())
a,b=map(int,input().split())
for i in range(a,b+1):
  if i%k==0:
    print("OK")
    break
else:
  print("NG")
  

Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())
A, B = [int(i) for i in input().split()]

i = 0;
while K*i<=B:
    if K*i>=A:
        print("YES")
        exit()
    i=i+1
        
print("NG")


K = int(input())
A, B = [int(i) for i in input().split()]

i = 0;
while K*i<=B:
    if K*i>=A:
        print("OK")
        exit()
    i=i+1
        
print("NG")


Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
1
11 11

K = int(input())
A,B = map(int,input().split())
a = A// K
b = B // K
if a != b and a !=0 or A % K == 0 or B % K ==0:
    print('OK')
else:
    print('NG')


Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())
A, B = map(int,input().split())
 
D = A%K
U = B%K
if( U-D >= K):
 print("OK")
else :
 print("NG")

K = int(input())
A, B = map(int,input().split())

D = A/K
U = B/K
if(D-U >= 0):
 print("OK")
else :
 print("NG")


A, B, N = map(int,input().split())
if(B-A < N) :
 cal = int((A*N)/B) - A*int(N/B)
 print(cal)
else 
 max = 0
 i=N
 while(1):
  cal = int((A*i)/B) - A*int(i/B)
  if(cal > max):
   max =cal
  i += -1
  if(i < 0):
   print(max)
   break;

K = int(input())
A, B = map(int,input().split())
number = A
count = 0
while(1):
 if(number%K == 0):
  count +=1
 number += 1  
 if(number > B):
  if(count >0):
    print("OK")
  else:
    print("NG")
  break;

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())
A, B = tuple(map(int, input().split()))

a = A%K

if a==0 and K-a+A<=B:
  print("OK")
else:
  print("NG")


K = int(input())
A, B = tuple(map(int, input().split()))

a = A%K

if a==0 or K-a+A<=B:
  print("OK")
else:
  print("NG")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
import sys
K=int(input())
A,B=map(int,input().split())
for i in range(A,B+1):
    if i%K==0:
        print(i)
        print("OK")
        sys.exit()
print("NG")


import sys
import os
K=int(input())
A,B=map(int,input().split())
for i in range(A,B+1):
    if i%K==0:
        print(i)
        print("OK")
        sys.exit()
print("NG")

import sys
K=int(input())
A,B=map(int,input().split())
for i in range(A,B+1):
    if i%K==0:
        print("OK")
        sys.exit()
print("NG")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K= int(input())
A,B=map(int,input().split())

s= int(A/K)


if s*K==A:
  print("OK")

elif (s+1)*K>B:
  print("NG")
  
else:
  print("NG")



K= int(input())
A,B=map(int,input().split())

s= int(A/K)


if s*K==A:
  print("OK")

elif (s+1)*K>B:
  print("NG")
  
else:
  print("OK")



Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k=int(input())
a,b=map(int,input.split())
list=range(a,b+1)
for val in list:
  if val%k==0:
    print('OK')
    break
  else:
    print('NG')
    continue
    
  

k=int(input())
p=0
a,b=map(int,input().split())
list=list(range(a,b+1))
for val in list:
  if val%k==0:
    print('OK')
    p+=1
    break
  else:
    continue

if p==0:
  print('NG')

Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k = int(input())
a,b = map(int, input().split)
largest = (b//k)*k
print("OK" if largest >= a else "NG")

k = int(input())
a,b = map(int, input().split())
largest = (b//k)*k
print("OK" if largest >= a else "NG")

Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
#!/usr/bin/env python3

k = int(input())
a, b = list(map(int, input().split()))

if (b//k)*k >= a:
    print("Yes")
else:
    print("No")


#!/usr/bin/env python3

k = int(input())
a, b = list(map(int, input().split()))

if (b//k)*k >= a:
    print("OK")
else:
    print("NG")


Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())
A,B = [int(i) for i in input().split()]
flag=0
for i in range(1,1001):
  if(iK>=A and iK<=B):
    print("OK")
    flag=1
    break
if (flag==0):
  print("NG")

K = int(input())
A,B = [int(i) for i in input().split()]
flag=0
for i in range(1,1001):
    if(i*K>=A and i*K<=B):
        print("OK")
        flag=1
        break
if (flag==0):
    print("NG")

Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k = int(input())
a,b = map(int,input().split())
ans = "NG"
for i in range(a,b+1):
    if(i%k==0):
        ans = "YES"
        break
print(ans)    

k = int(input())
a,b = map(int,input().split())
ans = "NG"
for i in range(a,b+1):
    if(i%k==0):
        ans = "OK"
        break
print(ans)    


Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = input()
line = input().split(" ")
a = False
for i in range(int(line[0]), int(line[1])):
  if i%K==0:
    print("OK")
    a = True
  	break
if a == False:
  print("NG")    


K = input()
line = input().split(" ")
a = False
for i in range(int(line[0]), int(line[1]) + 1):
    if i%int(K)==0:
        print("OK")
        a = True
        break
if a == False:
    print("NG")   
  

Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
X = int(input())
Y = 100
count = 0
while int(Y) <= X:
    Y *= 1.01
    count += 1
print(count)

K = int(input())
[A, B] = list(map(int, input().split()))
for i in range(A, B + 1):
    X = i / K
    Y = i // K
    if X == Y:
        print('OK')
        break
else:
    print('NG')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k=int(input())
a,b=map(int,input().split())
x=0
for i in range(a,b+1):
    if i%k==0:
        print('OK')
        break
print('NG')

k=int(input())
a,b=map(int,input().split())
x=0
for i in range(a,b+1):
    if i%k==0:
        print('OK')
        exit()
print('NG')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
X=int(input())
n=0
m=100
while True:
    n+=1
    m+=m//100
    if m >=X:
        print(n)
        break


K =int(input())
A,B =map(int,input().split())
count ==0
for i in range(A,B+1):
    if i%K==0:
        print('OK')
        count =1
        break
if count ==0:   
    print('NG')

K =int(input())
A,B =map(int,input().split())
count ==0
for i in range(A,B+1):
    if i%K==0:
        print('OK')
        count =1
        break
 if count ==0:   
        print('NG')

X=int(input())
n=0
m=100
while True:
    n+=1
    m+= m//100
    if m >=X:
        print(n)
        break


K =int(input())
A,B =map(int,input().split())
count =0
for i in range(A,B+1):
    if i%K==0:
        print('OK')
        count =1
        break
if count ==0:   
    print('NG')

Verdicts: Wrong Answer

Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
s = input().split()
k=int(s[0])
s = input().split()
a=int(s[0])
b=int(s[1])
flag=0
for i in range(a,b+1):
    print(i)
    if i%k==0:
        flag=1
        break
if flag==0:
    print('NG')
else:
    print('OK')

s = input().split()
k=int(s[0])
s = input().split()
a=int(s[0])
b=int(s[1])
flag=0
for i in range(a,b+1):
    if i%k==0:
        flag=1
        break
if flag==0:
    print('NG')
else:
    print('OK')


Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
n = int(input())
a, b = map(int, input().split())
for i in range(a, b + 1):
	if(i % k == 0):
    	print('OK')
        exit()
print('NG')        

n = int(input())
a, b = map(int, input().split())
for i in range(a, b + 1, 1):
  if(i % n == 0):
    print('OK')
    exit()
print('NG')    

Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K=int(input())

A,B=list(map(int, input().split()))
i=0
for i in range(A,B+1):
    if i%K==0:
        print("Yes")
        i=1
if i==0:
    
    print("No")   

K=int(input())
 
A,B=list(map(int, input().split()))
i=0
for i in range(A,B+1):
    if i%K==0:
        print("Yes")
        i=1
        break
if i==0:
    
    print("No") 

import sys
K=int(input())

A,B=list(map(int, input().split()))

for i in range(A,B+1):
  if i%K==0:
    
    print("Yes")
    sys.exit()

print("No")

K=int(input())
 
A,B=list(map(int, input().split()))
n=0
for i in range(A,B+1):
    if i%K==0:
        print("OK")
        n=1
        break
if n==0:
    print("NG")

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
# -*- coding: utf-8 -*-

K = int(input())

A,B = map(int, input().split())

if A%K==0 or B%K==0 or A//K<B//K:
  print('Yes')
else:
  print('No')

# -*- coding: utf-8 -*-

K = int(input())

A,B = map(int, input().split())

if A%K==0 or B%K==0 or A//K<B//K:
  print('OK')
else:
  print('NG')


Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())
A, B = map(int, input())
c = 0

for i in range(A, B+1):
    if i % K == 0:
       c += 1
if c > 0:
    print("OK")
else:
    print("NG")

K = int(input())
A, B = map(int, input().split())
c = 0

for i in range(A, B+1):
    if i % K == 0:
       c += 1
if c > 0:
    print("OK")
else:
    print("NG")

Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
import sys
K = int(input())
A,B = map(int,input().split())
for i in range(A,B+1):
  if i // K == 0:
    print("OK")
    sys.exit()
    
print('NG')

import sys
K = int(input())
A,B = map(int,input().split())
for i in range(A,B+1):
  if i % K == 0:
    print("OK")
    sys.exit()
    
print('NG')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k = int(input())
a,b = map(int,input().split())

for i in range(a,b + 1):
  if i % k == 0:
    print('OK')
    break
  else:
    print('NG')


K = input()
A = input()
B = input()

i = 1
r = i * K
while r <= B:
  if r >= A:
    print('YES')
  elif r < A:
    i += 1
    r =  i * K
  else:
    print('NO')

k = int(input())
a,b = map(int,input().split())

for i in range(a,b + 1):
  if i % k == 0:
    print('YES')
  else:
    print('NO')

k = int(input())
a,b = map(int,input().split())

for i in range(a,b + 1):
  if i % k == 0:
    print('OK')
else:
  print('NG')


k = int(input())
a,b = map(int,input().split())

for i in range(a,b + 1):
  if i % k == 0:
    print('OK')
  else:
    print('NG')

k = int(input())
a,b = map(int,input().split())

for i in range(a,b + 1):
  if i % k == 0:
    print('OK')
    break
else:
  print('NG')


Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())
A,B = map(int,input().split())

for i in range(A,B+1):
    if i%K==0:
        print("OK")
        break
else:
print("NO")

K = int(input())
A,B = map(int,input().split())

for i in range(A,B+1):
    if i%K==0:
        print("OK")
        exit()
print("NG")

Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())
A,B= map(int,input().split())
if (B - A)/ K >= 1:
    print('OK')
if A == B and A%K ==0:
    print('OK')
else:
    print('NG')

K = int(input())
A,B = map(int,input().split())
c = 0
for i in range(A,B+1):
    if i%K == 0:
        c = c+1
if c >= 1:
    print('OK')
else:
    print('NG')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
# k=(int)(input())
import math
a,b,n=map(int,input().split())
if(n<=b):
    print(math.floor((a*n)/b))
else:
    print(math.floor((a*b-1)/b))


k = int(input())
a,b = map(int,input().split())
ans = 'NG'
for i in range(a,b+1):
    if i%k == 0:
        ans = 'OK'
        break
print(ans)

Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k=int(input())
a,b = map(int,input().split())
for i in range(a,b+1):
  if i%k == 0:
    print('OK')
  else:
    print('NG')

k=int(input())
a,b = map(int,input().split())
for i in range(a,b+1):
  if i%k == 0:
    break
if i%k == 0:
  print('OK')
else:
  print('NG')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
import math

X = int(input())
now_money=100
i = 0

while X > now_money:
    now_money += now_money *0.01
    now_money = math.floor(now_money)
    i += 1
print(i)


K = int(input())
A , B = list(map(int,input().split()))

for i in range(A , B+1):
    print(i)
    if ( i % K ) == 0 :
        print("OK")
        exit()
print("NG")


K = int(input())
A , B = list(map(int,input().split()))

for i in range(A , B+1):
    print(i)
    if ( i % K ) == 0 :
        print("OK")
        exit()
print("NG")

K=int(input())
A , B=map(int,input().split())

for i in range(A , B+1):
    if ( i % K ) == 0 :
        print("OK")
        exit()
print("NG")

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k = int(input())
a, b = map(int, input().split())

if b - a < k:
    print("NG")


k = int(input())
a, b = map(int, input().split())

for i in range(a, b+1):
    if i % k == 0:
        print("OK")
        exit()

print("NG")




Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K = int(input())
A,B=[int(i) for i in input().split(" ")]
if A%K == 0　or (A//K+1)*K <= B:
    print("OK")
else:
    print("NG")

K = int(input())
A,B=[int(i) for i in input().split(" ")]
if A%K == 0:
    print("OK")
elif (A//K+1)*K <= B:
    print("OK")
else:
    print("NG")

Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
n=int(input())
f=1
a,b=map(int,input().split())
for i in range(a,b+1):
  if i%n==0:
    print('yes')
    f=1
    break
if f==0:
  print('no)

n=int(input())
f=0
a,b=map(int,input().split())
for i in range(a,b+1):
  if i%n==0:
    print('OK')
    f=1
    break
if f==0:
  print('NG')


Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
import sys

input = sys.stdin.readline

N = int(input())
A,B = map(int,input().split())
red = B -A + 1
if N <= red:
    print('Yes')
else:
    print('No')

import sys

input = sys.stdin.readline

N = int(input())
A,B = map(int,input().split())
for i in range(A,B+1):
    if i%N == 0:
        print('Ok')
        exit()
print('No')

import sys

input = sys.stdin.readline

N = int(input())
A,B = map(int,input().split())
for i in range(A,B+1):
    if i%N == 0:
        print('OK')
        sys.exit(0)
print('NG')

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k=int(input())
a,b=map(int,input().split())

if a%k==0 or b%k==0:
  print("OK")
elif (a-b)==0 and k==1:
  print("OK")
elif (a-b)>=k:
  print("OK")
else:
  print("NG")

k = int(input())
a,b = map(int,input().split())
 
for i in range(a,b+1):
    if i%k == 0:
        print('OK')
        exit()
print('NG')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
k = int(input())
a, b = map(int, input().split())
for i in range(a, b+1):
    if (i % k) == 0:
        print("OK")
        break
    else:
        print("NG")
        break

k = int(input())
a, b = map(input().split())
for i in range(a, b):
    if i % k == 0:
        print("OK")
    else:
        print("NG")

k = int(input())
a, b = map(int, input().split())
for i in range(a, b+1):
    if i % k == 0:
        print("OK")
        break
    else:
        print("NG")
        break

k = int(input())
a, b = map(int, input().split())
re = False
for i in range(a, b+1):
    if (i % k) == 0:
        re = True
        break
if re == True:
    print("OK")
else:
    print("NG")

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
  k = int(input())
  a, b = map(int,input().split())
  for i in range(a, b):
    if i%k ==0:
      print('OK')
      return
    print('NG')
  return
 

k = int(input())
a, b = int(input())
if k <= b-a+1:
  print('Yes')
else:
  print('No')

k = int(input())
a, b = map(int,input().split())
if k <= b-a+1:
  print('Yes')
else:
  print('No')

def main():
  k = int(input())
  a, b = map(int,input().split())
  for i in range(a, b+1):
    if i%k ==0:
      print('OK')
      return
  print('NG')
  return
 
main()

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K=int(input())
A,B=map(int,input().split())

def judge():
  for x in range(A,B+1):
     if x%K==0:
        return 'Yes'
  return 'No'
  
print(judge())



K=int(input())
A,B=map(int,input().split())

def judge():
  for x in range(A,B+1):
     if x%K==0:
        return 'OK'
  return 'NG'
  
print(judge())



Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):
K=int(input())
A,B=map(int,input().split())
x=K
i=1
flg=False
while x<=B:
    if A<=x:flg=True;break
    i+=1
    x=K*i
if flg:print("Yes")
else: print("No")

import math
K=int(input())
A,B=map(int,input().split())
l=math.floor(B/K)*K
if l>=A: print("OK")
else: print("NG")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print `OK`; if he cannot, print `NG`.

Submission attempts (in order):

def main():
    k = int(input())
    a, b = map(int, input().split())
    for i in range(a, b+1):
        if i % k == 0:
            print('Yes')
            break


if __name__ == "__main__":
    main()



def main():
    k = int(input())
    a, b = map(int, input().split())
    flg = False
    for i in range(a, b+1):
        if i % k == 0:
            print('OK')
            flg = True
            break
    if not flg:
        print('NG')


if __name__ == "__main__":
    main()


Verdicts: Wrong Answer

Accepted