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 = (int(x) for x in input().split())
ki = k
f=0
while ki < b:
  if ki >=a and ki <=b:
    print("OK")
    f=1
    break
  ki += k
if f == 0:
  print("NG")

Submission status: Wrong Answer

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

B_d = B//K

if (B_d-1)*K >= A or 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())

ans1 =a%k
ans2 = a+k-ans1
if ans2<=b 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 < k:
    print("NG")
    exit()
print("OK")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
k = int(input())

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

if k == 1:
  print("OK")
elif a//k == b//k:
  print("NG")
else:
  print("OK")

Submission status: Wrong Answer

Solution code:
K, A, B = map(int, open(0).read().split())

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

Submission status: Wrong Answer

Solution code:
k = int(input())
aa = input().split()
aaa = aa[0]
bbb = aa[1]
a = int(aaa)
b = int(bbb)
for i in range(a,b+1):
    if i % k == 0:
        print("OK")
        break
    else:
        continue
    print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A,B = map(int,input().split())
c = 0
if A == B:
  if A % K == 0:
    c += 1

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

if c == 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 !=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 = list(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())

q, r = divmod(a, k)
Q, R = divmod(b, k)

if q > Q:
    print('OK')
else:
    if r == 0:
        print('OK')
    else:
        print('NG')

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')
      exit()
    else:
      pass

  if A == B:
    if A % K == 0:
      print('OK')
      exit()
    else:
      pass
  else:
    pass

  print('NG')


if __name__ == "__main__":
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

amari = A % K

if(K == 1):
    target = A
else:
    target = A + (K-amari)
if(target <= B):
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import os

def file_input():
    f = open('../Beginner_Contest_165/input.txt', 'r')
    sys.stdin = f

def main():
    #file_input()
    K=int(input())
    A,B=map(int, input().split())

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math

k = int(input())
a, b = (int(x) for x in input().split())
outa = math.floor(a / k)
outb = math.floor(b / k)
if outa == outb and a != b:
    print("NG")
else:
    print("OK")

Submission status: Wrong Answer

Solution code:
k = int(input())
l = input().split()
A, B = int(l[0]), int(l[1])


i = 0
num = i*k
while i * k <= B:
  print(i*k)
  if A <= i*k <= B:
    print('OK')
    break
  i += 1
else:
  print('NG')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input()) 
a = list(map(int, input().split()))
if a[0]%k == 0:
    ans="OK"
else:
    ans=("OK" if k*((a[0]/k)+1) <= a[1] else "NG")
print(ans)

Submission status: Wrong Answer

Solution code:
K = int(input())
AB=input().split()
A = int(AB[0])
B=int(AB[1])
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 a%k == 0:
  l = 0
else:
  l = 1
c = a/k
if (c+l)*k <= b:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

if k <= b-a+1:
    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 and A % K == 0:
  print("OK")
  sys.exit()

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

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

if K==1:
  print('OK')
elif a<b:
  print('OK')
elif a>b:
  print('NG')

Submission status: Wrong Answer

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

if A//K < B//K:
  print("OK")
#elif A//K == B//K and 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("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A,B = map(int,input().split())
"""
Awari = -(-A // K)
Bwari = -(-B // K)



if Awari == (Bwari-1):
    print("NG")
else:
    print("OK")

"""

Awari = -(-A // K)


if B >= Awari:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
K=int(input())
AB=input().split()
A=int(AB[0])
B=int(AB[1])
for i in range(A,B+1):
    i=567
    if(i%K==0):
        print('OK')
        exit()
print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input().rstrip())
data=input().rstrip().split()
a=int(data[0])
b=int(data[1])
 
if int(a/n)*n+n<=b:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = (int(x) for x in input().split())
k = False
for i in range(A, B + 1):
    if i % 7 == 0:
        k = True

if 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:
    print("OK")
