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

K=int(input(""))
A, B = map(int, input().split())
V=False
C=K 

for i in range(0,B):
      K=C*i
      print(K)
      if K>=A and K<=B:
            V=True
            break
      else:
            V=False

if V==True:
      print("OK")
else:
      print("NG")

K=()
A=()
B=()

K=int(input(""))
A, B = map(int, input().split())
V=False
C=K
D=B+2

for i in range(0,D):
      K=C*i
      print(K)
      if K>=A and K<=B:
            V=True
            break
      else:
            V=False

if V==True:
      print("OK")
else:
      print("NG")

K=()
A=()
B=()

K=int(input(""))
A, B = map(int, input().split())
V=False
C=K
D=B+1

for i in range(0,D):
      K=C*i
      if K>=A and K<=B:
            V=True
            break
      else:
            V=False

if V==True:
      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 n in range(a,b):
  if n%K == 0:
    print("OK")
  else:
    print("NG")

k = int(input())
a,b = map(int,input().split())
if a % k != 0 and b % k != 0 and a//k == b//k:
  print("No")
else:
  print("Yes")

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

Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
A,B,N = map(int,input().split())
tmp=0
for i in range(N//2,N+1):
    floor = (A*i)//B-A*(i//B)
    if floor>tmp:
        tmp = floor
print(tmp)

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

for x in range(A, B):
  if x % K == 0 or K % x == 0:
    print('OK')
    break
  else:
    print('NG')

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

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

Verdicts: Wrong Answer

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

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

if ((A // K != B // K) || A % K == 0 || B % K == 0):
	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: 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 = 0

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



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

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

if K == 1:
  print("Yes")
else:
  if a == b:
    print("NG")
  else:
    print("Yes")


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

a = A/K
b = B/K

if A%K == 0 or B%K == 0:
  print("Yes")
else:
  if a == b:
    print("NG")
  else:
    print("Yes")


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

a = 0

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



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

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

if a == b:
  print("NG")
else:
  print("Yes")

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

a = 0

for i in range(A, B+1):
  if i%K == 0:
    a+=1
  else:
    pass
if a != 0:
  print("OK")
else:
  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):
X=int(input())
c=0
i=100
for a in range(100000000000000000):
    c+=1
    i=int(100*i*1.01/100)
    if i >=X:
        print(c)
        break
        

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


Verdicts: Wrong Answer

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

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

if A==B:
    if A%K==0:
        print("OK")
        sys.exit()
else:
    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())

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


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

if A==B:
    if A%K==0:
        print("OK")
        sys.exit()
else:
    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):
X = int(input())
n = 1

while int(100*(1.01**n)) < X:
    n += 1
else: print(n)
    

X = int(input())
n = 0
N = 100
while int(N) < X:
    N =int(N*1.01)
    n += 1
else: print(n)

X = int(input())
n = 1
N = 100
while int(N) < X:
    N =int(N*1.01)
    n += 1
else: print(n)

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

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

else:
    print("NG")
    

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

flug = 0

A = list(range(a, b+1))

for number in A:
    if number % k == 0:
        flug = 1
        
    else:
        continue

if flug == 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):
from math import floor

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



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


greatest_divisor = floor(B / K) * K
answer = 'OK' if greatest_divisor * K <= A else 'NG'

print(answer)


from math import floor

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



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


greatest_multiple = floor(B / K) * K
answer = 'OK' if A <= greatest_multiple else 'NG'

print(answer)


Verdicts: Wrong Answer

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

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

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



Verdicts: Wrong Answer

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

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

while k >= a:
    k += n

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

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

while k < a:
    k += n
print(k)

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

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

while k < a:
    k += n

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


Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
K = input()
A, B = [int(a) for a in input().split()]
p = A // K + K
if A < p and B < p:
    print("OK")
else:
    print("NG")

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

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


Verdicts: Runtime Error

Accepted
Problem: Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K, while he can only make a carry 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 (A,B):
  if (i % K) == 0:
    print('OK')
    exit()

print('NG')

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
a, b, n = map(int, input().split())
f = max(n, b-1)

