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())

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

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
def equation(a,b,n):
  return math.floor((a*n)/b)-a*math.floor(n/b)
d,e,f = map(int,input().split())
K = min(e-1,f)
print(equation(K))


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

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

for i in range(A,B+1):

  if i%K == 0:
    flag += 1
    print("OK")
    break
if flag == 0:
  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):
K = int(input())
A,B = map(int,input().split())
ans = 'NG'
if A % K == 0:
    ans = 'OK'
elif B % K == 0:
    ans = 'OK'
x = A // K
y = A // K
if y > x:
    ans = 'OK'
print(ans)

K = int(input())
A,B = map(int,input().split())
ans = 'NG'
if A % K == 0:
    ans = 'OK'
elif B % K == 0:
    ans = 'OK'
x = A // K
y = B // K
if y > x:
    ans = 'OK'
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):
a=int(input())
b,c=map(int,input().split())

flag=False
for i in range(a,b+1):
   if i%a==0:
   flag=True
   break
print("OK" if flag else "NG")
  
  




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

flag=False
for i in range(b,c+1):
   if i%a==0:
    flag=True
    break
print("OK" if flag 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 i in range(a, b+1):
    if i % k == 0:
      print('OK')
      break
    else:
      print("NG")

k = int(input())
a,b = map(int, input().split())
c = b-a
for i in range(c, b+1):
    if i % k == 0:
      print('OK')
      break
    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

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(j) for j in input().split()]
flag=0
for j in range(1,1001):
    if(jK>=A and jK<=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

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())

q, r = divmod(a, k)
Q, R = divmod(b, k)

if q > Q:
    print('OK')
else:
    if r == 0:
        print('OK')
    else:
        print('NG')


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

q, r = divmod(a, k)
Q, R = divmod(b, k)

if q < Q:
    print('OK')
else:
    if r == 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())
if b//k*k>=a:
  print('Yes')
else:
  print('No')
  

k=int(input())
a,b=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=map(int,input().split())

if A%K==0 or B%K==0:
    print("OK")
    exit()
else:
    a=A//K
    if A*(a+1)<=B:
        print("OK")
    else:
        print("NG")


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

if A%K==0 or B%K==0:
    print("OK")
    exit()
else:
    a=A//K
    if K*(a+1)<=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):
k = int(input())
a,b = map(int, input().split())
flag = 0
for i in range(a,b+1):
  if i % k == 0:
    flag = 1
    break
if flag = 1:
  print('OK')
else:
  print('NG')

k = int(input())
a,b = map(int, input().split())
flag = 0
for i in range(a,b+1):
  if i % k == 0:
    flag = 1
    break
if flag == 1:
  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):
  print(i)
  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):
a, b, n = map(int, input().split(" "))

max_score = 0
y = b // a

for x in range(max(y - 1000000, 1) , min(y + 2000000, n+1)):
    score = a * x // b - a * ( x // b )
    if score > max_score:
        max_score = score
print(max_score)


x = int(input())
p, q = map(int, input().split())

ok = 0
for i in range(p, q+1):
    if i % x == 0:
        ok += 1
        break
if ok == 1:
    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):
A,B,N = map(int,input().split())
a = 0

for x in range(N+1):
    if (int((A*x)/B)-A*int(x/B)) > a:
        a = (int((A*x)/B)-A*int(x/B))
print(a) 

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

n = range(A,B+1)
ind = range(B-A)
for i in n:
    list.append(i)
counter = 0

for i in ind:
    if list[i]%K == 0:
        counter += 1
    else:
        counter += 0
if counter > 0:
    print("OK")
else:
    print("NG")
        
    

K = int(input())
A,B = map(int,input().split())
list = []
n = range(A,B+1)
ind = range(B-A+1)
for i in n:
    list.append(i)
counter = 0

for i in ind:
    if list[i] % K == 0:
        counter += 1
    else:
        counter += 0
if counter >= 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=input()
a,b = map(int,input().split())

for i in range(a,b):
  if i%k == 0:
    print("OK")
    break
  if i%k!=0 and i == b:
    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 > 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):
goal=int(input())
list=input().split(" ")
max=int(list[0])
min=int(list[1])
if(max-min>=goal):
    print("OK")
else:
    print("NG")

goal=int(input())
list=input().split(" ")
max=int(list[0])
min=int(list[1])
if(max-min>goal):
    print("OK")
