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

K = int(input().rstrip())
distance_range = list(map(int,input().split()))
if (distance_range[1]//K)*K >= distance_range[0]:
    print("Yes")
else:
    print("No")


K = int(input().rstrip())
distance_range = list(map(int,input().split()))
if (distance_range[1]//K)*K >= distance_range[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
listA=[] 
while True:
    try:
        listA.append(list(map(int,input().split())))

    except:
        break;
        

a = listA[0][0]
b = listA[0][1]
n = listA[0][2]

old = 0
for x in range(1,n+1):
  if x == 1:
    c = math.floor((a*x)/b)
    d = math.floor(x/b)
    old = c-(a*d)
  else:
    c = math.floor((a*x)/b)
    d = math.floor(x/b)
    current = c-(a*d)
    if old <= current:
      old = current
  if x > 10000000:
    break
print (old)
  


listA=[] 
while True:
    try:
        listA.append(list(map(int,input().split())))

    except:
        break;
        

a = listA[0][0]
b = listA[1][0]
c = listA[1][1]

if b % a == 0:
  print ('OK')

d = b // a

if b % a !=0:
  if a * (d+1) <= c:
    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):
from math import floor
a,b,n=map(int,input().split())
if(n<b):
  print(floor((a*n)/b))
else:
  if(n%b<(n/2)):
    for i in range(0,(n%b)+1):
      print(floor((a*(n-1-i))/b)-(a*floor((n-1-i)/b)))
  else:
    print(floor((a*(n))/b)-(a*floor((n)/b)))


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


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):
n = int(input())
b,c=map(int, input().split())
k = b
while  b<= k <= c :
    if k % n == 0 :
        print('OK')
        exit()
    b = b +1
print('NG')

n = int(input())
b,c=map(int, input().split())
k = b
while  b<= k <= c :
    if k % n == 0 :
        print('OK')
        exit()
    k += 1
print('NG')

Verdicts: Wrong Answer

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

Submission attempts (in order):
K = int(input())
arr = list(map(int, input()))
a = arr[1] % K
b = arr[1] - arr[0]
if a > b:
    print("OK")
else:
    print("NG")


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

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

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

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

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

Verdicts: Runtime Error

Runtime Error

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

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

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

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

elif X == 0 :
    print("NG")

else :
    print("OK")

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)

aa = a % k
bb = b % k

if(b - a > k):
    print('OK')
if(aa > bb):
    print('OK')
if(aa == 0):
    print('OK')
else:
    print('NG')


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

aa = a % k
bb = b % k

if(b - a > k):
    print('OK')
if(aa > bb):
    print('OK')
if(aa == 0):
    print('OK')
else:
    print('NG')


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

aa = a % k
bb = b % k

if(b - a >= k):
    print('OK')
elif(aa > bb):
    print('OK')
elif(aa == 0):
    print('OK')
else:
    print('NG')


Verdicts: Runtime Error

Runtime Error

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

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

for i in range(a, b+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()))
while True:
  x+=k
  if a<=x<=b:
    print('OK')
    break
  if x>b:
    print('NG')
    break

k=int(input())
a,b=list(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=(int(x) for x in input().split())
z = int(a/k) - int(b/k)
sum = 0
for i in range(z):
    sum = sum + 1
if k == 1:
    print("OK")
elif sum == 0:
    print("NG")
else:
    print("OK")

k = int(input())
a,b=(int(x) for x in input().split())
z = int(a / k) - int(b / k)
sum = 0
for i in range(z):
    sum = sum + 1
if sum == 0:
    print("NG")
else:
    print("OK")

k = int(input())
a,b=(int(x) for x in input().split())
z = int(a / k) - int(b / k)
sum = 0
for i in range(z):
    sum = sum + 1
if sum == 0:
    if k == 1:
        print("OK")
    else:
        print("NG")
else:
    print("OK")

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

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

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

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):
# -*- coding: utf-8 -*-
from itertools import itertools_with_replacement
N,M,Q=map(int,input().split())
abcd=[]
for _ in range(Q):
    abcd.append(tuple(map(int,input().split())))
Abase=[]
for a in range(1,M+1):
    Abase=Abase+[a]
A=set(itertools.combinations_with_replacement(Abase,N))
ans=0
for i in A:
    temp=0
    for j in abcd:
        if i[j[1]-1]-i[j[0]-1]==j[2]:
            temp=temp+j[3]
    if temp>=ans:
        ans=temp
print(ans)

# -*- coding: utf-8 -*-
K=int(input())
A,B=map(int,input().split())
i=1
ans=0
while B>=K*i:
    if A<=K*i:
        ans=1
        break
    i=i+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):
a=int(input())
i=0
b=100
while b<a:
  b=int(b*1.01)
  i+=1
print(i)

