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

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

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

k = int(input())
a, b = map(int, input().split())
between = a - b + 1

if between >= k:
  print("OK")
else:
  print("NG")

k = int(input())
a, b = list(map, int(input()))
B = b + 1

for i in range(a, B):
  if i % k == 0:
    print("OK")
  else:
    print("NG")

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

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

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

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

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

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

Submission attempts (in order):
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())
count = 0

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

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

Verdicts: Wrong Answer

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

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

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

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

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

Verdicts: 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):
ut())
a, b = map(int, input().split(" "))
ngflag = True
while(a <= b):
    if a % k == 0:
        print("OK")
        ngflag = False
        break
    a += 1
if ngflag:
    print("NG")


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


K = int(input())
A,B = list(map(int, input().split()))
ans = "NG"
for i in range(B-A+1):
  Temp = A+i
  if(Temp%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())
 
if A%K==0 or B%K==0 or B-A >= K　and A <= K <= B:
  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
print("NG" if count==0 else "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 solve(a,b,k):
    for x in range(a,b+1):
        if a%k==0:
            return "OK"
    return "NG"

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

def solve(a,b,k):
    for x in range(a,b+1):
        if x%k==0:
            return "OK"
    return "NG"

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


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())
data = input.split()
a = data[0]
b = data[1]

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


k = int(input())
data = input().split()
a = int(data[0])
b = int(data[1])
 
ans = False
 
if abs(a - b) > k:
  ans = True
else:
  for i in range(a, b + 1):
    if i % k == 0:
      ans = True
      break
print("OK" if ans 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 = 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")
    end
print("NG")

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

Verdicts: Wrong Answer

Runtime Error

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

Submission attempts (in order):
k = int(input())
a, b = map(int, input().split())
c = a // k * k
if a <= c <= b or a <= (c+k) <= b:
    print('ok')
else:
    print('NG')


k = int(input())
a, b = map(int, input().split())
c = a // k * k
if a <= c <= b or a <= (c+k) <= b:
    print('OK')
else:
    print('NG')


Verdicts: Wrong Answer

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

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

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

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

if k <= b:
  if a <= k:
    print("OK")
else:
  print("NG")

x = int(input())
money = 100
year = 0

while money < x:
  money += (money // 100)
  year += 1
  
print(year)


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

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

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

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


#print(A)


for num in range(A, B):
  print(num)
  if num % K == 0:
    print("OK")
    sys.exit()


print("NG")


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


#print(A)


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


print("No")


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


#print(A)


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


print("NG")


Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
A,B,N=map(int,input().split())
import numpy as np
print(max([int(A*x/B)-A*int(x/B) for x in np.arange(0,N+1,max((B/A),1))])

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

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


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


print(is_ok(K, A, B))

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

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

print('OK' if is_ok(K, A, B) 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())

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


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

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

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

print("NG")


Verdicts: Wrong Answer

Wrong Answer

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

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


row1 = input()
row2 = input()
k = int(row1)
a = int(row2.split(' ')[0])
b = int(row2.split(' ')[1])
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())
print('OK' if B-A<=K else 'NG')

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

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

Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
n = int(input())
s,d = map(int,input().split())

c = 0
for i in range(s,d):
  if i % s == 0:
  	c = c + 1


if c != 0:
 	print("YES")
else:
  	print("NO")
    

n = int(input())
s,d = map(int,input().split())

c = 0
for i in range(s,d+1:
  if i % s == 0:
  	c = c + 1


if c != 0:
 	print("YES")
else:
  	print("NO")
    

n = int(input())
s,d = map(int,input().split())

c = 0
for i in range(s,d+1):
  if i % s == 0:
  	c = c + 1


if c != 0:
 	print("YES")
else:
  	print("NO")

n = int(input())
s,d = map(int,input().split())

c = 0
for i in range(s,d+1):
  if i % s == 0:
  	c = c + 1


if c != 0:
 	print("OK"
else:
  	print("NG")

n = int(input())
s,d = map(int,input().split())

c = 0
for i in range(s,d+1):
  if i % n == 0:
  	c = c + 1
  else:
    c = c
    
if c != 0:
 	print("OK")
else:
  	print("NG")

Verdicts: Wrong Answer

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

a_div_k = a // k
b_div_k = b // k

if b < k:
    print("NG")
elif k == 1:
    print("OK")
elif k == b:
    print("OK")
elif a_div_k == b_div_k:
    print("NG")
else:
    print("NG")


if k >= 1:
    print("OK")

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


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

a_div_k = a // k
b_div_k = b // k

a_mod_k = a % k
b_mod_k = b % k

if b < k:
    print("NG")
elif k == 1:
    print("OK")
elif k == b:
    print("OK")
elif (a_mod_k == 0) or (b_mod_k == 0) and (a_div_k == b_div_k):
    print("OK")
elif (k < a) and (a_div_k == b_div_k):
    print("NG")
else:
    print("OK")


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())
k_under, k_over = map(int,input(),split())
result　= 1
cnt = 0
while k * cnt > k_over:
	if k * cnt > k_under:
      print('OK')
      result = 0
    cnt += 1

if result == 1:
	print('NG')
    

k = int(input())
k_under, k_over = map(int,input().split())

if (k_under // k + ((k_under % k != 0) * 1)) * k > k_over:
    print('NG')
else:
    print('OK')

Verdicts: Runtime Error

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

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

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

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

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

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

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

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

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

k = int(input())


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

n = 0
a=100
while a < k:
    a= round(a*1.01)
    print(a)
    n+=1
print(n)


# -*- coding: utf-8 -*-
import math

k = int(input())


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

n = 0
a=100
while a < k:
    a= math.floor(a*1.01)
    n+=1
print(n)


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

k = int(input())


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

if k==1:
    print("OK")
elif a%k == 0:
    print("OK")
elif abs(a-b) + a%k >= k:
    print("OK")
# elif a//k != b//k:
#     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())
for i in range(a,b+1):
 if i%k == 0:
  print('OK')
  break
 else:
  print('NG')

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

Verdicts: 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=list(map(int,input().split()))
if 0 in A:
    print(0)
keta=1
for i in A:
    keta*=i
    if keta>1000000000000000000:
        print(-1)
    else:
        print(keta)

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
k = int(input())
a,b = map(int, input().split())
i=a
while i<=b:
  if i%k==0:
    print('Yes')
    exit(0)
  i+=1
print('No')

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

Verdicts: Wrong Answer

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

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

data = input().split()
a = int(data[0])
b = int(data[1])

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

k = int(input())

data = input().split()
a = int(data[0])
b = int(data[1])

while b >= a:
    if b % k == 0:
        print("OK",b)
        break
    b -= 1
    
if b < a:
    print("NO")

k = int(input())

data = input().split()
a = int(data[0])
b = int(data[1])

largest = b //k * k
if largest >= a:
    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())

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

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

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

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

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

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

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

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

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

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

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):
A, B, N = map(int, input().split())
Ymax=0
if A*N < B:
  print(0)
else:
  x = B-1
  Ymax = A*x//B - A*(x//B)
  print(Ymax)

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

Verdicts: 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())
x = 100
i = 0
while x < X:
    x += x//100 
    i += 1

print(i)

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

for i in range(1000):
    s = K * i
    if A <= s <= B:
        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):
