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())
flag=False
while flag:
    
    for i in range(A,B,1):
        if i % K ==0:
            print("OK")
            flag=True
            break

    if flag:
        break

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())
a=0    
for i in range(A,B,1):
    if i % K ==0:
       print("OK")
        a+=1
       break 
        
elif a==0:
   print("NG")
   
        

last=int(input())
first=100
r=[]
while first<last:
  first=int(first*1.01)
  r.append(first)
  
R=len(r)

print(R)

K=int(input())
A,B=map(int,input().split())
flag=False
a=0
while flag:
    
    for i in range(A,B,1):
        if i % K ==0:
            print("OK")
            a+=1
            flag=True
            break   

    if flag:
        break
        
    elif a==0:
      print("NG")
      break
        

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

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

K=int(input())
A,B=map(int,input().split())
flag=False
a=0
while flag:
    
    for i in range(A,B,1):
        if i % K ==0:
            print("OK")
            a+=1
            flag=True
            break
        else:    

    if flag:
        break
        
if a==0:
  print("NG")
        

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

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

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):
from sys import stdin
import math
import fractions

k = int(stdin.readline().rstrip())
a, b = [int(x) for x in stdin.readline().rstrip().split()]

result = 0
flag = False
for i in range(10000):
    result += k
    if (a <= result and b >= result):
        print('Yes')
        flag = True
        break

if (flag == False):
    print('No')

from sys import stdin
import math
import fractions

k = int(stdin.readline().rstrip())
a, b = [int(x) for x in stdin.readline().rstrip().split()]

result = 0
flag = False
for i in range(10000):
    result += k
    if (a <= result and b >= result):
        print('OK')
        flag = True
        break

if (flag == False):
    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:
    print('OK')
    flag = 1

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 and flag == 0:
    print('OK')
    flag = 1
 
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+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')
        quit()
else : 
    print('NG')


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())
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')
        quit()
else : 
    print('NG')


Verdicts: Runtime Error

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())
    print("OK" if a//k < b//k or a%k==0 or b%k==0 else "NG")

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

if k == 1:
    print("OK")
else:
    if a % k == 0 or b % k == 0:
        print("OK")

    else:
        if a//k < b//k:
            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):
def main():
    K = int(input())
    A, B = list(map(int, input().split(' ')))

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


if __name__ == '__main__':
    main()


def main():
    K = int(input())
    A, B = list(map(int, input().split(' ')))

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


if __name__ == '__main__':
    main()


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 == a//k:
    if a%k == 0:
        print("OK")
    else:
        print("NG")
else:
    print("OK")

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

if a//k == b//k:
    if a%k == 0:
        print("OK")
    else:
        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):
X = int(input())

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

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

X = int(input())

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

flag = False
for x in range(A, B+1):
  if x % K == 0:
    flag = True


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

X = int(input())

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

flag = False
for x in range(A, B+1):
  if x % K == 0:
    flag = True


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

K = int(input())

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

flag = False
for x in range(A, B+1):
  if x % K == 0:
    flag = True


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

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

for i in range(1000):
  if a<= k*i <= b :
    print("OK")
    exit()
  else :
    print("NG")



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

for i in range(1000):
    if a<= k*i <=b :
        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())
i = A // K
nk = K
OK = False
if A-B >= K:
  print('OK')
else:
  while nK < B:
    if (nK >= A) and (nK <= B):
      OK = True
      print('OK')
    nK = i * K
    i = i + 1
if OK = False:
  print('NG')

K = int(input())
A, B = map(int, input().split())
i = A // K
nK = K
OK = False
if A-B > K:
  print('OK')
else:
  while nK =< B:
    if (nK >= A) and (nK <= B):
      OK = True
      print('OK')
      break
    nK = i * K
    i = i + 1
if OK == False:
  print('NG')

K = int(input())
A, B = map(int, input().split())
i = A // K
nk = K
OK = False
if A-B >= K:
  print('OK')
else:
  while nK < B:
    if (nK >= A) and (nK <= B):
      OK = True
      print('OK')
    nK = i * K
    i = i + 1
if OK == False:
  print('NG')

K = int(input())
A, B = map(int, input().split())
i = A // K
nK = K
OK = False
if A-B > K:
  print('OK')
else:
  while nK <= B:
    if (nK >= A) and (nK <= B):
      OK = True
      print('OK')
      break
    nK = i * K
    i = i + 1
if OK == False:
  print('NG')

Verdicts: 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 = int(input())
a,b = map(int,input().split())
for i in range(a,b):
  if i % k == 0:
    ans = 'OK'
  else:
    ans = 'No'
print(ans)

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

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
if flg:
  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):

s = input().split()
a = int(s[0])
b = int(s[1])
n = int(s[2])

l = list()