k = int(input())
a, b = map(int, input().split())
ans = "NG"
for c in range(a, b+1):
  if (c%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 = [input() for i in range(2)]
if (b-a+1 >= k):
  print("OK")
else:
  print("NG")

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

Verdicts: Runtime Error

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

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

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

if (b-a) // 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")
    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())

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

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

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

print('NG')

Verdicts: Wrong Answer

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

Submission attempts (in order):
K=int(input())
A,B=map(int,input().split())
for i in range(A,B+1):
  if i%K==0:
    print('OK')
    break
  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
    
    
if flag==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):
import numpy as np
import fractions
 
K = int(input())
A,B = [int(i) for i in (input()).split(" ")]
 
if((B//K-A//K)>=0 and K<=B and 2*A<=K):
  print("OK")
else:
  print("NG")


import numpy as np
import fractions
 
K = int(input())
A,B = [int(i) for i in (input()).split(" ")]
 
if(((B//K-A//K)>0 and 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):
k = int(input())
a,b = map(int,input().split())
for i in range(a, b+1):
  if k % i == 0:
    print("OK")
    exit()
print("NG")

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

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

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

Verdicts: Wrong Answer

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 B-A>=K-1:
    print("OK")
elif A%K > B%K:
    print("OK")
elif A%K=0 or b%K=0:
    print("OK")
else:
    print("NG")

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

if B-A>=K-1:
    print("OK")
elif A%K > B%K:
    print("OK")
elif A%K=0 or B%K=0:
    print("OK")
else:
    print("NG")

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

if B-A>=K-1:
    print("OK")
elif A%K > B%K:
    print("OK")
elif A%K==0 or B%K==0:
    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):
import sys

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

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


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):
import sys

lines = sys.stdin.readlines()
K = int(lines[0])
X = lines[1].split(' ')
print(X)
A = X[0]
B = X[1]

n = int(int(A)/int(K))
m = int(int(B)/int(K))

if m-n >0:
    print('OK')
else:
    print('NG')

import sys
import math

lines = sys.stdin.readlines()
K = int(lines[0])
X = lines[1].split(' ')

A = int(X[0])
B = int(X[1])

n = math.ceil(A/K)-1
m = int(B/K)

if m-n >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):
n=int(input())
n,m=map(int,input().split())
flag=False
for i in range(1000):
  ans=1+i
  if(n<=ans and m>=ans):
    if(ans%n==0):
      flag=True
      
if(flag):
  print("Yes")
else:
  print("No")

n=int(input())
a,b=map(int,input().split())
flag=False
for i in range(1000):
  ans=1+i
  if(a<=ans and b>=ans):
    if(ans%n==0):
      flag=True
      
if(flag):
  print("Ok")
else:
  print("NG")



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

import sys

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


Verdicts: Wrong Answer

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

Submission attempts (in order):

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

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

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

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

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

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

Verdicts: Runtime Error

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

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()
    if i%k != 0:
        print("NG")
        sys.exit()
        
    

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

        
    

Verdicts: Wrong Answer

Wrong Answer

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

K=int(input())
A,B=map(int,input().split())
if (A-1)//K == B//K:
  print('NG')
else:
  print('OK')


Verdicts: Runtime Error

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

Submission attempts (in order):
a = int(input())
b,c = map(int,input().split())
 
 
if b<= a<= c and  (c-b>=a or b%a==0 or c%a == 0):
    print('OK')
else:
    print('NG')

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


import math
K=int(input())
A,B=[int(i)for i in input().split()]
a=math.ceil(A/K)
print("OK" if B>=a*K 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):
k = int(input())
a,b = map(int,input().split())
if a//k !=b//k:
  print('Yes')
else:
  print('No')

k = int(input())
a , b = map(int,input().split())
if a//k != b//k or (b%k)*(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 = [int(x) for x in input().split()]

if A >= K:
    tmp = A // K
    if A % K == 0 or B <= ( tmp + 1 ) * K:
        print('OK')
    else:
        print('NG')
else:
    if B // K > 0:
        print('OK')
    else:
        print('NG')        


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

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

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

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

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


Verdicts: Runtime Error

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

Submission attempts (in order):
K=int(input())
A,B=list(map(int, input().split()))
ans='No'
for i in range (A,B+1):
    if A<K*i and K*i<B:
        ans='OK'
        break
print(ans)

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

Verdicts: Wrong Answer

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

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

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


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



from math import floor
A,B,N = map(int,input().split())
if(B-1>N):
    Nomin = floor(N)
else:
    Nomin = floor(B-1)

print(Nomin)

K =int(input())
A,B = map(int,input().split())
f = 0
for i in range(A,B+1):

    if(i%K==0):
        print("OK")
        f =1
        break

if(f ==0):
    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())
result=0
for i in range(1000):
  tmp=K*i
  if A<=K<=B:
    result=1
    break
  if K>B:
    break
if result==1:
  print("OK")
else:
  print("NG")

K=int(input())
A,B=map(int,input().split())
result=0
for i in range(1000):
  tmp=K*i
  if A<=tmp<=B:
    result=1
    break
  if tmp>B:
    break
if result==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 sys import stdin

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

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

from sys import stdin

X = int(stdin.readline())
Y = 100

count = 1
while True:
  Y += Y*0.01
  if Y >= X:
    print(count)
    break
  else:
    count += 1

from sys import stdin

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

count = 0
for i in range(B-A+1):
  if (A+i) % K ==0:
    count += 1

if count > 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=input("K=")
A=input("A=")
B=input("B=")

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


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


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


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

Verdicts: Runtime Error

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

Submission attempts (in order):
import math

# X
X = int(input())

A = 100
i = 0

while True:
    if X <= A :
        print(i)
        break
    else:
        i += 1
        A = math.floor(A*1.1)


# K
K = int(input())

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

for i in range(1001):
    if A <= K*i <= B:
        print('OK')
        break
    if B<K*i:
        print('NG')
        break


Verdicts: Wrong Answer

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

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

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

K = int(input())
A, B = map(int, input().split())
d = A // K
r = A % K

if r == 0:
  print("OK")
elif K*(d+1) >= A and K*(d+1) <= 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())
result = 'NG'
for i in range (A, B + 1):
    if i % K == 0:
        result = 'OK'