print((a*f)//b -a*(f//b))

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

input_line = input()
Line = input_line.split()
Line = [int(s) for s in Line]



if Line[1]-Line[0] < N:
    print("No")
else:
    print("Yes")

import sys
N = int(input())
 
input_line = input()
Line = input_line.split()
Line = [int(s) for s in Line]

for i in range(Line[0],Line[1]+1):
    # print(i)
    if i % N == 0:
        print("OK")
        sys.exit()
print("NG")

Verdicts: Wrong Answer

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

Submission attempts (in order):
import sys
K = int(input())
a, b = map(int, input().split())
for i in range(a, b+1):
  if i%K == 0:
    print('Yes')
    sys.exit()
print('No')


import sys
K = int(input())
a, b = map(int, input().split())
for i in range(a, b+1):
  if i%K  0:
    print('Yes')
    sys.exit()
print('No')

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


Verdicts: Wrong Answer

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

print("NG")

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

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


if C == 1:
    print("OK")
else:
    print("NG")

Verdicts: Runtime Error

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

Submission attempts (in order):
K=int(input())
A, B = map(int, input().split())
a=A//K
b=A%K
c=B%K

if(b==0 or c==0):
  print("OK")
else:
  if(1<a):
    if(a*K<=B):
      print("OK")
    else:
      print("NG")
  else:
    print("NG")
~                  

K=int(input())
A, B = map(int, input().split())
a=A//K
b=A%K
c=B%K

if(b==0 or c==0):
  print("OK")
else:
  if(1<a):
    if(a*K<=B):
      print("OK")
    else:
      print("NG")
  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(input().split())

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

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

i=0

while True:
  if (a+i)%k==0:
    print('OK')
    break
  
  if  a+i==b:
    print('NG')
    break
  
  i+=1

Verdicts: Runtime Error

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

Submission attempts (in order):
K = int(input())
A,B = map(int, input().split())
N = int(1000 / K) + 1

OK = False

for n in range(1,N):
    print('{} {}'.format(int(A/n)+1, int(B/n)+1))
    if int(A/n) <= K and K <= int(B/n):
        OK = True
        
if OK == True:
    print('OK')
else:
    print('NG')

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

OK = False

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

if OK == True:
    print('OK')
else:
    print('NG')

Verdicts: Wrong Answer

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

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

max = B//K+1
print(max)
judge = 0

for i in range(max):
    if(i==0):
        continue

    if A<=K*i and K*i<=B:
        judge = 1
        break

if judge==1:
    print("OK")
else:
    print("NG")

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

i=A
length = B-A+1
judge = 0

for _ in range(length):
    if(i%K==0):
        judge = 1
        break

    i += 1
    
if judge==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()
distance = list(map(int,input().split()))

for i in range(distance[1]-distance[0]+1):
    if (distance[0]+i) % K == 0:
        print("OK")

print("NG")


import math

K = input()
distance = list(map(int,input().split()))

for i in range(len(distance)):
    if distance[i] % K == 0:
        print("OK")

print("NG")

import math
import sys

K = int(input())
distance = list(map(int,input().split()))


for i in range(distance[1]-distance[0]+1):
    if (distance[0]+i) % K == 0:
        print("OK")
        sys.exit()

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>=2:
    print("ok")
elif b/k>=2:
    print("ok")
else:
    print("NG")

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

if a/k>=2:
    print("OK")
elif b/k>=2:
    print("OK")
elif a%k==0:
    print("OK")
elif b%k==0:
    print("OK")
else:
    print("NG")

Verdicts: Wrong Answer

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

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

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

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

Verdicts: Runtime Error

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

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

for num in range(1,1000):
  if A <= K*num <= B:
    print('OK')
    break

print('NG') 

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

for num in range(1,1000):
  if A <= K*num <= 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):
A,B = map(int, input().split())

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

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

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

Verdicts: 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(b-a):
    c = a+i
    if c%k==0 :
        print("ok")
        break
    
    if c == b-1 :
        print("NG")


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

for i in range(b-a):
    c = a+i
    if c%k==0 :
        print("ok")
        break
    
    if c == b-1 :
        print("NG")
