Problem:


Score: 100 points

Problem Statement

Takahashi the Jumbo will practice golf.

His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).

If he can achieve the objective, print OK; if he cannot, print NG.

Constraints

All values in input are integers.

1 \leq A \leq B \leq 1000

1 \leq K \leq 1000

Input

Input is given from Standard Input in the following format:

K
A B

Output

If he can achieve the objective, print OK; if he cannot, print NG.

Sample Input 1

7
500 600

Sample Output 1

OK

Among the multiples of 7, for example, 567 lies between 500 and 600.

Sample Input 2

4
5 7

Sample Output 2

NG

No multiple of 4 lies between 5 and 7.

Sample Input 3

1
11 11

Sample Output 3

OK



Sample input:
7
500 600


Sample output:
OK

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A=list(map(int, input().split()))

if A[1]-A[0]+1>=N:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
K = input()
A,B = input().split()

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

x = a // k
z = b // k

for i in range(z-x + 1):
  if a <= k*(x+i) and k*i <= b:
        print("OK")
        exit()
  print("NO")

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

Solution code:
k = input()
a, b = input().split()

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

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

if ((B-A) < K) and (A%K > (K + (B-A))) or (B%K < (K - (B-A))):
  print("NG")

else:
  print("OK")

Submission status: Wrong Answer

Solution code:
import numpy as np
s= int(input())
List = list(map(int, input().split()))
array = list()
for i in range(List[0],List[1]):
    if s == 1:
        array.append("OK")
        break
    if i % s == 0:
        array.append("OK")
        break
if ('OK' in array):
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a1=float(a/k)
b1=float(b/k)
a2=a%k
b2=b%k

if a2==0 or b2==0:
    print("OK")
elif (b-a)//k>=1:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
K=int(input())
A,B=map(int,input().split())
a=A//K
b=B//K
def f(x):
    return x//1
if f(b)-f(a)>=1:
    print("OK")
elif A//K==0:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
import math as M
k = int(input())
a, b = map(int, input().split())

a_1 = M.floor(a % k)
b_1 =  M.floor(b % k)

if a % k == 0 :
    print('OK')
elif b / k < 1 :
    print('NG')
elif b_1 - a_1 > 1 :
    print('NG')
else :
    print('OK')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import numpy as np
s= int(input())
List = list(map(int, input().split()))
array = list()
for i in range(List[0],List[1]):
    if s == 1:
        array.append("OK")
        break
    if i % s == 0:
        array.append("OK")
        break
    else:
        array.append("NG")
if ('OK' in array):
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
k= int(input(). strip())
a, b = map(int,input().split())

num = a
while num < b:
    if num % k != 0:
        num += 1
    else:
        print('OK')
        break
else:
	print('NG')

Submission status: Wrong Answer

Solution code:
K = input()
A,B = input().split()

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

x = a // k
z = b // k

for i in range(z-x + 1):
  if a <= k*(x+i) and k*i <= b:
    print("OK")
    exit()

Submission status: Wrong Answer

Solution code:
k = int(input())
num = list(map(int, input().split()))
checker = False
for i in num:
  if i%k == 0:
    checker = True
    break
print("OK" if checker else "NG")

Submission status: Wrong Answer

Solution code:
K = input()
A,B = input().split(" ")
if int(B)-int(A) >= int(K)-1 or int(A)%int(K) > int(B)%int(K) or int(K)==int(A)==int(B):
  print("ok")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
k= int(input())
x,y = map(int,input().split())
if 1<=x<=y<=1000 and 1<=k<=1000:
    pass



    if x%k>>0 :
        if x<= (x/k+1)*k <=y :
            print('OK')
        else:
            print('NG')
    else:
        print('OK')

else:
    print('NG')

Submission status: Wrong Answer

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

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

C = 0

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

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

Solution code:
k = input()
a, b = input().split()

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

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

if ((B-A) < K) and (A%K < (B-A)) and (B%K > (B-A)):
  print("NG")

else:
  print("OK")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