def main():
    k = int(input())
    a, b = map(int, input().split())
    for i in range(a, b+1):
        if i%k == 0:
            print("Yes")
            return
    print("No")

if __name__ == "__main__":
    main()

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

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

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

Verdicts: Wrong Answer

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

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

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
import math
account = 100
goal = int(input())
count = 0

while True:
  count += 1
  account = math.floor(account * 1.01)
  if account >= goal:
  	break
print(count)

account = 100
goal = int(input())
count = 0

while True:
  count += 1
  account *= 1.01
  if account >= goal:
  	break
print(count)

import math
account = 100
goal = int(input())
count = 0

while True:
  count += 1
  account = math.floor(account * 1.01)
  if account >= goal:
  	break
print(count)

base = int(input())
min,max = map(int, input().split())
for num in range(min,max+1):
  if num % base == 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):
K = int(input())
A,B =list(map(int,input().split()))
count =0
while count * K<A:
	count +=1
if count *K <=B:
	print("OK")
else
	print("NG")

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


Verdicts: Runtime Error

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

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


for i in range(1000):
    if A >= i*K >= B:
        print("OK")
        break
    elif i*K > B:
        print("NG")
        break


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


for i in range(1000):
    if B >= i * K >= A:
        print("OK")
        break
    elif i*K > B:
        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):
x=int(input())
n=100
ans=0
while True:
  if 10000*(pow(1.01,ans)-1)>=x:
    print(ans)
    exit()
  ans+=1

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):
S = int(input())
A,B = map(int,input().split())
check = false
ans = 0
i = 1
while S <= B:
  ans = S * i
  if A <= ans and B >= ans:
    check = true
    break
if check:
  print('OK')
else:
  print('NG')


S = int(input())
A,B = map(int,input().split())
check = false
while S <= B:
  S *= S
  if A <= S and B >= S:
    check = true
    break
if check:
  print('OK')
else:
  print('NG')

S = int(input())
A,B = map(int,input().split())
check = False
ans = 0
i = 1
while ans <= B:
  ans = S * i
  if A <= ans and B >= ans:
    check = True
    break
  i += 1
if check:
  print('OK')
else:
  print('NG')

Verdicts: Runtime Error

