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 itertools

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

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

Alist=[]

for l in itertools.combinations(range(1,n+m),n):
    ll=list(l)
    a=[]
    for i in range(n):
        a.append(ll[i]-i)
    Alist.append(a)

slist=[]
for i in range(len(Alist)):
    s=0
    for j in range(q):
        aj=lis[j][0]
        bj=lis[j][1]
        cj=lis[j][2]
        dj=lis[j][3]
        if Alist[i][bj-1]-Alist[i][aj-1]==cj:
            s+=dj
    slist.append(s)

print(max(slist))

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: 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("整数kを入力してください")
a = input("整数aを入力してください")
b = input("整数bを入力してください")
c = int(a)
d = int(b)
l = int(k)
e = d-d%l
if e>=c:
    print('ok')
else:
    print('ng')

k=input()
a,b=input().split()
c=int(a)
d=int(b)
l=int(k)
e=d-d%l
if e>=c:
  print('ok')
else:
  print('ng')

k=input()
a,b=input().split()
c=int(a)
d=int(b)
l=int(k)
e=d-d%l
if e>=c:
  print('OK')
else:
  print('NG')

Verdicts: Runtime Error

Wrong Answer

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

Submission attempts (in order):
ｋ = int(input())
a,b = map(int,input().split())
n=0
while True:
    n+=k
    if n>=a and n=<b:
        print('OK')
        break
    if n>b:
        print('NG')
        
        

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


Verdicts: Runtime Error

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

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

j = n - i

if a > j:
    print('NG')
else:
    print('OK')

x = int(input())
i = 100
c = 0

while i < x:
    i = i + (i * 0.01)
    c += 1

print(c)


k = int(input())
a,b = map(int,input().split())
i = b % k
if i == 0:
    print('OK')
    exit()

j = b - i

if a > j:
    print('NG')
else:
    print('OK')

Verdicts: Runtime Error

Wrong Answer

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

Submission attempts (in order):
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())
A, B = [ int(a) for a in input().strip().split(' ')]
     
if (B - A) % K == 0:
  print('OK')
else:
  print('NG')

K = int(input())
A, B = [ int(a) for a in input().strip().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):
n = int(input())
A, B = map(int, input().split())

n_1 = int(A / n)
n_2 = int(B / n)
nn_1 = A%n
nn_2 = B%n

print(n_1,n_2)
if n == 1: print('OK')
else:
    if nn_1 ==0 or nn_2 == 0:print('OK')
    elif n_2 != n_1: print('OK')
    else: print('NG')


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

n_1 = int(A / n)
n_2 = int(B / n)
nn_1 = A%n
nn_2 = B%n
if n == 1: print('OK')
else:
    if nn_1 ==0 or nn_2 == 0:print('OK')
    elif n_2 != n_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):
a = int(input())
b, c= map(int, input().split())
for i in range(b, c+1):
    if i%a == 0:
        print("yes")
        break
    else:
        print("NG")
        break

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

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

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

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

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

Submission attempts (in order):
k=int(input())
a,b=map(int, input().split())
t=b-a
while k<a:
    k+=k
if k<=b:
    print('OK')
else:
    print('NG')


k=int(input())
a,b=map(int, input().split())
t=0
while t<a:
    t+=k
if t<=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=int(input())
temp=list(map(int,input().rstrip().split()))
a=temp[0]
b=temp[2]
if (b-a)>n :
    print("OK")
elif n==1 :
  print("OK")
else :
    print("NG")

n=int(input())
temp=list(map(int,input().rstrip().split()))
a=temp[0]
b=temp[2]
if (b-a)>n :
    print("Yes")
else :
    print("No")

n=int(input())
temp=list(map(int,input().rstrip().split()))
a=temp[0]
b=temp[1]
rem=(a%n)
left=n-rem
if b>=(left+a) :
    print("OK")
elif a%n ==0 or b%n==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())
i = 0
while A <= B:
  if A / K == A // K:
    i = i + 1
    A = A + 1
  else:
    i = i + 0
    A = A + 1
    
if i = 0:
  print("NG")
else:
  print("OK")

K= int(input())
A, B = map(int, input().split())
i = 0
while A <= B:
  if K / 4 == K // 4:
    i = i + 1
    A = A + 1
  else:
    i = i + 0
    A = A + 1
    
if i = 0:
  print("NG")
else:
  print("OK")