num = int(input())
a,b = map(int, input().split())
if (a//num+1)*num <= b:
  print('OK')
elif num==1:
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

Solution code:

def main():
    K = int(input())
    A, B = map(int, input().split())
    hiku = B - A
    if hiku - K >= 0:
        #if hiku / K >= 1:
        #if hiku - K >= 0:
        print("OK")
        exit(0)
    elif hiku == 0:
        if A % K == 0:
            print("OK")
            exit(0)
    print("NG")


main()

Submission status: Wrong Answer

Solution code:
n=int(input())
def f(n):
    a=0
    b=100
    while True:
        a+=1
        b*=(100+a)/100
        if b>=n:
            break
    return a
  
print(f(n))

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

Solution code:
import numpy as np
s= int(input())
List = list(map(int, input().split()))
array = list()
for i in range(List[0],List[1]):
    if s == 1:
        print("OK")
        break
    if i % s == 0:
        print("OK")
        break
    else:
        array.append("NG")
if not ('OK' in array):
    print("NG")

Submission status: Wrong Answer

Solution code:
K = input()
A,B = input().split()

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

x = a // k
z = b // k

for i in range(z-x + 1):
  if a <= k*i and k*i <= b:
    print("OK")
    exit()

Submission status: Wrong Answer

Solution code:
from sys import stdin

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

if ((B-A) < K) and (A%K > (B-A)) and (B%K < (B-A)):
  print("NG")

else:
  print("OK")

Submission status: Wrong Answer

Solution code:
K=int(input())
A,B=map(int,input().split())
a=A//K
b=B//K
def f(x):
    return x//1
if f(b)-f(a)>=1:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
from sys import stdin

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

if ((B-A) < K) and (A%K > (B-A)) and (B%K > (B-A)):
  print("NG")

else:
  print("OK")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

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

ans = 'NG'

h = b-a+1

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

print(ans)

Submission status: Wrong Answer

Solution code:
k = int(input())

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

x = a // k
if x != a:
  k = k*(x+1)
else:
  k = k*x

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:

k = int(input())
a,b = (map(int,input().split()))
new_list = []
for i in range(a,b+1):
    if i%k == 0:
        new_list.append('yes')
    else:
        new_list.append('NO')
if len(set(new_list)) == 1:
    print('NG')
elif len(set(new_list)) == 2:
    print('OK')

Submission status: Wrong Answer

Solution code:
import math as M
k = int(input())
a, b = map(int, input().split())

a_1 = M.floor(a % k)
b_1 =  M.floor(b % k)

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

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

if ((B-A) < K) and (A%K < (B-A)) and (B%K < (B-A)):
  print("NG")

else:
  print("OK")

Submission status: Wrong Answer

Solution code:
k = int(input())
a,b = map(int,input().split())
x = 0
if (b-a)//k>=1:
    print("OK")
elif k==1 and b-a>=0:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
import numpy as np
a = int(input())
b,c=map(int,input().split())
d = np.arange(7, 995, 7)
f = np.arange(b,c+1)
d_set=set(d)
f_set=set(f)
#dとfに共通するものを抽出
g_set=d_set&f_set 
#結果をlistに変換
g=list(g_set)
if len(g) == 0:
    print('NG')
else:
    print('OK')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

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

ans = 'NG'

h = b-a+1

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

print(ans)

Submission status: Wrong Answer

Solution code:

k = int(input())
a,b = (map(int,input().split()))
new_list = []
for i in range(a,b+1):
    if i%k == 0:
        new_list.append('yes')
    else:
        new_list.append('NO')
if len(set(new_list)) == 1:
    print('NG')
else:
    print('OK')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:

#提出時にコメントアウトを外す。
k = int(input())
ab = list(map(int, input().split()))



#作業用。ここは、作業最後に、コメントアウトする。
#k = 1
#ab = [1, 1]


#kの倍数をリストに格納する。
k_times = []
for i in range(1, 1001):
    m = i * k
    if m > 1000:
        break
    k_times.append(m)
#print(k_times)

#aからbの連続数リストを作る。
ab_list = []
a = ab[0]
b = ab[1]
if b == 1000:
    b = 1001
for j in range(a , b):
    ab_list.append(j)
if a == b:
    ab_list.append(a)
#print(ab_list)

k_ab_and = set(k_times) & set(ab_list)

#lenのチェック用
#print(len(k_ab_and))

num_result = len(k_ab_and)

if num_result > 0:
    print('OK')

elif num_result == 0:
    print('NG')

Submission status: Wrong Answer

Solution code:
import sys
#sys.exit()
#sorted( ,reverse=True)
K = int(input())
A,B = map(int, input().split())
#print( A/K ,B/K)
if A/K and B/K >=2:   
    
#A = list(map(int, input().split()))

    print('OK')
elif A < 2*K < B:
    print('OK')

else:
    
    print('NG')

#print(A)
#print('Yes')
#print('No')

Submission status: Wrong Answer

Solution code:
K = int(input())
A,B = map(int, input().split())
 
if A%K == 0 or B%K == 0 or (B-A)/K >= 1:
  print('OK')
elif K < B:
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

Solution code:
import numpy as np
a = int(input())
b,c=map(int,input().split())
d = np.arange(7, 995, 7)
f = np.arange(b,c)
d_set=set(d)
f_set=set(f)
#dとfに共通するものを抽出
g_set=d_set&f_set 
#結果をlistに変換
g=list(g_set)
if len(g) == 0:
    print('NG')
else:
    print('OK')

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
counter = 0
x = int(input())
yokin = 100

while x > yokin:
  yokin = int(yokin * 1.01)
  counter += 1

print (counter)

Submission status: Wrong Answer

Solution code:
K = input()
A,B = input().split(" ")
if int(B)-int(A) >= int(K)-1 or int(A)%int(K) > int(B)%int(K):
  print("ok")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
import sys
K = int(input())
A, B = map(int, input().split())
if A == B:
  if A%K == 0:
    print('OK')
    sys.exit()
  else:
    print('NG')
    sys.exit()

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

Submission status: Wrong Answer

Solution code:
N = int(input())
i = list(map(int, input().split())) 
if i[1] - i[0] >= N - 1:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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')

Submission status: Wrong Answer

Solution code:
K = int(input())
AB = list(map(int,input().split()))
sa = AB[1] - AB[0]
sa1 = AB[0] + sa

if( sa1 / K > 1 ):
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

is_ok = 0

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

Submission status: Wrong Answer

Solution code:
K = int(input())
a,b = map(int,input().split())
 
ka = a/K
kb = b/K
kaama = a%K
kbama = b%K
 
 
 
if kaama == 0 or kbama == 0:
  print("OK")
  
elif (kb-ka)>=1:
  print("OK")
  
else:
  print("NG")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
k = input()
a, b = input().split()

for cnt in range(int(b)):

    if cnt+1 >= int(a):
        if cnt+1 % int(k) == 0 or int(k) == 1:
            print("OK")
            exit()
print("NO")

Submission status: Wrong Answer

Solution code:
k= int(input())
x,y = map(int,input().split())
if 1<=x<=y<=1000 and 1<=k<=1000:
    pass



if x%k>>0 :
    if x<= (x/k+1)*k <=y :
        print('OK')
    else:
        print('NG')
else:
    print('OK')

Submission status: Wrong Answer

Solution code:

#提出時にコメントアウトを外す。
k = int(input())
ab = list(map(int, input().split()))



#作業用。ここは、作業最後に、コメントアウトする。
#k = 8
#ab = [1000, 1000]


#kの倍数をリストに格納する。
k_times = []
for i in range(1, 1000):
    m = i * k
    if m > 1000:
        break
    k_times.append(m)
#print(k_times)

#aからbの連続数リストを作る。
ab_list = []
a = ab[0]
b = ab[1]
if b == 1000:
    b = 1001
for j in range(a , b):
    ab_list.append(j)
if a == b:
    ab_list.append(a)
#print(ab_list)

k_ab_and = set(k_times) & set(ab_list)

#lenのチェック用
#print(len(k_ab_and))

num_result = len(k_ab_and)

if num_result > 0:
    print('OK')

elif num_result == 0:
    print('NG')

Submission status: Wrong Answer

Solution code:
K = int(input())
AB = list(map(int,input().split()))
sa = AB[1] - AB[0]

if( sa / K > 1 ):
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

Solution code:

#提出時にコメントアウトを外す。
k = int(input())
ab = list(map(int, input().split()))



#作業用。ここは、作業最後に、コメントアウトする。
#k = 8
#ab = [1000, 1000]


#kの倍数をリストに格納する。
k_times = []
for i in range(1, 1000):
    m = i * k
    if m > 1000:
        break
    k_times.append(m)
#print(k_times)

#aからbの連続数リストを作る。
ab_list = []
a = ab[0]
b = ab[1]
if b == 1000:
    b = 1001
for j in range(a , b):
    ab_list.append(j)
if a == b:
    ab_list.append(a)
print(ab_list)

k_ab_and = set(k_times) & set(ab_list)

#lenのチェック用
#print(len(k_ab_and))

num_result = len(k_ab_and)

if num_result > 0:
    print('OK')

elif num_result == 0:
    print('NG')

Submission status: Wrong Answer

Solution code:
K=int(input())
A,B=map(int,input().split())
i=1
ok=0
while i*K <= B:
    if A <= i*K:
        print("OK")
        ok=1
    i=i+1
if ok!=1:
    print("NG")

Submission status: Wrong Answer

Solution code:
from sys import stdin

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

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

Solution code:
k= int(input())

x,y = map(int,input().split())
if 1<=x<=y<=1000 and 1<=k<=1000:
    pass



    if x%k>>0 :
        if x<= (x/k+1)*k <=y :
            print('OK')
        else:
            print('NG')
    else:
        print('OK')

else:
    print('NG')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

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

ans = 'NG'

if k >= b:
    ans ='NG'
elif b - a + 1 >= k:
    ans = 'OK'

print(ans)

Submission status: Wrong Answer

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

print("NG")

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = list(map(lambda x: int(x), input().split(' ')))

while True:
  if (b - a) < 0:
    break
  if k <= 0:
    break
  if (a % k) == 0:
    print('OK')
    exit()
  if (int(a / k) + 1) <= b:
    print('OK')
    exit()
  break
 
print('NG')
exit()

Submission status: Wrong Answer

Solution code:
K = int(input())
A,B = map(int, input().split())
 
if A%K == 0:
  print('OK')
elif B%K == 0:
  print('OK')
elif (B-A)/K >= 1:
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

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

C=B-A

if K<=C+1:
    print('OK')
elif A%K==0:
    print('OK')
elif B%K==0:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
k = input()
a, b = input().split()

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

Submission status: Wrong Answer

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

r = A // K
d = A % K

if d == 0 or K * r + d + K <= B or B % K == 0 :
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
d=0
v=0
for i in range(1001):
    d=k*i
    if d>=a and d<=b:
        v+=1

if v>=1:
    print("OK")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
K = int(input())
AB = list(map(int, input().split()))
A = AB[0]
B = AB[1]
if A % K == 0 or B % K == 0 or (B - A) / K >= 1:
	print("OK")
else:
	print("NG")

Submission status: Wrong Answer

Solution code:
def main():
    K = int(input())
    A, B = map(int, input().split())
    hiku = B - A
    if hiku > 0:
        if hiku / K >= 1:
            print("OK")
            exit(0)
    elif hiku == 0:
        if A % K == 0:
            print("OK")
            exit(0)
    print("NG")


main()

Submission status: Wrong Answer

Solution code:
import sys
#sys.exit()
#sorted( ,reverse=True)
K = int(input())
A,B = map(int, input().split())

if A//K >=2 and B//K >= 2: 
    
#A = list(map(int, input().split()))

    print('OK')

else:
    
    print('NG')
#print( A//K ,B//K)
#print(A)
#print('Yes')
#print('No')

Submission status: Wrong Answer

Solution code:
# -*- 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)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

Solution code:
K = int(input())

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

b = B % K

x = A - b

if x >= 0:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

Solution code:
from sys import stdin

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

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

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
if k<=2:
    print("OK")
elif b-a>=k:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
K = int(input())

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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

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

ans = 'NG'

if b - a + 2 >= k:
    ans = 'OK'

print(ans)

Submission status: Wrong Answer

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

C=B-A+1

if K>=C+1:
    print('OK')
elif A%K==0:
    print('OK')
elif B%K==0:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
d=0
v=0
for i in range(1001):
    d=k*i
    if d>=a and d<=b:
        v+=1
        break

if v>=1:
    print("OK")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int,input().split())
