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:
#include <CodeforcesSolutions.h>
#include <ONLINE_JUDGE <solution.cf(contestID = "1362",problemID = "B",method = "GET")>.h>
"""
    Author : thekushalghosh
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time,random
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################

def solve():
    k = inp()
    a,b = invr()
    if a <= k // a * (a + 1) <= b:
        print("OK")
    else:
        print("NG")
                
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return(q)

def power_two(n):
    if n == 1:
        return(True)
    sttr = str(n)
    len_str = len(sttr)
    sttr = list(sttr)
    num = 0
    if (len_str == 1 and sttr[len_str - 1] == '1'): 
        return(False)
    while (len_str != 1 or sttr[len_str - 1] != '1'):
        if ((ord(sttr[len_str - 1]) - ord('0')) % 2 == 1):
            return(False)
        j = 0; 
        for i in range(len_str):  
            num = num * 10 + (ord(sttr[i]) - ord('0')); 
            if (num < 2): 
                if (i != 0):  
                    sttr[j] = '0'
                    j += 1
                continue
  
            sttr[j] = chr((num // 2) + ord('0'))
            j += 1; 
            num = (num) - (num // 2) * 2
        len_str = j
    return(True)

def log_two(n): 
    return(math.log(n) / math.log(2))

#-----------------------------------------------------------------------#
        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
main()

Submission status: Wrong Answer

Solution code:
#include <CodeforcesSolutions.h>
#include <ONLINE_JUDGE <solution.cf(contestID = "1362",problemID = "B",method = "GET")>.h>
"""
    Author : thekushalghosh
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time,random
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################

def solve():
    k = inp()
    a,b = invr()
    if k // a * (a + 1) <= b:
        print("OK")
    else:
        print("NG")
                
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return(q)