if b%k == 0:
    print("ok")
        

k = int(input())
a, b = map(int, input().split())
n = b-a
c = 0

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

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


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



Verdicts: Runtime Error

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

Submission attempts (in order):
import sys
# input
k = int(input())
a, b = map(int, input().split())
#print(f"k >>{k}, a >>{a}, b >>{b}")


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

print("NG")

import sys
# input
k = int(input())
a, b = map(int, input().split())
#print(f"k >>{k}, a >>{a}, b >>{b}")


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

print("NG")


Verdicts: Wrong Answer

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

Submission attempts (in order):
import numpy as np
a = int(input())
b,c=map(int,input().split())
while(True):
    for i in range(a, b+1):
        if i//a == 0:
            print('True')
            break
    print('NG')
print('OK')




import numpy as np
a = int(input())
b,c=map(int,input().split())
d = np.arange(a,1001,a)
f = np.arange(b,c+1)
d_set=set(d)
f_set=set(f)

g_set=d_set&f_set 

g=list(g_set)
if len(g) == 0:
    print('NG')
else:
    print('OK')

Verdicts: Time Limit Exceeded

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

Submission attempts (in order):
from sys import stdin
input = stdin.readline

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

maxpoint = 0
if b > n:
    for i in range(n+1):
        tmp = int((a * i) / b)  - a * int(i/b) 
        maxpoint = max(tmp,maxpoint)
else:
    for i in reversed(range(n+1)):
        tmp = int((a * i) / b)  - a * int(i/b) 
        if b > 1:
            if i % (b-1) == 0 :
                maxpoint = max(tmp,maxpoint)
                print(maxpoint) 
                exit()
        elif b == 1:
            print(0)
            exit()
        maxpoint = max(tmp,maxpoint)
        # print(maxpoint)

print(maxpoint)


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

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

Verdicts: Runtime Error

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

Submission attempts (in order):
def main():
    K=int(input())
    (A,B)=[int(x) for x in input().split()]
    if A % K == 0:
        print('OK')
    elif math.ceil(A/K)*K <= B:
        print('OK')
    else:
        print('NG')
 
if __name__ == '__main__':
    main()

import math

def main():
    K=int(input())
    (A,B)=[int(x) for x in input().strip().split()]
    if A % K == 0:
        print('OK')
    elif math.ceil(A/K)*K <= B:
        print('OK')
    else:
        print('NG')
 
if __name__ == '__main__':
    main()
    

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 < a:
  if k >= 2 and (b - a) >= k - 2:
    print("OK")
elif k == a or k == b:
  print("OK")
elif a < k  and k < b:
  print("OK")
print k == 1:
  print("OK")
else:
  print("NO")


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

if k >= 2 and b - a >= k - 1:
  print("OK")
elif k == a or k == b:
  print("OK")
elif a < k  and k < b:
  print("OK")
print k == 1:
  print("OK")
else:
  print("NO")


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

if k < a:
  if k >= 2:
    if b - a >= k - 1:
    print("OK")
elif k == a or k == b:
  print("OK")
elif a < k  and k < b:
  print("OK")
print k == 1:
  print("OK")
else:
  print("NO")


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

if k < a:
  if k >= 2:
    if b - a >= k - 2:
    print("OK")
elif k == a or k == b:
  print("OK")
elif a < k  and k < b:
  print("OK")
print k == 1:
  print("OK")
else:
  print("NO")


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

if k < a:
  if k >= 2:
    if b - a >= k - 1:
      print("OK")
elif k == a or k == b:
  print("OK")
elif a < k  and k < b:
  print("OK")
print k == 1:
  print("OK")
else:
  print("NO")


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

if k < a:
  if k >= 2 and b - a >= k - 2:
    print("OK")
elif k == a or k == b:
  print("OK")
elif a < k < b:
  print("OK")
print k == 1:
  print("OK")
else:
  print("NO")


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

if b - a >= k - 1:
  print("OK")
elif  k == 1:
  print("OK")
elif b == k or a == k:
  print("OK")
elif b % k == 0 or a % k == 0:
  print("OK")
elif a < k and k < b:
  print("OK")