else:
    print("NG")

goal=int(input())
list=input().split(" ")
max=int(list[1])
min=int(list[0])
flag=0
for i in range(min,max+1):
    if i%goal==0:
        flag=1;

if flag==0:
    print("NG")
else:
    print("OK")

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 = input()
a, b = list(map(int, input().split()))
isYes = False
for i in range(a, b+1):
    if i % k == 0:
        isYes = True
        break
print('OK' if isYes else 'NG')

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

k = int(input())
a, b = list(map(int, input().split()))
isYes = False
for i in range(a, b+1):
    if i % k == 0:
        isYes = True
        break
print('OK' if isYes else '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())

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

print("OK") if flag else print("NG")

k = int(input())
a, b = map(int, input().split())
 
flag = False
for i in range(a, b+1):
    if i % k == 0:
        flag = True
 
print("OK") if flag 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())

flag = False
for i in range(a, b + 1):
    if i // k > 0 ans i % k == 0:
        flag = True
        
if flag:
    print('OK')
else:
    print('NG')

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

flag = False
for i in range(a, b + 1):
    if i % k == 0:
        flag = True
        
if flag:
    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):
A,B,N=map(int,input().split())
if N>=B:
    print(int(A*(B-1)/B)-A*int((B-1)/B))
else:
    print(int(A*N/B)-A*int(N/B))

K=int(input())
A,B=map(int,input().split())
a=0
for i in range(A,B+1):
    if i%K==0:
        a=1
        print("OK")
        break
if a!=1:
    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())
b=0

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

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

for i in range(A,B+1):
    if i%K==0:
        b+=1
        
if 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):
from math import floor,ceil
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
print(int(floor(a*c/b)-a*floor(c/b)))


from math import floor,ceil
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
print(int(floor(a*c/b)-a*floor(c/b)))


from math import floor,ceil
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
print(ceil(ceil(a*c/b)-a*floor(c/b)))


from math import floor,ceil
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
print(floor(floor(a*c/b)-a*floor(c/b)))


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

Verdicts: Runtime Error

Runtime Error

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):
s = input(input())
a, b = map(int, input())

a_1 = a / s
b_1 = b / s

if b_1 - a_1 > 1 :
    print('OK')
else :
    print('NG')

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

a_1 = a % k
b_1 = b % k

if a % k == 0 :
    print('OK')
elif b_1 > a_1  :
    print('NG')
else :
    print('OK')

import math as M
k = int(input())
a, b = map(int, input().split())

a_1 = M.floor(a % k)
b_1 =  M.floor(b % k)

if a % k == 0 :
    print('OK')
elif b / k < 1 :
    print('NG')
elif b_1 - a_1 > 1 :
    print('NG')
else :
    print('OK')

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

a_1 = a / s
b_1 = b / s

if b_1 - a_1 > 1 :
    print('OK')
else :
    print('NG')

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

a_1 = A[0] / s
b_1 = A[1] / s

if b_1 - a_1 > 1 :
    print('OK')
else :
    print('NG')

import math as M
k = int(input())
a, b = map(int, input().split())

a_1 = M.floor(a % k)
b_1 =  M.floor(b % k)

if a % k == 0 :
    print('OK')
elif b_1 - a_1 > 1 :
    print('NG')
else :
    print('OK')

import math as M
k = int(input())
a, b = map(int, input().split())

a_1 = M.floor(a/k)
b_1 = M.floor(b/k)

if a%k == 0 or b%k == 0:
    print('OK')
elif b_1 - a_1 < 1:
    print('NG')

else :
    print('OK')

Verdicts: Runtime Error

Wrong Answer

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):
K = int(input())
A = int(input())
B = int(input())
if B-A > K:
    print('OK')
else:
    print('NG')

K = int(input())
k = K
A,B = map(int, input().split())
for i in range(1, B+1):
    k *= i
    if k > a and k < b:
        print('OK')
        a = True
        break
if not a:
    print('NG')


K = int(input())
A,B = map(int, input().split())
count = 0
while True:
    count += 1
    k = K * count
    if k >= A and k <= B:
        print('Yes')
        a = True
        break
    else:
        a = False
        continue
if K > B:
    a = False
if a != True:
    print('NG')

K = int(input())
k = K
A,B = map(int, input().split())
for i in range(1, B+1):
    k *= i
    if k >= A and k <= B:
        print('OK')
        a = True
        break
    else:
        k = K
        a = False
        continue
