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

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%2==0):
    c=1
    break
if(c==1):
  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")
else:
  print("NG")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

i=b%k
if i==0:
  print('OK')
else:
  if a < b-i:
    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)+1)*k<=b or (a/k)*k==a==b:
    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:
import math
K = int(input())
A,B = map(int, input().split())

under = math.ceil(A/K)
if(under<= 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:
    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())
if  1<= b/k-a/k 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())

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 // k - a// k > 0:
  print('OK')
elif a == b and 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>=k  and b-k>=a-k:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

ans = B / K 
ans1 = ans * K

if (ans1 >= B):
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

c = b - a 

for i in range(c):
  i+=1
  ks = k * i 
  ka.append(ks)

if k in ka:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

sa = m[1] - m[0]
flag = 0

if sa == 0:
    if sa % n == 0:
        print("ok")
        exit()
    else:
        print("NG")
        exit()

for x in range(sa):
    hantei = m[0]
    hantei += x
    if hantei % n == 0:
        flag += 1

if flag >= 1:
    print("ok")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
k = int(input())
a,b = map(int,input().split())
if b%k==0:
  print("OK")
elif (b//k)*k >=a:
  print("OK")
else:
  print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

result = 'OK'
if (A%K != 0)&(B%K != 0):
    A = A//K + 1
    if A*K+K>B:
        result = 'NG'
        
print(result)

Submission status: Wrong Answer

Solution code:
a = int(input())
b = input().split(" ")
if int(b[0]) % a == 0:
    print("OK")
elif int(b[1]) % a == 0:
    print("OK")
elif int(b[0]) // a + a > int(b[1]):
    print("NG")
else:
    print("OK")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
str1 = int(input())
str2 = input().split()

num = int(str2[1] ) - int(str2[0])
if num == 0:
    num = int(str2[1])

use = int(str2[1])

ok_count = 0

for i in range(num):
    if use % str1 == 0:
        ok_count = 1
    use = use - 1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
k = int(input())

data = input().split()
a = int(data[0])
b = int(data[1])
if b - a >= k-1:
    print("OK")
else:
    print("NO")

Submission status: Wrong Answer

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

if(B - A >= K or (B == A and 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()]

print("OK" if abs((B // K) - (A // K)) > 0 or abs(B - A) == 0 else "NG")

Submission status: Wrong Answer

Solution code:
n = int(input())
a,b = map(int,input().split())
for i in range(a,b):
    if i % n == 0:
        print("OK")
        break
else:
    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:
def main():
  k = int(input())
  a, b = map(int, input().split())
  
  print("OK" if (k+a >= a and k+a <= b) or (a==b and a%k==0) else "NG")
  
if __name__ == '__main__':
  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 or B/K >= 1000*K:
    
#A = list(map(int, input().split()))

    print('NG')

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())
c, d = input().split()
a = int(c)
b = int(d)
for i in range(k,10000,k):
    if b>i>a:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
N = int(input())
A=[int(x) for x in input().split()]
k=0
if N==1:
    print("OK")
else:
     if A[0]//int(N) == A[1]//int(N):
        print("NG")
     else:
        print("OK")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

p = A % K
q = B % K
if p+q >K:
  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");
elif a == b 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())
a = range(A,B)
for i in a:
    if i %K == 0:
        print('OK')
    else:
        print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if len(set(range(0,1000,k)) & set(range(a,b+1))) >= 1:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

for i in range(l[0], l[1]+2):
    if i == l[1]+1:
        print('NG')
    if i % k == 0:
        print('OK')
        break

Submission status: Wrong Answer

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

if K == 1:
    print('OK')
    exit()
if K *(int(x) + 1) <= B:
    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 and k == 1:
    ans = 'OK'

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

print(ans)

Submission status: Wrong Answer

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

flg = 0

if K == 1:
    flg =1

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


if flg == 1:
    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:
def cal(m,n,t):
  for i in range(m,n):
    if(i%t==0):
      return "OK"
  return "NG"
t=int(input())
m,n=map(int,input().split())
print(cal(m,n,t))

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:
import sys
k=int(input())
a,b=map(int, input().split())
if a==b:
  area=[a,b]
else:
  area=[int(i) for i in range(a,b)]

for i in area:
  if i % k ==0:
    print('OK')
    sys.exit()

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 n-int(a%n)<=a-b:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
#数値ひとつ
I = int(input())
#数値空白区切りで欲しいとき
N, M = map(int, input().split())
#文字欲しいとき
#N = input()
#それをListにしたいとき
#list = list(N)
#数値を受け取る数が未定かつリストにしたいとき
#list = list(map(int, input().split()))
#受け取る文字列が未定かつリストにしたいとき(Iは回数)
#list = [input() for i in range(I)]

flgok = False
for num in range(N, M):
    if num % I == 0:
        flgok = True
        break

if N == M:
    if N % I == 0:
        flgok = True
    else:
        flgok = False

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

Submission status: Wrong Answer

Solution code:
def main():
    k = int(input())
    a, b = eval(input().replace(' ', ','))
    print(k, a, b)
    for i in range(a, b + 1):
        if i % k == 0:
            print("OK")
            break
    else:
        print("NG")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
num=int(input())
date1=input().rstrip().split(" ")
A=int(date1[0])
B=int(date1[1])
A=(A-A%num)/num
B=(B-B%num)/num
if A==B:
    print("NG")
else:
    print("OK")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A,B = map(int, input().split())
N = int(1000 / K) + 1

OK = False

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

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-1,B+1):
  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 K == 1:
        print("OK")
    else:
        print("NG")
else:
    s = B-A
    if K <= s:
        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("Yes")
        break
else:
    print("No")

Submission status: Wrong Answer

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

if A%K==0 or B%K==0:
  print("OK")
elif (B-A+1<K and B%K>A%K):
  print("NG")
else:
  print("OK")

Submission status: Wrong Answer

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

c=a//K
d=b//K

if c-d==0 and a/K!=c:
	print("NG")
if a/K==c/K:
	print("OK")
if c<d:
	print("OK")

Submission status: Wrong Answer

Solution code:
a=int(input())
x,y = map(int,input().split())
count = 0
if x == y:
    if x % a == 0:
        count += 1
for i in range(x, y):
    if i % a == 0:
        count += 1

if count >= 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('OK')
elif A == B:
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

Solution code:
s = [input() for i in range(2)]
n = int(s[0])
l = s[1].split()
n1 = int(l[0])
n2 = int(l[1])
gap=n2-n1+1
m="NG"
for i in range(gap):
    if i+1 == n:
        m = "OK"
        break

print(m)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
A = int(input())
X,Y = map(int,input().split())
C = Y//A
D = X//A

if Y-X > A:
  print("OK")
elif Y%A == 0 or X%A == 0:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int,input().split())
tmp = A//K
K_beta = K*(tmp+1)
if A <= K_beta and K_beta <= B:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
  K = int(input())
  A, B = map(int, input().split())
  if B - A >= K:
    print('OK')
  elif B == A:
    print('OK')
  else:
    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")
elif(bnum == anum and b % k == 0):
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a=int(input())
x,y = map(int,input().split())
count = 0
if x == y:
    if x % a == 0:
        count += 1
for i in range(x, y):
    if i % a == 0:
        count += 1

if count >= 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')
else:
    print('NG')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if b == a and k == 0:
    ans = 'OK'

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

print(ans)

Submission status: Wrong Answer

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

# if K > B:
    # print ("NG")


if C <= B:
    print ("OK")
else:
    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 i%K==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())