elif a != b and k == 2:
  print("OK")
elif b < k:
  print("NG")
elif a % k > b % k:
  print("OK")
else:
  print("NG")



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


for i in range(1,1000):
    if K * i > 1000
        break
    if K * i >= A and K * i <=B:
        print('OK')
        exit()

print('NG')

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


for i in range(1,1000):
    if K * i > 1000:
        break
    if K * i >= A and K * i <=B:
        print('OK')
        exit()

print('NG')

Verdicts: Runtime Error

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

Submission attempts (in order):
K=int(input())
A,B=map(int,input().split())
ans='NG'
for i in range(A,B):
    if i%K==0:
        ans='YES'
        break
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='YES'
        break
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'
        break
print(ans)

Verdicts: Wrong Answer

Wrong Answer

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

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

for i in range(int(A/K), int(B/K)):
    if(i%K==0):
        print('OK')
        break
print('NG')

K = int(input())
A, B = map(int, input().split())
can=False
count = 1
a = K

while(a <= B):
    a = count * K
    count += 1
    
    if(a>=A and a<=B): can=True

if(can):print('OK')
else: print('NG')

Verdicts: Wrong Answer

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

Submission attempts (in order):
K=int(input().split())
A,B=map(int,input().split())
n=A//K
print("OK" if A<=K*n<=B or K*(n+1)<=B else "NG")

K=int(input())
A,B=map(int,input().split())
n=A//K
print("OK" if A<=K*n<=B or K*(n+1)<=B else "NG")

Verdicts: Runtime Error

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

Submission attempts (in order):
k = int(input())
a,b = map(int,input().split())
c = b - a
print(c)
lis = []
if k == 1:
    print("OK")
else:
    for i in range(c):
        lis.append(a + i % k)
    if lis.count(0) == 0:
        print("OK")
    else:
        print("NG")

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

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

if ans == "OK":
    print("OK")
else:
    print("NG")

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

ans = ""
for x in range(a, b+1):
    if x % k == 0:
        ans = "OK"
        break

if ans == "OK":
    print("OK")
else:
    print("NG")

Verdicts: Wrong Answer

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

Submission attempts (in order):
import sys

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

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


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

for i in range(A, B + 1):
  if i % K == 0:
    print('OK')
    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: 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):
# encoding:utf-8
import copy
import random
import bisect 
import fractions 
import math
import sys
import collections

mod = 10**9+7
sys.setrecursionlimit(mod) 

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

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

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

# encoding:utf-8
import copy
import random
import bisect 
import fractions 
import math
import sys
import collections

mod = 10**9+7
sys.setrecursionlimit(mod) 

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

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

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

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
k=int(input())
a,b=map(int,input().split())
print('Yes' if a//k-b//k or a%k==0 else 'No')

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


Verdicts: Wrong Answer

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

Submission attempts (in order):
import math

N = int(input())

# a,b=map(int,input().split())
sum = 100
i = 0

# while	sum < N:

# 	i += 1

while sum < N:
	sum += sum * 0.01
	i += 1
	sum = int(sum)

print(i)


K = input()
# A = input()
# B = input()

# a = int(A)

k = int(K)

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

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


Verdicts: Wrong Answer

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

Submission attempts (in order):
X = int(input())
S = 100
for i in range(1000000000000000):
    S += int((0.01) * S)
    if S >= X:
        print(i+1)
        break


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

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

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

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

flag = 0
for i in range(A,B + 1,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):
import math

x = int(input())
saving = 100
count = 0
while x > saving:
  saving = math.floor(saving + saving * 0.01)
  count += 1
print(count)

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

Verdicts: Wrong Answer

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

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

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

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

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

sum=0
for i in range(A,B+1,1):
    
    if i%K==0:
        sum+=1
if sum>=1:
    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())

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

l = K
ans = 'NG'
for l in range(K, 1001, K):
    print(l)
    if l >= A and l <= B:
        ans = 'OK'
        break
    elif l > B:
        break

print(ans)

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

l = K
ans = 'NG'
for l in range(K, 1001, K):
#     print(l)
    if l >= A and l <= B:
        ans = 'OK'
        break
    elif l > B:
        break