Runtime Error

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

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

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

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())
f = [int(A*x/B) - (A * int(x/B)) for x in range(N+1)]
print(max(f))

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

K = int(input())
A, B = map(int, input().split())
largest = int(B/K) * K
if largest >= A:
  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-B) >= K:
    print("OK")
else:
    for a in range(1000):
        if a * K >= A:
            if a * K <= B:
                print("OK")
    else:
        print("NG")


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

for a in range(1000):
    if a * K >= A:
        if a * K <= B:
            print("OK")
            break
else:
    print("NG")

Verdicts: Wrong Answer

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

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

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

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

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

# if A==B:
#     if A % K ==0:

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

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

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

# if A==B:
#     if A % K ==0:

for i in range(A,B+1,1):
    #print(i)
    if i % K == 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 = [int(x) for x in input().split()]
ans = "NG"
for i in range(1000):
  if a <= i * k and i * k <= b:
    ans = "OK"
    break
print(ans)

k = int(input())
a,b = [int(x) for x in input().split()]
ans = "NG"
for i in range(1000):
  if a <= i * k and i * k <= b:
    ans = "OK"
    break
print(ans)

Verdicts: Runtime Error

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

Submission attempts (in order):
k=int(input())
a,b=map(int, input().split())
ok=False
for i in range(a, b+1):
  ok = ok or i % k
print(['NG','OK'][ok])

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

K=int(input())
A,B=list(map(int,input().split()))
n=int(A/K)
m=int(B/K)
if K==1:
  print("OK")
elif A/K-n==0.0 or B/K-m==0.0:
  print("OK")
elif n-m>=1:
  print("OK")
else:
  print("NG")

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

K=int(input())
A,B=list(map(int,input().split()))
n=int(A/K)
m=int(B/K)
if K==1:
  print("OK")
elif A/K-n==0.0 or B/K-m==0.0:
  print("OK")
elif m-n>=1:
  print("OK")
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):
K = int(input())
A, B = map(int,input().split())
flag = 0

while(K <= B):
  if(K >= A):
    print("OK")
    flag = 1
    break
  else:
    K += K
if(flag == 0):
  print("NG")

  

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

while(K <= B):
  if(K >= A):
    print("OK")
    flag = 1
    break
  else:
    K += num
if(flag == 0):
  print("NG")

  



Verdicts: Wrong Answer

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

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

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

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

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

for i in range(b,c+1):
    if i%a==0:
        juge=+1
        break
    else:
        continue

print("Yes" if juge==1 else "NG")

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

for i in range(b,c+1):
    X.append(i%a)

if 0.0 in X:
    print("Yes")
else:
    print("NG")

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

for i in range(b,c+1):
    X.append(i%a)

if 0 in set(X):
    print("Yes")
else:
    print("NG")

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

for i in range(b,c+1):
    if i%a==0:
        juge=+1
        break
    else:
        continue

print("Yes" if juge==1 else "NG")

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

for i in range(b,c+1):
    X.append(int(i%a))

if 0 in X:
    print("Yes")
else:
    print("NG")

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

for i in range(b,c+1):
    if i%a==0:
        juge=+1
        break