K= int(input())
A, B = map(int, input().split())
i = 0
while A <= B:
  if A / K == A // K:
    i = i + 1
    A = A + 1
  else:
    i = i + 0
    A = A + 1
    
if i == 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 = int(input().split()[0])
B = int(input().split()[1])

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


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

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


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

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


Verdicts: Runtime Error

Wrong Answer

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

Submission attempts (in order):
K = int(input())
A, B = map(int,input().split())
tmp = A % k
if(tmp == 0): 
	print('OK')
else:
	if(A + (K-tmp) <= B):
		print('OK')
	else:
		print('NG')

K = int(input())
A, B = map(int,input().split())
tmp = a % k
if(tmp == 0): 
	print('OK')
else:
	if(A + (K-tmp) <= B):
		print('OK')
	else:
		print('NG')

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

tmp = A % K
if(tmp == 0): 
	print('OK')
else:
	if(A + (K-tmp) <= B):
		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 A <= K and K <= B:
    print('OK')
else:
    print('NG')

K = int(input())
A,B = map(int,input().split())
n = 1
while True:
    if A <= K*n and K*n <= B:
        print('OK')
        break
    elif Kn > B:
        print('NG')
        break
    n = n + 1 

K = int(input())
A,B = map(int,input().split())
n = 1
while True:
    if A <= K*n and K*n <= B:
        print('OK')
        break
    elif K*n > B:
        print('NG')
        break
    n = n + 1 

Verdicts: Wrong Answer

Runtime Error

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

Submission attempts (in order):
n,m=map(int,input().split())
for i in range(m):
    print(m-i+1,m+2+i)


k=int(input())
a,b=map(int,input().split())
c=a//k
d=b//k
if d-c==0 and c*k!=a and d*k!=b:
    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):
def main():
    K = int(input())
    A,B = [int(x) for x in input().split()]
    for a in range(A,B+1):
        print(a)
        if a % K == 0:
            print('OK')
            return
    print('NG')

if __name__ == '__main__':
    main()


def main():
    K = int(input())
    A,B = [int(x) for x in input().split()]
    for a in range(A,B+1):
        if a % 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):
i = list(map(int,input().split()))
f = 0
for x in range(i[1],i[2]+1):
    if x % i[0] == 0:
        f = 1

if f == 1:
    print("OK")
else:
    print("No")

i = int(input())
i2 = list(map(int,input().split()))

f = 0
for x in range(i2[0],i2[1]+1):
    if x % i == 0:
        f = 1

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

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


K = int(input())

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

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


K = int(input())

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

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


Verdicts: Runtime Error

Wrong Answer

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

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

if b-a >= k-1:
    print("Yes")
else:
    print("No")

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

if b-(b%k) >= a:
    print("OK")
else:
    print("NG")

Verdicts: Wrong Answer

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

Submission attempts (in order):
a=int(input())
x,y = map(int,input().split())	

b = x//a
c = y//a

if c-b <= 1:
    print('NG')
elif:
    print('OK')

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

b = x//a
c = y//a

if c-b <= 1:
    print('NG')
elif:
    print('OK')


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

b = x//a
c = y//a

if c-b <= 1:
    print('NG')
elif:
    print('OK')


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

c = b // k
d = k*c

if a <= d and d <= b:
    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):
a=int(input())
b,c=map(int,input().split())
if c-b>=c%a:
  print("Yes")
else:
  print("No")

a=int(input())
b,c=map(int,input())
if c-b>=c%a:
  print("Yes")
else:
  print("No")

a=int(input())
b,c=map(int,input().split())
if c-b>=c%a:
  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 = "Yes"

print(ans)

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

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

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 = [int(i) for i in input().split()]

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


k = int(input())
a, b = [int(i) for i in input().split()]

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

k = int(input())
a, b = [int(i) for i in input().split]

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

k = int(input())
a = int(input())
b = int(input())

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

k = int(input())
a, b = [int(i) for i in input().split()]

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


Verdicts: Wrong Answer

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):
X = int(input())
 
now = 100
cnt = 0
while now < X:
  cnt += 1
  now = int(now*1.01)
print(cnt)

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())
AB = input()
l = AB.split()
A = int(l[0])
B = int(l[1])
li = []
for i in range(A, B+1) : 
  if i % K == 0 :
    li.append(i)
  else :
    continue
if len(li) >=1 :
  print("YES")