if a != True:
    print('NG')

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):
a,b = map(int,input().split())
if 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:
    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):
A, B, N = map(int, input().split())
if N < B:
    print(A*N//B)
else:
    l = [(A*i//B)-(A*(i//B)) for i in range(abs(N-5), N+1)]
    print(max(l))

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')
        break

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

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())
ans = 0
for i in range(a//k,b//k+1):
  if a <= k * i <= b:
    ans = 1
if ans = 1:
  print('OK')
else:
  print('NG')

k = int(input())
a,b = map(int,input().split())
ans = 0
for i in range(a//k,b//k+1):
  if a <= k * i <= b:
    ans = 1
if ans == 1:
  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 math


#    return now_year
#  else:


goal = int(input())
depo = 100
#print(getTotal(depo, 0, goal))
now_year = 0
while (True):
  depo = math.floor(depo * 1.01)
  now_year += 1
  if(depo >= goal):
    print(now_year)
    break

target_multi = int(input())
(min, max) = tuple(map(int, input().split(' ')))


is_ok = False
for i in range(min, max + 1):
  if(i % target_multi == 0):
    print("OK")
    is_ok = True
    break

if not(is_ok):
  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())
a = 100
i = 0
while a <= x:
  i += 1
  a = int(a * 1.01)
print(i)

k = int(input())
a, b = input().split()
a = int(a)
b = int(b)
if a - a % k + k <= b or 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
a,b,n=(int(x) for x in input().split())
k =0
for x in range(0,n+1):
    c = math.floor((a*x)/b)-a*math.floor(x/b)
    if c  > k:
        k = c
print(k)

k = int(input().strip())
a, b = input().strip().split()
a = int(a)
b = int(b)
c = 0
for i in range(1,1001):
    if i*k <= b and i*k >= a:
        print("OK")
        c = 1
        break
if c == 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):
X=int(input())
year=0
deposit=100
while deposit<X:
    deposit=deposit*101//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")
        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(!, 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()
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())
c=abs(a-b)+1
flag=0
for i in range(c):
    if i%k==0:
        print("OK")
        flag=1
        exit
if flag==0:
    print("NG")

k=int(input())
a,b=map(int,input().split())
flag=0
for i in range(a,b+1):
    if i%k==0:
        print("OK")
        flag=1
        break
if flag==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())
for i in range(A,B):
  if (i%K) == 0:
    print("OK")
  else:
    print("NG")

K = int(input())
A, B = map(int, input().split())
i = (B//K)
if (i*K) < A:
  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 = list(map(int, input().split()))

N = (B // K)  * K
if (A <= N):
  print(‘OK’)
else:
  print(‘NG’)

K = int(input())
A, B = list(map(int, input().split()))
 
N = (B // K)  * K
if (A <= N):
  print(‘OK’)
else:
  print(‘NG’)

K = int(input())
A, B = list(map(int, input().split()))
 
N = (B // K)  * K
if (A <= N):
  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):
def mapint_inp():
    return map(int, input().split())

def intinp():
    return int(input())

K = intinp()
A, B = mapint_inp()

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

def mapint_inp():
    return map(int, input().split())

def intinp():
    return int(input())

K = intinp()
A, B = mapint_inp()

ans = False
for i in range(A, B+1):
    if i%K == 0:
        ans = True
    
if ans:
    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):
a,b,n = map(int,input().split())


max=0
for x in range(n+1):
    value=(a*x//b)-a*(x//b)
    if value>max:
        max=value
print(max)


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

print(judge(k,a,b))


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())
a,b = input().split()
a = int(a)
b = int(b)
for i in range(a, b+1):
  print(i)
  if i%n == 0:
    print("OK")
    exit()
print("NG")

n = int(input())
a,b = input().split()
a = int(a)
b = int(b)
for i in range(a, b+1):
  if i%n == 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):
n = int(input())
a, b = map(int, input().split())

flg = 0
while n < b:
    n += n
    if a <= n <= b:
        print('OK')
        flg = 1
        break
if flg == 0:
    print('NG')

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

i = 0
flg = 0
while i <= b:
    i += n
    if a <= i <= b:
        print('OK')
        flg = 1
        break
if flg == 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):
def main(k, a, b):
    for n in range(a, b + 1):
        if k % n == 0:
            return 'OK'
    else:
        return 'NG'


if __name__ == '__main__':
    k = int(input())
    a, b = map(int, input().split(' '))
    print(main(k, a, b))


K = int(input())
A, B = 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 = map(int,input().split())

ans = 0

for i in range(a,b+1):
    print(i)
    if i%7 == 0:
        ans += 1
if ans > 0:  
    print("OK")
else:
    print("NG")
    

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

ans = 0

for i in range(a,b+1):
    if i%k == 0:
        ans += 1
if ans > 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())