for x in range(n):
    ans = a*(x+1)//b - a*((x+1)//b)
    l.append(ans)


print(max(l))

    
    

n = int(input())
m = input().split()
a = int(m[0])
b = int(m[1])
 
if b//n - a//n >= 1:
    print('OK')
elif b%n == 0:
    print('OK')
elif a%n == 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
#input
K = int(input())
A, B = map(int, input().split())

#output
answer = "NG"
for i in range(A, B+1):
    if i % K == 0:
        answer = "OK"
    else:
        continue

print(answer)

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

#output
answer = "NG"
for i in range(A, B+1):
    if i % K == 0:
        answer = "OK"
    else:
        continue

print(answer)

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

ARGS=input().split()
A=int(ARGS[0])
B=int(ARGS[1])

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

K=int(input())

ARGS=input().split()
A=int(ARGS[0])
B=int(ARGS[1])

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

K=int(input())

ARGS=input().split()
A=int(ARGS[0])
B=int(ARGS[1])

if A <= B//K*K:
    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):
i=input(int())
j,k=input(int())
for l in range(k+1)
  if j<=l*i<=k:
    break
    print("OK")
  else:
    print("NG")

i=int(input())
j,k=int(input()),int(input())
l=0
while True:
    if j<=l*i<=k:
        print("OK")
        break
    elif l*i>k:
        print("NG")
        break
    l+=1

i=int(input())
j,k=int(input()).split()
l=0
while True:
    if j<=l*i<=k:
        print("OK")
        break
    elif l*i>k:
        print("NG")
        break
    l+=1


i=int(input())
j,k=(int(x) for x in input().split())
l=0
while True:
    if j<=l*i<=k:
        print("OK")
        break
    elif l*i>k:
        print("NG")
        break
    l+=1


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