else : 
  print("NO")

K = int(input())
AB = input()
l = AB.split()
A = int(l[0])
B = int(l[1])
li = []
for i in range(A, B+1) : 
  if i % K == 0 :
    li.append(i)
  else :
    continue
if len(li) >=1 :
  print("OK")
else : 
  print("NG")

Verdicts: Wrong Answer

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

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


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

K = int(K)
AB = [int(i) for i in list(AB.split())]
x = AB[1]/K

if int(x) * K >= AB[0]:
  print('Yes')
else:
  print('No')


K = input()
AB = input()

K = int(K)
AB = [int(i) for i in list(AB.split())]
x = int(AB[1]/K)

if x * K >= AB[0]:
  print('Yes')
else:
  print('No')

K = input()
AB = input()

K = int(K)
AB = [int(i) for i in list(AB.split())]
x = AB[1]/K

if int(x) * K >= AB[0]:
  print('Yes')
else:
  print('No')


K = input()
AB = input()

K = int(K)
AB = [int(i) for i in list(AB.split())]
xb = int(AB[1]/K)

if xb * K >= AB[0]:
  print('Yes')
else:
  print('No')

K = input()
AB = input()

K = int(K)
AB = [int(i) for i in list(AB.split())]


if AB[1]/K - AB[0]/K >= 1 or AB[1]/K - AB[0]/K == 0:
  print('Yes')
else:
  print('No')

K = input()
AB = input()

K = int(K)
AB = [int(i) for i in list(AB.split())]
x = int(AB[1]/K)

if x * K >= AB[0]:
  print('Yes')
else:
  print('No')


K = input()
AB = input()

K = int(K)
AB = [int(i) for i in list(AB.split())]
x = AB[1]/K

if int(x) * K >= AB[0]:
  print('OK')
else:
  print('NG')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

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

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


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

b=list[0]//a
c=list[1]//a

if list[1]%a==0
	print("OK")

elif c-b>=1:
	print("OK")

else:
  print("NG")


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

b=list[0]//a
c=list[1]//a

if list[0]%a==0:
	print("OK")

elif c-b>=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):
# coding: utf-8
# Your code here!
K = int (input())
line= list(map(int,input().split()))
a,b = line[0],line[1]
if b>K:
    print("NG")


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

# coding: utf-8
# Your code here!
K = int (input())
line= list(map(int,input().split()))
a,b = line[0],line[1]
if B<K:
  print("NG")
if (b-a+1)>=K:
    print("OK")

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

# coding: utf-8
# Your code here!
K = int (input())
line= list(map(int,input().split()))
a,b = line[0],line[1]
if b>K:
    print("NG")
elif (b-a+1)>=K:
    print("OK")

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

# coding: utf-8
# Your code here!
K = int (input())
line= list(map(int,input().split()))
a,b = line[0],line[1]
if b<K:
    print("NG")
    

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

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

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

Submission attempts (in order):
a=int(input())
b=list(map(int,input().split()))
ans="No"
for i in range(b[0],b[1]+1):
    if i%a==0:
        ans="Yes"
print(ans)

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
root = int(input())
ranges = list(map(int, input().slice()))
flag = False

for i in range(ranges[0], ranges[1] + 1):
    if i % root:
        flag = True
        
if flag: 
    print('OK')
else:
    print('NG')


root = int(input())
ranges = list(map(int, input().split()))
flag = False

for i in range(ranges[0], ranges[1] + 1):
    if i % root == 0:
        flag = True
        
if flag: 
    print('OK')
else:
    print('NG')


Verdicts: Runtime Error

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

Submission attempts (in order):
K = int(input())
A,B = map(int,input().split())
if K == 1 : print("Yes")
if (B-A) < K : print("No")
else : print("Yes")


K = int(input())
A,B = map(int,input().split())
mes = 0
for num in range (A,B+1):
    if num % K == 0 : mes = 1
    else : pass

if mes == 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 = input()
AB = input().split()

if math.ceil(int(AB[1])/int(K)) <= math.ceil(int(AB[0])/int(K)):
    print('OK')
else:
    print('NG')

import math
K = input()
AB = input().split()

K = int(K)
A = int(AB[0])
B = int(AB[1])

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

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

Verdicts: Runtime Error

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

Submission attempts (in order):
m = int(input())
a,b = map(int,input().split())
if b // k - a// k > 0:
  print('OK')