if (B-A)>=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())

c=b//k

if a<c*k:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline


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

c = b//k - a//k

if k == 1:
    print("OK")
else:
    if c >0:
        print("OK")
    else:
        print("NG")

Submission status: Wrong Answer

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

aa=a/n
bb=b/n
nn=bb-aa

if nn >= 1 or n==1:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

i = 0
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:
    print("OK")
elif b - a + 2 >= k:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
aim = int(input())
min, max = map(int, input().split(' '))
x = min / aim
y = max / aim
if y - x >= 1:
    print('OK')
elif min % aim == 0 or max % aim == 0:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
K = int(input())
i = list(map(int, input().split()))
count =i[0]
for num in range(i[0],i[1]):
  if num % K == 0:
    print('OK')
    break;
  else:
    count += 1
if count == i[1]:
  print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = [int(x) for x in input().split()]
if B-A >= K-1:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
K=int(input())
A,B=map(int,input().split())
x=A
while x<=B:
  if x%K==0:
    y=100
  else:
    x+=1
    y=0
if y==100:
  print('OK')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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")
elif(bnum == anum and bnum % k == 0):
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

c = int(a) / int(X)
d = int(b) / int(X)

if X=="1" or int(c) != int(d):
  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:
def Sol(n,a,b):
    
    if n == 1:
        print("OK")
        return
    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:
k = int(input())
a, b = map(int, input().split(' '))
print('OK' if k == 1 or (b-a)//k > 1 else '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 <= B:
        ans = 'OK'
        break
    elif  kk > 600:
        ans = 'NG'
        break
    else:
        kk = kk+K
print(ans)

Submission status: Wrong Answer

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

if x>=n:
    print("OK")
elif x==0 and n==1:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

p = A % K
q = B % K
if p+q >=K:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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


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

j_a = float(A)/float(K)
j_b = float(B)/float(K)

if(float(A)%float(K) ==0):
    print('OK')
elif(float(B)%float(K) ==0):
    print('OK')
elif(j_b-j_a >= 1):
    print('OK')
    
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

k = onem()

a,b = m()

aa = -(-a//k)

bb = b//k
if aa <= bb:
    print("OK")
else:
    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:
        print("OK")
        break
else:
    if a==b:
        if a % 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())
if int(a/k)*k + k <= b:
    print ('OK')
else:
    print ('NG')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

start = (A // K) * K
# if start % K == 0:
#     import ipdb; ipdb.set_trace()
#     print('OK')
#     exit(0)

if start == B or start + K <= B:
    print('OK')
    exit(0)

print('NG')

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
a = int(input())
b = input().split()
b[0] = int(b[0])
b[1] = int(b[1])
A = b[0] / a
B = b[1] / a
C = B - A
if a == 1:
    print('OK')
elif C >= 1:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
import math

a=int(input())
li = list(map(int,input().split()))
if li[1]<=math.ceil(li[0]/a)*a:
    print("NG")
else:
    print("OK")

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:
k=int(input())
a,b=map(int,input().split())
if (b-a) >=k or b%k==0 :
	print('OK')
else:
	print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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