elif k*(a//k+1)<=b:
    print("OK")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
X = int(input())
Y, Z = map(int, input().split())
a = Y%X
if a != 0 and Z >= Y-a+X:
    print('OK')
elif a == 0:
    print('OK')
else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = [int(x) for x in 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 b%k==0 or a%k==0:
  print('OK')
elif b-a >= k:
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

Solution code:
import os
import sys
from collections import deque
from collections import Counter
from heapq import heappop,heappush

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



if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
# from fractions import gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    K = INT()
    A, B = MAP()

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

    print("No")

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
K = int(input())
score = input().split()
if int(int(score[0])/K) < int(int(score[1])/K):
	print('OK')
else:
	print('NG')

Submission status: Wrong Answer

Solution code:
#---We Love Golf

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

judge = K + a


if(judge <= b or K == 1 or K == b):
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

k = int(input())


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

if k==1:
    print("OK")
elif abs(a-b) > k:
    print("OK")
elif 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):
    if i%k == 0:
        print("OK")
    else:
        print("NG")

Submission status: Wrong Answer

Solution code:
K=int(input())
A,B = (int(x) for x in input().split())
if (A>=K and A%K == 0) or (B>=K and B%K==0) or 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+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<=(B-A+1):
	print('OK')
else:
	print('NG')

Submission status: Wrong Answer

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

under = A%K
under = (under+1)*K
if(under<= B):
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
#整数の入力
N = int(input())
#スペース区切りの整数の入力
A, B = map(int, input().split())

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

if(b>a):
  print("OK")
elif((B%N)==0):
  print("OK")
elif(b==0):
  print("NG")
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 or (B-A)/K != 0:
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

Solution code:
import math
K = input()
AB = input().split()

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

Submission status: Wrong Answer

Solution code:

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

if a//k == a//k:
    if a%k == 0:
        print("OK")
    else:
        print("NG")
else:
    print("OK")

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())
n=int(A/K)
m=int(B/K)
if (B-A)>=K:
    print("OK")
elif n != m:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