if(A<=int(A/K)*K<=B):
    print("OK")
else:
    print("NG")

import math

K = int(input())
A, B = map(int, input().split())
if(int(B/K)-math.ceil(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())

if B // K < A // K :
    print('OK')
else :
    print('NG')

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

if A % K == 0:
    print('OK')
else:
    m = A // K
    if (m + 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):
x = int(input())

y = 100
n = 0
while y < x:
    n += 1
    y += y // 100
print(n)


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

flg = False
for i in range(a, b+1):
    if i % k == 0:
        flg = True
        break
print('OK') if flg 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())
cnt = 0
while true:
  cnt+=K
  if a <= cnt <= b:
    print("OK")
    break
  if b < cnt:
    print("NG")
    break

K = int(input())
A, B = map(int, input().split())
cnt = 0
while 1:
  cnt+=K
  if A <= cnt <= B:
    print("OK")
    break
  if B < cnt:
    print("NG")
    break

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")
    exit()
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()
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):
_input = input()
k = _input.split()[0]
a = _input.split()[1].split(" ")[0]
b = _input.split()[1].split(" ")[1]

for i in range(1, 1000):
  if a<= (i* k) <= b:
    print("OK")
    break
  elif (i* k) > b:
    break
    print("NG")




k = int(input())
a_b = input().split()[1].split(" ")
a = int(a_b.split(" ")[0])
b = int(a_b.split(" ")[1])

for i in range(1, 1000):
  if a<= (i* k) <= b:
    print("OK")
    break
  elif (i* k) > b:
    print("NG")
    break
else:
    print("NG")


k = int(input())
a_b = input()
a = int(a_b.split(" ")[0])
b = int(a_b.split(" ")[1])

for i in range(1, 1000):
  if a<= (i* k) <= b:
    print("OK")
    break
  elif (i* k) > b:
    print("NG")
    break
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):
# -*- coding: utf-8 -*-

k = int(input())

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

d = a % k
e = a - d

if (a + e) <= b:
    print('OK')
else:
    print('NG')


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

k = int(input())

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

d = a % k
e = k - d

if (a % k == 0) or ((a + e) <= 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 math
from decimal import Decimal
a = int(input())
o = 100
c = 0 
while True:
  o = math.floor(o * 1.01)
  c = Decimal(c + 1)
  if o >= a:
    print(c)
    break
  


k = int(input())
a,b = map(int, input())
print('OK') if b-a+1 >= k else print('NG')

k = int(input())
a,b = map(int, input().split())
print('OK') if (a%k ==0 or (b//k)-(a//k) >= 1) else print('NG')


Verdicts: 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 = map(int, input().split())
for i in range(a,b+1):
  if i % k == 0:
    print("OK")
  elif i == b:
    print("NG")
    break

k = int(input())
a,b = map(int, inupt().split())
for i in range(a,b+1):
  if i % k == 0:
    print("OK")
  elif i == b:
    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
  elif i == b:
    print("NG")
    break

Verdicts: 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 = map(int, input().split())
if K=1:
    print("OK")
elif B-A>=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: 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')
        exit()
print('No')

K = int(input())
A, B = map(int,input().split())
for i in range(A,B+1):
    if i % K == 0:
        print('Yes')
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

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):
a,b,n = map(int, input().split())
#1 <= x <= n
#minimize  int(x/b)
#x = int(a*x/b) - a * int(x/b)

print((a*n)//b)

k =int(input())
a,b = map(int, input().split())
c = b//k
 
if b%k==0:
  print("OK")
elif k*c >=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())
ans = "No"
for val in range(A, B + 1):
    if val % K == 0:
        ans = "Yes"
        break
print(ans)

K = int(input())
A, B = map(int, input().split())
ans = "NG"
for val in range(A, B + 1):
    if val % 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 = int(input())
a, b = map(int, input().split())
x = 0
  
while True:
  x += k
  
  if a <= x <= b:
    print('OK')
	break
  
  if x > b:
    print('NO')
    break

k = int(input())
a, b = map(int, input().split())
x = 0
  
while True:
  x += k
  
  if a <= x <= b:
    print('OK')
    break
  
  if x > b:
    print('NG')
    break

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())

max = int(b/k)

for i in range(1,max+1):
    tmp = k * i
    if a <= tmp and b >= tmp:
        print('Yes')
        exit()

print('No')

import math
a,b,n=map(int, input().split()) 
max = -10000
tmp = 0

for i in range(1, n+1):
    tmp = math.floor(a * i / b) - math.floor(i / b)
    if max < tmp:
        max = tmp

print(max)

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

max = int(b/k)

for i in range(1,max+1):
    tmp = k * i
    if a <= tmp and b >= tmp:
        print('OK')
        exit()

print('NG')

Verdicts: 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):