print("OK" if juge==1 else "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=list(map(int,input().split()))
b=k*(a[0]//k)
print(b)
if b==a[1]:
    print('OK')
elif b+k<=a[1]:
        print('OK')
else:
        print('NG')

k=int(input())
a=list(map(int,input().split()))
b=k*(a[0]//k)
if b==a[0]:
    print('OK')
elif b+k<=a[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 os
import sys
from collections import deque
from collections import Counter
from heapq import heappop,heappush

def main():
	k = int(input())
	a,b = map(int, input().split())
	if a == b:	
		print("Yes")
		sys.exit()
	if b - a >= k:
		print("Yes")
	else:
		print("NO")

if __name__ == "__main__":
	main()


import os
import sys
from collections import deque
from collections import Counter
from heapq import heappop,heappush

def main():
	k = int(input())
	a,b = map(int, input().split())
	if b - a >= k or b - a == 0:
		print("Yes")
	else:
		print("NO")

if __name__ == "__main__":
	main()


import os
import sys
from collections import deque
from collections import Counter
from heapq import heappop,heappush

def main():
	k = int(input())
	a,b = map(int, input().split())
	sub = b - a
	if sub == 0:
		print("OK")
		sys.exit()
	if sub <= k:
		print("OK")
		sys.exit()
	else:
		print("NG")
		sys.exit()



if __name__ == "__main__":
	main()


import os
import sys

def main():
	k = int(input())
	a,b = map(int, input().split())
	list_a = []
	if b == a:
		print("OK")
		sys.exit()

	for i in range(b,a-1,-1):
		list_a.append(i)
	print(list_a)
	for i in list_a:
		if i%k == 0:
			print("OK")
			sys.exit()
	print("NG")

if __name__ == "__main__":
	main()


import os
import sys
from collections import deque
from collections import Counter
from heapq import heappop,heappush

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

if __name__ == "__main__":
	main()



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())
n=1
while k*n<=b:
  n+=1
print('OK' if 100<=(n-1)*k<=120 else 'NG')

k=int(input())
a,b=map(int,input().split())
n=1
while k*n<=b:
  n+=1
print('OK' if a<=(n-1)*k<=b 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())
i = 0
while i*k <= b:
    print(i*k)
    if a <= i*k <= b:
        print("OK")
        break
    i += 1
else:
    print("NG")


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


Verdicts: Wrong Answer

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

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

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

k = int(K)
a = int(A)
b = int(B)
while True:

    for i in range(1000):
        kk = k * i
        if kk >= a and kk <= b:
            p = "OK"
    break
p = "NG"


print(p)

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

k = int(K)
a = int(A)
b = int(B)

p = "NG"
for i in range(1000):
    kk = k * i
    if (kk >= a and kk <= b) or k == 1:
        p = "OK"



print(p)


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())
maxs=0
if a>=b:
    if n>=b:
        maxs=a/b*(b-1)-(a%b*(b-1))%b/b
    else:
        maxs=a/b*n-(a%b*n)%b/b
else:
    if n>=b:
        maxs=(a*(b-1))//b
    else:
        maxs=(a*n)//b
print(int(maxs))

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

a,b,n=map(int,input().split())
maxs=0
if a>=b:
    if n>=b:
        maxs=a/b*(b-1)-(a%b*(b-1))%b/b
    else:
        maxs=a/b*n-(a%b*n)%b/b
else:
    if n>=b:
        maxs={a*(b-1)}//b
    else:
        maxs={a*n}//b
print(int(maxs))

k=int(input())
a,b=map(int,input().split())
if a%k==0:
    print('OK')
else:
    
    if a//k*k+k<=b:
        print('OK')
    else:
        print('NG')

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

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

Verdicts: Runtime Error

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

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

import random
import numpy as np


N, M = [int(x) for x in input().split()]


def try_get(N: int, M: int) -> (bool, list):
    used_flag = np.zeros(N)
    stage_marks = []  # [(v1,v2)]
    ones = np.ones(N)
    for length in reversed(range(1, M+1)):
        numbers = np.arange(N - length) + 1
        numbers = numbers[np.logical_and(used_flag[:(N-length)]==0,used_flag[length:N]==0)]
        if len(numbers) == 0:
            return False, []
        num = np.random.choice(numbers)
        stage_marks.append((num, num + length))
        used_flag[num-1] = 1
        used_flag[num+length-1] = 1

    return True, stage_marks


ok = False
marks = []
while not ok:
    ok, marks = try_get(N, M)

for src, dst in marks:
    print("{} {}".format(src, dst))


#!/usr/bin/env python3

import random
import numpy as np


N, M = [int(x) for x in input().split()]


def try_get(N: int, M: int) -> (bool, list):
    used_flag = np.zeros(N)
    stage_marks = []  # [(v1,v2)]
    ones = np.ones(N)
    for length in reversed(range(1, M+1)):
        numbers = np.arange(N - length) + 1
        numbers = numbers[np.logical_and(used_flag[:(N-length)]==0,used_flag[length:N]==0)]
        if len(numbers) == 0:
            return False, []
        num = np.random.choice(numbers)
        stage_marks.append((num, num + length))
        used_flag[num-1] = 1
        used_flag[num+length-1] = 1

    return True, stage_marks


ok = False
marks = []
while not ok:
    ok, marks = try_get(N, M)

for src, dst in marks:
    print("{} {}".format(src, dst))



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

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

Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
k=int(input())
a,b=map(int,input().split())
 
for i in 1000:
 if a<=k*i<=b:
  print("OK")
 else:
  pass
print("NG")

k=int(input())
a,b=map(int,input().split())
 
for i in range(10000):
 if a<=k*i<=b:
  print("OK")
 else:
  pass
print("NG")

k=int(input())
a,b=map(int,input().split())
 
for i in range(1000):
 if a<=k*i<=b:
  print("OK")
 else:
  pass
print("NG")

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

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

k=int(input())
a,b=map(int,input().split())
 
for i in range(10000):
 if a<=k*i<=b:
  print("OK")
  exit()
 else:
  pass
print("NG")

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

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

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

for i in range(1000):
    if k*i >= a and k*i=<b:
        print("OK")
        exit()
    if k*i > b:
        break

print("NG")

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

for i in range(1001):
    if k*i >= a and k*i<=b:
        print("OK")
        exit()
    if k*i > b:
        break

print("NG")

Verdicts: Runtime Error

Accepted