txt = 'No'
tmp = (a // k) * k
if a == tmp or a <= tmp + k <= b:
    txt = 'Yes'

print(txt)

Submission status: Wrong Answer

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

if B - A >= K:
    print("OK")
elif (B % K) < (A % K):
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")

#solve
def solve():
    k = II()
    a, b = LI()
    print("OK" if a // k != b // k else "NG")
    return


#main
if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b =  map(int,input().split())
if int(a/k)*k + k <= b:
    print ('OK')
else:
    print ('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if dif == 0 and b%n != 0:
  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("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
"""
ジャンボ高橋君はゴルフの練習をすることにしました。
ジャンボ高橋君の目標は飛距離をKの倍数にすることですが、ジャンボ高橋君の出せる飛距離の範囲はA以上B以下です。
目標の達成が可能であれば OK と、不可能であれば NG と出力してください。
"""
k = int(input())
a, b = map(int, input().split())
checkF = False
for i in range(a +1, b):
    if i % k == 0:
        checkF = True

print('OK' if checkF else 'NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int,input().split())
n_A = A/K
n_B = B/K
if K == 1:
  print("OK")

if n_B - n_A >= 1:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
x=int(input())
n=100
ans=0
while True:
  if 10000*(pow(1.01,ans)-1)>=x:
    print(ans)
    exit()
  ans+=1

Submission status: Wrong Answer

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

x = B // k
y = A // k

if x - y >0:
    print('OK')
elif A == B:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

if a==1:
    print('OK')
else:
    c=0
    b=m-n
    for i in range(b):
        if (m-i)%a==0:
            c+=1
            break

    if c==0:
        print('NG')
    else:
        print('OK')

Submission status: Wrong Answer

Solution code:
N=int(input())
A, B=map(int,input().split())
C=A//N
if C==A*N:
  print("OK")
elif A<=(C+1)*N<=B:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

main()

Submission status: Wrong Answer

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

D = A/K
U = B/K
if( U-D >= 0):
 print("OK")
else :
 print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input().rstrip())
data=input().rstrip().split()
a=int(data[0])
b=int(data[1])

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

n = sum(i%K == 0 for i in L)

if n == 0:
    print("NG")
else:print("OK")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if ((A == B) and (A%K==0)) 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):
  print("OK")
elif(k==1):
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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


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


print(is_ok(K, A, B))

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

Submission status: Wrong Answer

Solution code:
K=int(input())

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

a=A%K

b=K-a

c=A+b

if a!=0:
    if c >= B:
        print('NG')
    else:
        print('OK')
else:
    print('OK')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())
A,B = map(int,input().split())
t = (A//k)+1
s = B//k
print('OK'if t<=s else 'NG')

Submission status: Wrong Answer

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

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( B//K ,A//K)
#print(A)
#print('Yes')
#print('No')

Submission status: Wrong Answer

Solution code:
K = int(input())
A,B = list(map(int,input().split(' ')))
flag = 'No'
for i in range(A,B+1):
    if i % K == 0:
        flag = 'Yes'
        
if flag == 'Yes':
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if a % k == 0:
    print('OK')

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

Submission status: Wrong Answer

Solution code:

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

flag = 0
for i in range(1000):
    if (a <= k * i+1) and (b >= k * i+1):
        print("OK")
        flag = 1
        break
if flag != 1:
    print("NO")

Submission status: Wrong Answer

Solution code:
import sys

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

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

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

Submission status: Wrong Answer

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

if B-A == 0:
    if A%K==0:
        print("OK")
        exit()
    else:
        print("NG")
else:
    pass

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

Submission status: Wrong Answer

Solution code:
k = int(input())
a,b=map(int, input().split())
for i in range(1,2000):
    x=k*i
    if a <= k and k <= b:
        print("OK")
        break
    elif b < k:
        print("NG")
        break

Submission status: Wrong Answer

Solution code:
import math
k = input()
a, b = input().split()
k = int(k)
a = int(a)
b = int(b)
a_k = math.ceil(a / k)
b_k = int(b / k)
if 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 a == b:
    if a % k == 0:
        print("OK")
    else:
        print("NG")
else:
    if b-a >= k:
        print("OK")
    else:
        print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
a, b = map(int, input().split())
if a == b:
  b += 1

for num in range(a, b):
  if num % K == 0:
    print('OK')
    break
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 = 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')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A,B = map(int,input().split())
loop = B - A
ans = "NG"

if K == 1:
  ans = "OK"
else:
  for i in range(loop):
    if loop < K:
      break
    if i % K == 0:
      ans = "OK"
      break
    
print(ans)

Submission status: Wrong Answer

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

if b - a < k:
    print("NG")

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int,input().split())
c = b//k
ans=0

for i in range(c):
    i += 1
    ans = i*k
    if a<= ans <=b:
        print("OK")
        break
    else:
        ans = -1

if ans == -1:
    print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A , B = (map(int , input().split()))
kk = K
while True:
    if kk >= A and kk <= 600:
        ans = 'OK'
        break
    elif  kk > 600:
        ans = 'NG'
        break
    else:
        kk = kk+K
print(ans)

Submission status: Wrong Answer

Solution code:
import sys;input=lambda:sys.stdin.readline().rstrip();aint=lambda:int(input());ints=lambda:list(map(int,input().split()))
import math;floor,ceil=lambda x:int(math.floor(x)),lambda x:int(math.ceil(x))
from functools import reduce;gcd=lambda*x:reduce(math.gcd,x);lcm=lambda*x:reduce(lambda x,y:(x*y)//gcd(x,y),x,1)
from collections import deque
Yes=lambda b:print("Yes"if b else"No");YES=lambda b:print("YES"if b else"NO")
is_even=lambda x:True if x%2==0 else False

def is_palindrome(s):
  n=len(s);b=True
  for i in range(int(0.5*n)):
    if s[i]!=s[n-i-1]:b=False
  return b

def main():
  k = aint()
  a,b=ints()
  if b-a>k or k==1 or a==b and a%k==0:
    print("OK")
  elif b<k*(a//k+1) and a%4!=0:
    print("NG")
  else:
    print("OK")

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

under = A%K
under = under*(K+1)
if(under<= B):
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
k = int(input())
ab = input().split(' ')
a = int(ab[0])
b = int(ab[1])

if a % k >= b % k:
  print('OK')
elif (b-a) >= k:
  print('OK')
elif a % k == 0:
  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")
    exit()
if int(A/K)<int(B/K):
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
K=int(input())
AB=input().split()
A=int(AB[0])
B=int(AB[1])
for i in range(A,B+1):
    i=567
    if(i%K==0):
        print('OK')
        exit()
print('NG')

Submission status: Wrong Answer

Solution code:
import sys
import os

def file_input():
    f = open('../Beginner_Contest_165/input.txt', 'r')
    sys.stdin = f

def main():
    #file_input()
    K=int(input())
    A,B=map(int, input().split())

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

anum = a // k
bnum = b//k

if(k == 1):
    print('OK')
elif(bnum - anum >= 0):
    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)
c = b - a

if k == 1 :
    print("OK")
elif k <= c:
    print("OK")
else :
    print("NG")

Submission status: Wrong Answer

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

total = k
while True:
    if a<=total<=b:
        print('OK')
        break
    elif total<a:
        total += k
    elif total>b:
        print('NO')
        break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def Sol(n,a,b):
    
    m = a%n
    if (a+n-m) <= b:
        print("OK")
    else:
        print("NG")
    
    return

    
n = int(input())

#for t in range(int(input())):
a,b = map(int,input().split())
#    arr = []
#    for i in range(c):
#        arr.append(list(map(int,input().split())))
#arr = list(map(int,input().split()))
#k = input()
#n = int(input())
Sol(n,a,b)

Submission status: Wrong Answer

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

import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        # for line in sys.stdin:
        #     lines.append(line)
        lines.append(input())
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    (k, ) = [int(e) for e in lines[0].split(' ')]
    (a, b) = [int(e) for e in lines[1].split(' ')]

    return (k, a, b)


def solve(k, a, b):

    result = 'NG'
    if b / k - a / k >= 1: 
        result = 'OK'
    
    return  result
    


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Submission status: Wrong Answer

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

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