print(ans)

Verdicts: Wrong Answer

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

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

If A%K == 0 or B%K == 0
	print 'OK'

elif A <= K*(A//K + 1) and K*(A//K + 1) <= B :
	print 'OK'

else :
	print 'NG'


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

if A%K == 0 or B%K == 0
	print 'OK'

elif A <= K*(A//K + 1) and K*(A//K + 1) <= B :
	print 'OK'

else :
	print 'NG'


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

if A%K == 0 or  K*(A//K + 1) <= 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())
list_ = [(i+A) for i in range(B-A+1)]
print(list_)
count = 0
for i in range(len(list_)):
  if list_[i] % K == 0:
    count += 1
    break

if count > 0:
  print('OK')
else:
  print('NG')

K = int(input())
A, B = map(int, input().split())
list_ = [(i+A) for i in range(B-A+1)]
count = 0
for i in range(len(list_)):
  if list_[i] % K == 0:
    count += 1
    break

if count > 0:
  print('OK')
else:
  print('NG')

Verdicts: Wrong Answer

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

Submission attempts (in order):
from sys import stdin
import itertools
import numpy as np
from numba import njit

def main():

    readline=stdin.readline
    N,M,Q=map(int,readline().split())
    a=np.zeros(Q,dtype=np.int64)
    b=np.zeros(Q,dtype=np.int64)
    c=np.zeros(Q,dtype=np.int64)
    d=np.zeros(Q,dtype=np.int64)
    for i in range(Q):
        a[i],b[i],c[i],d[i]=map(int,readline().split())

    arrays=np.array(list(itertools.combinations_with_replacement(range(1,M+1),N)),dtype=np.int64)
    l=len(arrays)

    print(f(l,Q,a,b,c,d,arrays))
    
@njit("i8(i8,i8,i8[:],i8[:],i8[:],i8[:],i8[:,:])",cache=True)
def f(l,Q,a,b,c,d,arrays):
    max_res=0
    for i in range(l):
        res=0
        for j in range(Q):
            if arrays[i][b[j]-1]-arrays[i][a[j]-1]==c[j]:
                res+=d[j]
        max_res=max(max_res,res)
    return max_res

if __name__=="__main__":
	main()

from sys import stdin
def main():
    
    readline=stdin.readline
    K=int(readline())
    A,B=map(int,readline().split())
    if A%K==0:
        print("Yes")
    elif A//K<B//K:
        print("Yes")
    else:
        print("No")
if __name__=="__main__":
    main()

k=int(input())
a,b=map(int,input().split())
print("OK" if a<=b//k*k else "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 k == 1:
    print('Yes')
else:
    print('Yes' if (b-a)//k >= 1 else 'No')

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

print('OK' if b//k*k >= a else 'NG')

Verdicts: Wrong Answer

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

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

def g(t):
    return int(A*t/B)-A*int(t/B)

x=[i for i in range(0,N,1)]

y=[g(i) for i in x]

print(max(y))

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

def f(t):
    return int(t)

Max_x=0

for i in range(N):
    if f(A*i/B)-A*f(i/B)<f(A*(i+1)/B)-A*f((i+1)/B):
        Max_x=i+1
        
print(f(A*Max_x/B)-A*f(Max_x/B))

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

x=list(range(1,N+1,1))


if N%2==1:
    for i in range(M):
        print(x.pop(0),x.pop(-1))
        
else:
    x_f=x[1:int(N/2+1)]
    x_l=x[int(N/2+1):]
    
    
    count=0
    
    for i in range(M):
        if len(x_f)>1:
            print(x_f.pop(0),x_f.pop(-1))
            count+=1
            
        if count==M:
            break
        
        if len(x_l)>1:
            print(x_l.pop(0),x_l.pop(-1))
            count+=1
            
        if count==M:
            break

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

Ans='NG'

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

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

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

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()))
flag = 0
while(flag==0):
  if(A<=K and K<=B):
    flag = 1
    break
  K += K
if(flag==0):
  print("NG")
else:
  print("OK")

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

Verdicts: Time Limit Exceeded

Accepted