print(result

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

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

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

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

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

flag = 0
for i in range(1000):
    if (a <= k * (i+1) and (b >= k * (i+1):
        print("OK")
        flag=1
        break
if flag != 1:
    print("NO")

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

flag = 0
for i in range(1000):
    if (a <= k * (i+1)) and (b >= k * (i+1)):
        print("OK")
        flag = 1
        break
if flag != 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):

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

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

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:
        return print("OK")
return 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

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

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

K=int(input())
A,B=map(int,input().split())
print("OK" if B-A >= B%K 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):
k=int(input())
a,b=map(int, input().split())

while True:
    if a%k == 0:
        print("OK")
        break
    elif: b%k == 0:
        print("OK")
    elif b-a >= k:
        print("OK")
        break
    else:
        print("NG")
        break


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

print("OK" if a <= b//k*k 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())
ans = "NG"

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

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

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

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

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

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('OK')
        break
print('NG')


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

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


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


import sys


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


Verdicts: Wrong Answer

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

Submission attempts (in order):
K = int(input())
A,B = map(int, input().split())
count = 0
for i in range(A-1,B+1):
  if i%K == 0:
    count += 1

if count != 0:
  print('Yes')
else:
  print('No')

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

for i in range(A,B+1):
  if i%K == 0:
    count += 1
  i += 1

if count > 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):
4
5 7

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

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

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):
# -*- coding: utf-8 -*-

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

     ans = k
     while(True):
          # print(ans)
          if ans >= a and ans <= b:
               print('Yes')
               break
          elif ans > b:
               print('No')
               break
          else:
               ans = ans + k

if __name__ == "__main__":
    main()


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

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

     ans = k
     while(True):
          # print(ans)
          if ans >= a and ans <= b:
               print('OK')
               break
          elif ans > b:
               print('NG')
               break
          else:
               ans = ans + k

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

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

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

if a % k != 0:
    if a <= (a//k + 1)*k <= b:
        print('OK')
    else:
        print('NG')
else:
    if a <= (a//k)*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):
N, M, Q = map(int, input().split())
l = []
for i in range(Q):
  l.append(list(map(int, input().split())))

A_N = [[i] for i in range(1, M+1)]
for i in range(N-1):
  a = []
  for j in range(len(A_N)):
    last = A_N[j][-1]
    for k in range(last, M+1):
      a.append(A_N[j] + [k])
  A_N = a

high_score = 0
for i in range(len(A_N)):
    A = A_N[i]
    score = 0
    for j in range(len(l)):
        aj, bj, cj, dj = l[j]
        if A[bj-1]-A[aj-1] == cj:
            score += dj
        high_score = max(high_score, score) 
        
print(high_score)

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

x = list(range(A, B+1))

for i in x:
  if i % K == 0:
    print('OK')
    break
  elif i == B:
    print('NG')
  else:
    pass

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())
list = list(map(int,input().split()))
a=list[0]
b=list[1]
for i in range(a,b):
  for j in range(99999):
    j*k==i
    break
  break
 

k = int(input())
list = list(map(int,input().split()))
a=list[0]
b=list[1]
for j in range(10000):
  for i in range(a,b):
    if j*k==i:
      print("OK")
      break
  break

x = int(input())
for i in range(10000):
  if (1.01)**i==0.01*x:
    print(i)

k = int(input())
list = list(map(int,input().split()))
a=list[0]
b=list[1]

for i in range(a,b+1):
  if i%k==0:
    print("OK")
    break
else:
    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):
import math
X = int(input())
y = 100
n = 0
while(y<X):
  y = int(y*1.01)
  n += 1 
print(n)

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

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

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

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

Verdicts: Runtime Error

Accepted