else:
  print('NG')

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


Verdicts: Runtime Error

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

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

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

K = int(input())
A, B = map(int, (input().split()))
for i in range(A, B):
    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")
        break

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

K = int(input())
A, B = map(int, (input().split()))
lst = []
for i in range(A, B+1):
    if i % K == 0:
        result = "OK"
        lst.append(result)
        break
    else:
        result = "NG"
        lst.append(result)
print(lst[-1])

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

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

Submission attempts (in order):
K=int(input())
A,B=map(int,input().split())
for (A;B;A++):
  if A%K==0:
    print("OK")
    break
else:
  print("NG")

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


Verdicts: Runtime Error

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

Submission attempts (in order):
K=int(input())
A_b=list(map(int,input().split()))
A=A_B[0]
B=A_b[1]
m=1
for i in range(B):
  m=i*k
  if (m>A and m<B):
    print("OK")
  else:
    print("NG")
    
   
  

K=int(input())
A_B=list(map(int,input().split()))
A=A_B[0]
B=A_B[1]
m=1
c=0
for i in range(A,(B+1)):
  if(i%K==0):
    c=1
  else:
    c=0
if(c==1):
  print("OK")
elif(c==0):
  print("NG")

K=int(input())
A_B=list(map(int,input().split()))
A=A_B[0]
B=A_B[1]
m=1
c=0
for i in range(B):
  m=i*K
  if(m>A and m<B):
    c=1
  else:
    c=0
if(c==1):
  print("OK")
else:
  print("NG")

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

Verdicts: Runtime Error

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 = list(map(int, input().split()))
icount = 0
if A[2] - A[1] >= A[0]:
  print('OK')
  icount = icount + 1
else:
  for i in range(A[1]:A[2]+1):
    if i % A[0] == 0:
      print('OK')
      icount = icount + 1
      if icount == 1:
        break
      
if icount == 0:
  print('NG')
    


A = list(map(int, input().split()))  
i_max = 0
i_count = 0
j_count = 0

for x in range(1, A[2]+1):
  if i_max < ((A[0]*x)//A[1]-A[0]*(x//A[1])):
    i_max = ((A[0]*x)//A[1]-A[0]*(x//A[1]))
    i_count = x
  if (x - i_count) == 1:
    j_count = j_count + 1
  if (j_count == 2):
    break
    
print(i_count)


N = int(input())
A = list(map(int, input().split()))  
icount = 0
if A[1] - A[0] >= N:
  print('OK')
  icount = icount + 1
else:
  for i in range(A[0], A[1]+1):
    if i % N == 0:
      print('OK')
      icount = icount + 1
      if icount == 1:
        break
      
if icount == 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())
x = k * (a // k) + k
if k == 1:
    print("OK")
elif : x >= a and x <= 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: 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())

n = int()
if a <= k * n <= b :
    print("OK")
else :
    print("NO")


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

for n in range(a,b):
    if n % k == 0:
      print("OK")
      break

    else :
       print("NO")
       break

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



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())
print('NYoe s'[b//k>a//k::2])

k,a,b = map(int,open(0).read().split())
print('NOGK'[b%k<=b-a::2])

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

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

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'

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

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


K = int(input())
A,B = map(int,input().split())
count =0
for Num in range(A,B+1):
    if Num%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):
#! python3
def main():
    k = int(input())
    a, b = map(int, input().split())
    ans = [i for i in range(a, b+1) if i%k == 0]
    if len(ans) == 0:
        print('NG')
    else:
        print('YES')

main()

#! python3
def main():
    k = int(input())
    a, b = map(int, input().split())
    ans = [i for i in range(a, b+1) if i % k == 0]
    if len(ans) == 0:
        print('NG')
    else:
        print('OK')

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

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

ans = 'NG'

h = b-a+1

for i in range(a, h, 1):
    if i % k == 0:
        ans = 'OK'

print(ans)

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

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

ans = 'NG'

h = b-a+1

for i in range(h):
    p = a + i
    if p % k == 0:
        ans = 'OK'

print(ans)

Verdicts: Wrong Answer

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

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

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


Verdicts: Wrong Answer

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

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

x = N
for x in reversed(range(1,N+1)):
  if x % B != 0:
    print(int(A*x/B)-A*int(x/B))
    exit()

print(0)

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

x = N
for x in reversed(range(N)):
  if x % B != 0:
    print(int(A*x/B)-A*int(x/B))
    exit()


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

x = N
for i in range(N):
  if x % B != 0:
    print(int(A*x/B)-A*int(x/B))
    exit()
  else:
    x -= 1


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

x = N
for i in range(N):
  if x % B != 0:
    print(int(A*x/B)-A*int(x/B))
    exit()


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

for x in reversed(range(1,N+1)):
  if x % B != 0:
    print(int(A*x/B)-A*int(x/B))
    exit()

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

x = N
for x in reversed(range(1,N+1)):
  if x % B != 0:
    print(int(A*x/B)-A*int(x/B))
    exit()

    
print("0")


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

x = N
for x in reversed(range(1,N+1)):
  if x % B != 0:
    print(int(A*x/B)-A*int(x/B))
    exit()


print(0)

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

x = N
for x in reversed(range(1,N+1)):
  if x % B != 0:
    print(int(A*x/B)-A*int(x/B))
    exit()


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

x = N
for x in reversed(range(1,N+1)):
  if x % B != 0:
    print(int(A*x/B)-A*int(x/B))
    exit()

    
print(0)

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

Runtime Error

Runtime Error

Runtime Error

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):
a = int(input())
b, c = list(map(int, input().split()))
d = b//a
e = c//a
if not d == e:
    print("Yes")