a = (B//K) - (A//K)

if A==B:
    if A % K = 0:
        print("OK")

    else:
        print("NG")

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

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

a = (B//K) - (A//K)

if A==B:
    if A % K = 0:
        print("OK")

    else:
        print("NG")

if a==0:
    print("NG")

else:
    print("OK")

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

a = (B//K) - (A//K)

if A%K == 0:
    print("OK")

elif B%K == 0:
    print("OK")

else:
    if A % K == 0:
        print("OK")
    
    else:
        print("NG")
    

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

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

a = (B//K)*K - A

if a < 0:
    print("NG")

else:
    print("OK") 


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

for i in range(1000):
    if A <= K*i and K*i <= 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")
        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):
import sys
K = int(input())
A, B = [int(x) for x in 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 = [int(x) for x in input().split()]
for i in range(A, B+1):
  if i%K == 0:
    print("OK")
    sys.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):
import numpy as np
s= int(input())
List = list(map(int, input().split()))
array = list()
for i in range(List[0],List[1]):
    if s == 1:
        print("OK")
        break
    if i % s == 0:
        print("OK")
        break
    else:
        array.append("NG")
if not ('OK' in array):
    print("NG")

A, B = int(input())
s = int(input().split())
if s == 1:
    print("OK")
if s < A:
    print("NG")
if s > B:
    print("NG")
print("OK")

import numpy as np
s= int(input())
List = list(map(int, input().split()))
array = list()
for i in range(List[0],List[1]+1):
    if s == 1:
        array.append("OK")
        break
    if i % s == 0:
        array.append("OK")
        break
if ('OK' in array):
    print("OK")
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())

A_bai = int(A/K)
B_bai = int(B/K)

if A_bai != B_bai:
  print("OK")
else if (A%K == 0) || (B%K == 0):
  print("OK")
else:
  print("NG")


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

A_bai = int(A/K)
B_bai = int(B/K)

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

n = int(input())
a, b = map(int, input().split())
ans = 0
for i in range(a, b + 1):
  if i % n == 0:
    ans += 1
    break
print("OK" if ans == 1 else "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 = list(map(int, input().split()))
A = a[0]
B = a[1]
N = a[2]
 
if N%B !=0:
  x_1 = (N//B)*B-1
  if x_1 == -1:
    x_1 = N
  x_2 = N
elif N == 1 or B ==1:
  x_1 =N
  x_2 =N

else:
  x_1 = N-1
  x_2 = N-1
ans_1 = math.floor(A*x_1/B)-A*math.floor(x_1/B)
ans_2 = math.floor(A*x_2/B)-A*math.floor(x_2/B)
if ans_1 >= ans_2:
  print(ans_1)
else:
  print(ans_2)

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

if a[1]//k != a[0]//k:
  print('OK')
elif a[0]%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):
#-*- using:utf-8 -*-

k = int(input())
a, b = map(int, input().split())
if(a<=k and k<=b):
    print("OK")
else:
    print("NG")

#-*- using:utf-8 -*-

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

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 = 0

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

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('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 =input().split()

print(int(A)//K+1)
print(int(B)//K)

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


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

if (((int(A)//K)+1) <= (int(B)//K)):
    print("OK")
elif(K==1):
    print("OK")
elif(int(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 A//K - (B-1)//K > 0:
    print("OK")
else:
    print("NG")


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

if B//K - (A-1)//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 A%K==0 or B%K==0 or ABS(B-A)>=K:
  print('OK')
else:
  print('NG')


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

if A%K==0 or B%K==0 or ABS(B-A)>=K:
  print('OK')
else:
  print('NG')

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

for num in range(A, B+1, 1):
  if num % K == 0:
    print('OK')
    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):
a,b,n=map(int,(input().split())
x = min(b-1,n)
print(int(a*x/b)-a*int(x/b))

k=input()
a,b = map(int, input().split())
ans="NG"
while a <= b:
  if a%k=0:
    ans ="OK"
  else:
    a=a+1
print(ans)

import math
k=int(input())
a,b = map(int, input().split())
ans="NG"

while a <= b:
	if a%k==0:
		ans ="OK"
		a=b+1
	else:
		a=a+1

print(ans)

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


for n in range(1,10):
    if A<=K*n and K*n<=B:
        print("OK")
        i="ok"
        break
    else:
        i="ng"
    
if i == "ng":
    print("NG")

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

s=range(A,B+1)   
for n in range(1,1000):  
        if K*n in s:
            print("OK")
            break
        if K==1:
            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 = list(map(int, input().split()))

ans = "NG"

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

print(ans)

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

ans = "NG"

for i in range(A, B+1):
  #print(i)
  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 = int(input())
A, B = map(int, input().split())

while K <= 1000:
  if K >= A and K <= B:
    print('OK')
    exit()
  K += K

print('NG')


K = int(input())
A, B = map(int, input().split())
now = K
while now <= 1000:
  if now >= A and now <= B:
    print('OK')
    exit()
  now += K

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


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

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

k = int(input())
a, b = list(map(int, input().split()))
for i = range(a, b+1):
  if i % k == 0:
    print("OK")
    return
print("NO")


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

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
    break
if flg:
  print("YES")
else:
  print("NO")

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
    break
if flg:
  print("OK")
else:
  print("NG")

Verdicts: Runtime Error

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):
#-*-ccoding:utf-8-*-
k = int(input())
a, b = map(int, input().split())
is_ok = False

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

#-*-ccoding:utf-8-*-
k = int(input())
a, b = map(int, input().split())
is_ok = False
 
for i in range(a,b+1):
  if i % k == 0:
    is_ok = True
    
if is_ok:
  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 <= (a // k) * k and (a // k) * k <= b:
  print("OK")
else:
  print("NG")

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

if (a // k) * k == a or (a // k + 1) * k <= 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())

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

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

ans = 0
ng = 0
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 = input().split()
A = int(A)
B = int(B)

ans = "NG"
for i in range(B+1):
    if A <= K * i and K * i <= B:
        ans = "OK"
        break


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

ans = "NG"
for i in range(B+1):
    if A <= K * i and K * i <= B:
        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):
#!/usr/bin/env python
# -*- coding: utf-8 -*-
x = int(input())
base = 100
year = 0
while x > base:
    year +=  1
    base = int(base * 1.01)
print(year)

#!/usr/bin/env python
# -*- coding: utf-8 -*-
k = int(input())
a,b = map(int,(input().split()))
if b%k == 0:
    kb = b
else:
    kb = int(b / k) * k
if a <= kb:
    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())
for i in range(a, b+1):
  if(n%i==0):
    print("OK")
    exit(0)
print("NG")

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

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):
k = int(input())
a, b = list(map(int, input().split()))
if(k >= a and ((k / b) <= a and (k / b) <= b)):
    print('OK')
else:
    print('NG')

k = int(input())
a, b = list(map(int, input().split()))
if(k >= a and ((k / b) <= a and (k / b) =< b)):
    print('OK')
else:
    print('NG')


import math
k = int(input())
a, b = list(map(int, input().split()))
mul = math.floor(b/k) * k

if(mul >= a and (mul >= a and mul <= b)):
    print('OK')
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())
ans = 'NG'
for i in range(a, b+1):
  if i % K == 0:
    ans = 'OK'
	break
print(ans)

def resolve():
    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)

resolve()

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=int(input())
B=int(input())

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

K=int(input())
A=int(input())
B=int(input())
if A>=1 and B<=1000:
  print('OK')
else:
  print('NG')

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

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


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

if A <= (B // K)*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(sys.stdin.readline())
A, B = map(int, input().split())
for i in range(A,B+1):
    if i%K==0:
        return "OK"
    return "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
if count==0:
  print("NG")
  
  

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

K=int(input())
inp=input().split(' ')
A=int(inp[0])
B=int(inp[1])
for i in range(A,B+1):
    if i%K==0:
        return "Yes"
    return "No"

K = int(sys.stdin.readline())
A, B = map(int,sys.stdin.readline().split() )
for i in range(A,B+1):
    if i%K==0:
        return "OK"
    return "NG"

import sys
K = int(sys.stdin.readline())
A, B = map(int,sys.stdin.readline().split() )
for i in range(A,B+1):
    if i%K==0:
        return "OK"
    return "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")

Verdicts: Runtime Error

Wrong Answer

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 = int(input())

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

K = int(input())

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

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

K = int(input())

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


K=int(input())
A,B=(int(x) for x in input().split())
if (A%K)>B-A:print('OK')
else:print('NG')


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

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

for x in range(1,N+1):
    if A <= res:
        break
    else:
        res = int(A*x/B)- A* int(x/B)

print(res) 




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

i = 1
while True:
    k = K*i
    if A <= k and k <= B:
        print("OK")
        break
    if B < k:
        print("NG")
        break
    i += 1
    

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())
AB=input().split()
A=int(AB[0])
B=int(AB[1])
for i in rage(A,B+1):
    i=567
    if(i%K==0):
        print('OK')
        exit()
print('NG')


K=int(input())
AB=input().split()
A=int(AB[0])
B=int(AB[1])
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):
X = int(input())
money = 100
year=0
i=0
while i>=0:
  if money>=X:
    print(year)
    break
  else:
    money=int(money*1.01)
    year += 1

A,B,N = map(int,input().split())
x = min(N, B-1)
a = A*x//B - A*(x//B)
print(a)


A,B,N = map(int,input().split())
x = N
a = 0
while x>999*N//1000:
  if x%B != 0 and a < A*x//B - A*(x//B):
    a = A*x//B - A*(x//B)
    x -= 1
  else:
    x -= 1
print(a)

A,B,N = map(int,input().split())
x = 0
a = 0
while x <= B-1:
  if x%B != 0 and a < A*x//B - A*(x//B):
    a = A*x//B - A*(x//B)
    x -= 1
  else:
    x -= 1
print(a)


K = int(input())
A,B = map(int,input().split())
i=1
while i<=B:
  if K*i>=A and K*i<=B:
    print("OK")
    break
  else:
    i += 1
if i == B+1:
  print("NG")
  

Verdicts: Wrong Answer

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):
target = int(input())
range_d = [int(i) for i in input().split()]
min_d = range_d[0]
max_d = range_d[1]

flag = False
if max_d < target:
  flag = 
else:
  for i in range(min_d,max_d+1):
    if i%target == 0:
      flag = True
      break
	print('OK') if flag else print('NG')

target = int(input())
range_d = [int(i) for i in input().split()]
min_d = range_d[0]
max_d = range_d[1]

flag = False
if max_d < target:
  print("NG")
else:
  for i in range(min_d,max_d+1):
    if i%target == 0:
      flag = True
      break
  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())

ans = B // K 
ans1 = ans * K

if (ans1 >= B):
  print('OK')
else:
  print('NG')


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

ans = B // K 
ans1 = ans * K

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

k = 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
else:
  print("NG")

Verdicts: 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 = int(input())
A, B = [int(s) for s in input().split()]
 
largest = B // K * K

print("OK" if largest >= a else "NG")

K = int(input())
A, B = [int(s) for s in 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):
a=int(input())
x,y = map(int,input().split())
count = 0

for i in range(x, y + 1):
    print(i)
    if i % a == 0:
        count += 1

if count >= 1:
    print("OK")
else:
    print("NG")

a=int(input())
x,y = map(int,input().split())
count = 0

for i in range(x, y + 1):
    if i % a == 0:
        count += 1

if count >= 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):
from itertools import combinations_with_replacement
import numpy as np

N, M, Q = map(int, input().split())

G = [list(map(int, input().split())) for _ in range(Q)]

ans = 0




A = np.array(list(combinations_with_replacement(range(1, M + 1), N)))
scores = np.zeros(len(A))
for g in G:
    a, b, c, d = g
    cond = A[:, b - 1] - A[:, a - 1] == c
    scores += d * cond
print(scores.max())

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

for i in range(A, B+1):
    if i % K == 0:
        print("OK")
        import sys
        sys.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()))

for i in range(a,b+1)
    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):
    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())
bool flag=true
for i in range(a,b+1):
  if(a%k==0):
    print("OK")
    flag=false
  	break
if(flag):
   print("NG")

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

flag=1
while(a<=b):
    if(a%k==0):
        print("OK")
        flag=0
        break
    a+=1
if(flag):
	print("NG")

Verdicts: Runtime Error

Accepted