if(A==B):
 if(A%K==0):
  print("OK")
 else:
  print("NG")
else :
 if((B//K)-(A//K) > 0):
  print("OK")
 elif( (B%K)-(A%K) >= K):
  print("OK")
 else :
  print("NG")

Submission status: Wrong Answer

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

if (K == 1):
  print('OK')
elif (B < K):
  print('NG')
elif(A <= K):
    print('OK')
elif(K < A):
  q = A // K
  if(K * (q + 1) <= B):
    print('OK')
  else:
    print('NG')

Submission status: Wrong Answer

Solution code:
K=int(input())
A,B = map(int,input().split())
if A+K <= B or A%K==0:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
from sys import stdin

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
K = int(input())

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

b = B % K

x = A - b

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

Submission status: Wrong Answer

Solution code:

#提出時にコメントアウトを外す。
k = int(input())
ab = list(map(int, input().split()))



#作業用。ここは、作業最後に、コメントアウトする。
#k = 1
#ab = [11, 11]


#kの倍数をリストに格納する。
k_times = []
for i in range(1, 1000):
    m = i * k
    if m > 1000:
        break
    k_times.append(m)
#print(k_times)

#aからbの連続数リストを作る。
ab_list = []
a = ab[0]
b = ab[1]
for j in range(a , b):
    ab_list.append(j)
if a == b:
    ab_list.append(a)
#print(ab_list)

k_ab_and = set(k_times) & set(ab_list)

#lenのチェック用
#print(len(k_ab_and))

num_result = len(k_ab_and)

if num_result > 0:
    print('OK')

elif num_result == 0:
    print('NG')

Submission status: Wrong Answer

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

if a == b:
    if a % n == 0:
        print('OK')
    else:
        print('NG')
else:
    while a < b:
        a += 1
        if a % n == 0:
            print('OK')
            break
        elif a == b:
            print("NG")

Submission status: Wrong Answer

Solution code:
import sys

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

wk = a
while wk <=b:
    if wk%k==0:
        print('Ok')      
        sys.exit()   
    else:
        wk+=1
print('NG')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
d=0
v=0
for i in range(1001):
    d=k*i
    if d>=a and d<=b:
        v+=1
        break

if v==1:
    print("OK")
else:
    print("NO")

Submission status: Wrong Answer

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

c = 0

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

Submission status: Wrong Answer

Solution code:
k = input()
a, b = input().split()

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

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

Submission status: Wrong Answer

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

r = A // K
d = A % K

if d == 0 or K * r + d + K <= B:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
from sys import stdin

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

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

Submission status: Wrong Answer

Solution code:
n=int(input())
a,b=map(int,input().split())
if a==b and a%n==0:
     print("OK")
elif a==b and a%n!=0:
    print("NG")
elif (b-a+1)/n>=1:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
K=int(input())
A,B = map(int,input().split())
if A+K < B:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

a_1 = a % k
b_1 = b % k

if a % k == 0 :
    print('OK')
elif b_1 > a_1  :
    print('NG')
else :
    print('OK')

Submission status: Wrong Answer

Solution code:
K = int(input())

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

li = []

while A <= B:
  li.append(A)
  
  A += 1
  
  if A % K == 0:
      print("OK")
      break
  
  else:
      continue
  
if A == B + 1:
    print("NG")

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

Solution code:
k = int(input())
a,b = map(int,input().split())
count = ''
if a % k == 0 or b % k == 0 :
    count = 'OK'
else :
    for c in range(a,b) :
        if c % k == 0 :
            count = 'OK'
            break
        else :
            count = 'NG'
print(count)

Submission status: Wrong Answer

Solution code:
# -*- 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)

Submission status: Wrong Answer

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

if a == b:
    if a % n == 0:
        print('OK')
    else:
        print('NG')
else:
    while a < b:
        a += 1
        if a % n == 0:
            print('OK')
            break
        elif a == b:
            print("NG")
            break