n=int(input())
m,t=map(int,input().split())
if n<=t-m:
  print('OK')
else:
  print('NG')
elif n==1:
  print('OK')
  
    

i=int(input())
n,m=map(int,input().split())
s=[]
if n%i==0:
  print('OK')
elif m%i==0:
  print('OK')
else:
  for j in range(n,m+1):
    if j%i==0:
      s.append(j)
  if len(s)>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())
for i in range(A,B+1):
  if(i%K==0):
    print("ok")
    break
  if(i==B and i%K !=0)
    print("NG")
  
 


K=int(input())
A,B=map(int,input().split())
for i in range(A,B):
  if(i%K==0):
    print("ok")
  if(i==B and i%K!=0)
    print("NG")
  
 


K=int(input())
A,B=map(int,input().split())
for i in range(A,B):
  if(i%K==0):
    print("ok")
  if(i==B and i%K not ==0)
    print("NG")
  
 

K=int(input())
A,B=map(int,input().split())
for i in range(A,B):
  if(i%K==0):
    print("ok")
    break
  if(i==B and i%K not ==0)
    print("NG")
  
 


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

Verdicts: Runtime Error

Runtime Error

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=input()
a,b=map(int,input().split())
p=1
for i in range(a,b+1):
  if i%K==0:
    print("OK")
    p=0
    break
if p==1:
  print("NG")
    

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

K=int(input())
a,b=map(int,input().split())
p=1
for i in range(a,b+1):
  if i%K==0:
    print("OK")
    p=0
    break
if p==1:
  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())

c = K//B
if c * K >= A:
  print('OK')
else:    
  print('NG')
        


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

c = B//K
if c * 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=list(map(int,input().split()))

x=A%K
w=int(A/K)
y=int(B/K)
z=y-w
print(z)
if B%K==0:
   print('OK')
elif z>0:
    print('OK')
else:
    print('NG')

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

flg=False

for i in range(A,B+1):
    if i%K==0:
        flg=True
    else:
        pass
if flg==True:
    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):
n=int(input())
a,b=map(int,input().split())
xs=[0]
for i in range(a,b+1):
    if i%n==0:
        xs.append(i)
if a<=min(xs)<=b:
    print("OK")
else:
    print("NG")

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):
import sys
K=int(input())
A,B=map(int,input().split())
num=1
while K*num>B:
  if A<=K*num and K*num<=B:
    print('OK')
    sys.exit()
  num+=1
print('NG')

import sys
K=int(input())
A,B=map(int,input().split())
num=1
while K*num<=B:
  if A<=K*num and K*num<=B:
    print('OK')
    sys.exit()
  num+=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):
N = int(input())
A, B = map(int, input().split())

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

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

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

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())

f=False
for i in range(a,b+1):
    if i % k ==0:
        f =True
        break

if f:
    print("Yes")
else:
    print("no")

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

f=False
for i in range(a,b+1):
    if i % k ==0:
        f =True
        break

if f:
    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())

s = (B // K) * K
if s => A: 
    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())

s = (B // K) * K
if B => A: 
    print("OK")
else:
    print("NG")

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

K = int(input())
A, B = map(int, input().split())
 
s = (B // K) * K
if A <= s: 
    print("OK")
else:
    print("NG")

Verdicts: 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('OK')
        break
    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())

largest = (b//k)*k
if a <= largest:
    print('OK')
else:
    print('NG')

Verdicts: Wrong Answer

Wrong Answer

Accepted