else:
    print("No")

a = int(input())
b, c = int(list(map(int, input().split())))
d = b//a
e = c//a
if d == e:
    print("Yes")
else:
    print("No")

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

for i in range(1,1000):
  if a<=k*i and k*i<=b:
    print('OK')
    q=1
    

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

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

if a//k-b//k==1:
  print('OK')
else:
  print('NG')

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

for i in range(1,1000):
  if a<=k*i and k*i<=b:
    print('OK')
    q=1
    

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

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

if b/k-a/k==1 or b/k-a/k==0:
  print('OK')
else:
  print('NG')

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

for i in range(1,1000):
  if a<=k*i and k*i<=b:
    print('OK')
    q=1
    

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

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

for i in range(1,1000):
  if a<=k*i and k*i<=b:
    print('OK')
    q=1
    break

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

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

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

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

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

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

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

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

K = int(input())
A, B = map(int, input().split())
print("OK" if A <= B//K*K else "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())

if (A//K) != (B//K):
    print('Yes')
else:
    print('No')

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

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

Verdicts: Wrong Answer

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

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

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


def func_f(A,B,x):
    return -(int(A*x/B)-A*int(x/B))



def bisection(func_f, x_min, x_max, A, B, error=1e-10, max_loop=100):
    
    num_calc = 0  
    #print("{:3d}:  {:.15f} <= x <= {:.15f}".format(num_calc, x_min, x_max))
    
    
    if(0.0 < func_f(A,B,x_min)*func_f(A,B,x_max)):
        #print("error: Section definition is invalid (0.0 < func_f(x_min)*func_f(x_max)).")
        quit()

    
    while(True):
        
        x_mid = (x_max +x_min)/2.0
        
        x_mid_max = (x_max +x_mid)/2.0
        x_mid_mim = (x_min +x_mid)/2.0
        
        
        if func_f(A,B,x_max) < func_f(A,B,x_mid):
            x_min = x_mid
        elif func_f(A,B,x_min) < func_f(A,B,x_mid):
            x_max = x_mid
        elif func_f(A,B,x_mid_max) < func_f(A,B,x_mid_mim):  
            x_max = x_mid  
        else:  
            x_min = x_mid  
        
        
        num_calc += 1  を数える
#print("{:3d}:  {:.15f} <= x <= {:.15f}".format(num_calc, x_min, x_max))
        
        
        if((x_max-x_min <= error) or max_loop <= num_calc):
            break

    
    #print("x = {:.15f}".format(x_mid))

    return x_mid



if (__name__ == '__main__'):
    A,B,N=(int(x) for x in input().split())
    
    solution = bisection(func_f, 0, N,A,B)
    print(-func_f(A,B,solution))


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

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


k = int(input())
abs = [int(e) for e in input().split()]

for i in range(abs[0],abs[1]+1):
  if i % k == 0:
    print("OK")
    break
else :
  print("NG")


Verdicts: Runtime Error

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

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

k = int(input())
a, b = [int(e) for e in input().split()]

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

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

Verdicts: Wrong Answer

Wrong Answer

Accepted