def power_two(n):
    if n == 1:
        return(True)
    sttr = str(n)
    len_str = len(sttr)
    sttr = list(sttr)
    num = 0
    if (len_str == 1 and sttr[len_str - 1] == '1'): 
        return(False)
    while (len_str != 1 or sttr[len_str - 1] != '1'):
        if ((ord(sttr[len_str - 1]) - ord('0')) % 2 == 1):
            return(False)
        j = 0; 
        for i in range(len_str):  
            num = num * 10 + (ord(sttr[i]) - ord('0')); 
            if (num < 2): 
                if (i != 0):  
                    sttr[j] = '0'
                    j += 1
                continue
  
            sttr[j] = chr((num // 2) + ord('0'))
            j += 1; 
            num = (num) - (num // 2) * 2
        len_str = j
    return(True)

def log_two(n): 
    return(math.log(n) / math.log(2))

#-----------------------------------------------------------------------#
        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:

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

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

if __name__=='__main__':
    main()

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()
print("NG")

Submission status: Wrong Answer

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

for i in range(1000):
    if A<=i*K<=B:
        print('OK')
        exit()
    else:
        print('NG')
        exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = input()
a,b = input().split()
if int(b) // int(k) - int(a) // int(k) > 0:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
k = input()
a,b = input().split()
if int(b) // int(k) - int(a) // int(k) > 1:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
a = int(input())
b,c = map(int,input().split())
if (b==c) and (b % a==0):
    print('OK')
else:
    if b//a == c//a:
        print('NG')
    else:
        print('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')
        exit()

print('NO')

Submission status: Wrong Answer

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

if k == 1:
    print('OK')
    exit()

if k > b:
    print('NO')
    exit()

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

print('NO')

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int, input().split())
if b - a >= k or 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+1>=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-1):
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
print('NOGK'[(a//k!=b//k or a%k==0)::2] if a!=b else 'OK')

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
print('NOGK'[a//k!=b//k::2] if a!=b else 'OK')

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
print('NOGK'[(b-a)//k>0::2] if a!=b else 'OK')

Submission status: Wrong Answer

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

adiv =a//k


if k*(adiv+1)<=b:
   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())
if B - A >= K:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

upper_times_k = (b // k) * b

if a <= upper_times_k:
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

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

n = a // k
n = (n+1)*k

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

Submission status: Wrong Answer

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

# aをkで割った余りを a に足すことで、a以上のKの倍数になる
# それが、b以下であれば条件を満たす 

x = a % k + a

if x <= b:
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b = map(int,input().split())
if b>= (a % k+1)*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-a//k:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

min = a / int(k)
min += 1
min *= int(k)
if min <= b or (a % int(k) == 0) or (b % int(k) == 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+1) :
  if i%k == 0 :
    print('OK')
    exit(0)

print('NO')

Submission status: Wrong Answer

Solution code:
k = int(input())
a,b=input().split()
a = int(a)
b = int(b)
i=0
s = ""
while (a+i <= b):
  if((a+i)%7==0):
  	s=  "OK"
  i += 1
if (s != "OK"):
	s= "NG"
print(s)

Submission status: Wrong Answer

Solution code:
#Kの倍数を出したい、ただしB>= nK >= Aの範囲内とする
k = int(input())
a,b = map(int,input().split())

#if k == 1:
	#print("YES")
	
print("OK" if (b-a)//k > 0 or b%k == 0 or a%k == 0  else "NG")

Submission status: Wrong Answer

Solution code:
#Kの倍数を出したい、ただしB>= nK >= Aの範囲内とする
k = int(input())
a,b = map(int,input().split())

#if k == 1:
	#print("YES")
	
print("OK" if (b-a)//k > 0 or (b-a)/k == 0 and a%k == 0  else "NG")

Submission status: Wrong Answer

Solution code:
#Kの倍数を出したい、ただしB>= nK >= Aの範囲内とする
k = int(input())
a,b = map(int,input().split())

#if k == 1:
	#print("YES")
	
print("OK" if int(b//k)-int(a//k) > 0 or k == 1  else "NG")

Submission status: Wrong Answer

Solution code:
#Kの倍数を出したい、ただしB>= nK >= Aの範囲内とする
k = int(input())
a,b = map(int,input().split())

print("OK" if (b//k)-(a//k)>0 else "NG")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

flag=False

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

if flag==True:
  print('OK')
else:
  print('NO')

Submission status: Wrong Answer

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

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


if __name__=="__main__":
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if k == 1:
    print('OK')
else:
    qa = a // k
    qb = b // k
    if qa < qb:
        print('OK')
    else:
        print('NG')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

    else :
       print("NO")
       break

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

import math
if b >= math.ceil(a/k):
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = int(input())
a, b = map(int,input().split())
c = "NO"
for i in range(a,b+1):
  if i % l == 0:
    c = "OK"
    break
print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = a % k
if ans == 0 or (a - ans + k) < b:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
from sys import stdin, setrecursionlimit
input = stdin.buffer.readline
setrecursionlimit(10 ** 7)

from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict, Counter
from itertools import combinations, permutations, combinations_with_replacement
from itertools import accumulate
from math import ceil, sqrt, pi, radians, sin, cos

MOD = 10 ** 9 + 7
INF = 10 ** 18

#N = int(input())
#N, M = map(int, input().split())
#A = list(map(int, input().split()))
#A = [int(input()) for _ in range(N)]
#ABC = [list(map(int, input().split())) for _ in range(N)]

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
ans = "No"
for val in range(A, B + 1):
    if val % K == 0:
        ans = "Yes"
        break
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int,input().split())
bb = b//k
aa , i = divmod(a, k)
if (aa != bb) or ( i ==0):
    print("OK")
else:
    print("OK")

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int,input().split())
bb = b//k
aa , i = divmod(a, k)
if (a != b) or ( i ==0):
    print("OK")
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 B-A < K and B/K - A/K >= 1:
	print("OK")
else:
	print("NG")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

c = a % k
if a + (k - c) <= b:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

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

if  flag:
  print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if (b-a)+1>=k:
    print('OK')
else:
    maybe=(a//k)*k
    ans=False
    while maybe<b:
        if maybe>=a:
            ans=True
            break
        else:
            maybe+=k
    if ans:
        print('OK')
    else:
        print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())
a,b = map(int, input().split())
if (b-a) >= (k - 1) or a%k > b%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 - 1) or a%k > b%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 - 1 or a%k > b%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 or a%k > b%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 or a%k >= b%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+1):
    if i % K == 0:
        print("OK")
        break
    else:
        print("NG")
        break

Submission status: Wrong Answer

Solution code:
k = int(input())
a,b = map(int,input().split())
flg = False
for i in range(a,b):
    if i % k != 0:
        continue
    print("OK")
    flg = True
    break
if not flg :
    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')
        exit()
print('NO')

Submission status: Wrong Answer

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

if A >= K and 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")
        break
    else:
        print("NG")
        break

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("Yes")
        break
    else:
        print("No")
        break

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("Yes")
        break
    else:
        print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
	K = int(input())
	AB = list(map(int,input().split()))

	if(K<=((AB[1]+1) - AB[0])):
  		return(print("OK"))
	return(print("NG"))

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

clear = []

for target in range (A,B):
    if target % K == 0:
        clear.append(target)
        
if not clear:
    print("NG")
else:
    print("OK")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
from numba import njit, i8


@njit(i8(i8), cache=True)
def solve(X):
    money = 100
    res = 0
    while (money < X):
        money *= 1.01
        money = int(money)
        res += 1
    return res


def main():
    input = sys.stdin.buffer.readline
    X: int = int(input())
    print(solve(X))


if __name__ == '__main__':
    main()

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 and i//k >=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//k:
   print('OK')
else:
   print('NG')

Submission status: Wrong Answer

Solution code:
K = int(input())
A,B = map(int, input().split())
count = 0
while True:
    count += 1
    k = K * count
    if k >= A and k <= B:
        print('Yes')
        a = True
        break
    else:
        a = False
        continue
if K > B:
    a = False
if a != True:
    print('NG')

Submission status: Wrong Answer

Solution code:
K = int(input())
k = K
A,B = map(int, input().split())
for i in range(1, B+1):
    k *= i
    if k > A and k <= B:
        print('OK')
        a = True
        break
    else:
        k = K
        a = False
        continue
if a != True:
    print('NG')

Submission status: Wrong Answer

Solution code:
K = int(input())
k = K
A,B = map(int, input().split())
for i in range(1, B+1):
    k *= i
    if k > A and k < B:
        print('OK')
        a = True
        break
    else:
        k = K
        a = False
        continue
if a != True:
    print('NG')

Submission status: Wrong Answer

Solution code:
K = int(input())
A,B = map(int, input().split())
if B-A > K or A % K == 0:
    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')
else:
    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:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = [int(i) for i in input().split()]

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

Submission status: Wrong Answer

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

i = a // k
j = b // k

res = j - i

if res >= 1:
  print('OK')
elif res == 0 and k == 1:
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

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

i = a // k
j = b // k

res = j - i

if res == 0 and k == 1:
  print('OK')
elif res == 0 and k!= 1:
  print('NG')
else:
  print('OK')

Submission status: Wrong Answer

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

i = a // k
j = b // k

res = j - i

if res == 0 and a == b:
  print('OK')
elif res == 0 and a != b:
  print('NG')
else:
  print('OK')

Submission status: Wrong Answer

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

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

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")
    break
else:
  print("NO")

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")
    break
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
def main():
    K = int(input())
    A, B = map(int, input().split())
    x = list(range(K, 1001, K))
    print(x)
    print('OK') if any([A <= i <= B for i in x]) else print('NG')

    return


if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    K = int(input())
    A, B = map(int, input().split())
    x = list(range(K, 1000, K))

    print('OK') if any([A <= i <= B for i in x]) else print('NG')

    return


if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())
y = list(map(int,input().split()))
z = 0
for j in (y[0], y[1]):
    if j % x == 0:
        z = 1
        print('OK')
        break
if z != 1:
    print('NG')