Problem:


Score: 100 points

Problem Statement

Takahashi the Jumbo will practice golf.

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

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

Constraints

All values in input are integers.

1 \leq A \leq B \leq 1000

1 \leq K \leq 1000

Input

Input is given from Standard Input in the following format:

K
A B

Output

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

Sample Input 1

7
500 600

Sample Output 1

OK

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

Sample Input 2

4
5 7

Sample Output 2

NG

No multiple of 4 lies between 5 and 7.

Sample Input 3

1
11 11

Sample Output 3

OK



Sample input:
7
500 600


Sample output:
OK

Submission status: Wrong Answer

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

res = [i for i in range(A,B+1) if i%K==0]
print(res)

if res == []:
  print('NG')
else:
  print('OK')

Submission status: Wrong Answer

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

res = [i for i in range(A,B+1) if i%K==0]

if res == []:
  print('NG')
else:
  print('YES')

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

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = list(map(int, input().split()))
ma = divmod(b, k)
mi = divmod(a, k)
if ma[0] == mi[0] and ma[1] != mi[1]:
    print("NG")
elif ma[0] == 0:
    print("NG")
else:
    print("OK")

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = list(map(int, input().split()))
ma = divmod(b, k)
mi = divmod(a, k)
if ma[0] == mi[0] and ma[1] != mi[1]:
    print("NG")
else:
    print("OK")

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:
    if b // k - a // k > 0:
        print("OK")
    else:
        print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())
b,c = map(int, input().split())
if b%a==0:
  print('OK')
else:
  if b+a<=c:
    print("OK")
  else:
    print("NG")

Submission status: Wrong Answer

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

if K > B:
    print("NG")

if A <= K and K <=B:
    print("OK")

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

Submission status: Wrong Answer

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

if K > B:
    print("NG")

if A <= K and K <=B:
    print("OK")

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May  2 14:48:19 2020

@author: ab
"""
import math
import sys
import os

def isDivisible(num1,num2):
    return num1%num2 == 0

def binary_search(n,m,k):
    if isDivisible(n,k) | isDivisible(m,k):
        return True
    elif abs(n-m) <=1:
        return False
    mid = math.ceil((n+m)/2)
    if(isDivisible(mid,k)):
        return True
    elif mid-n < k:
        return binary_search(mid+1,m,k)
    else:
        return binary_search(n,mid-1,k)
    

def solution(k,n,m):
    if k == 1:
        return True
    elif isDivisible(n,k) | isDivisible(m,k):
        return True
    elif abs(n-m) <=1:
        return False
    elif k>m:
        return False
    else:
        return binary_search(n,m,k)



input = sys.stdin
output = sys.stdout
while True:
    lineElements = input.readline().rstrip("/n").split(" ")
    if(lineElements[0] == ''):
        break;
    if len(lineElements) == 1:
        k = int(lineElements[0])
    else:
        n,m = lineElements
        n,m = int(n),int(m)
        if solution(k,n,m) == True:
            print("OK\n")
        else:
            print("NG\n")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May  2 14:48:19 2020

@author: ab
"""
import math
import sys
import os

def isDivisible(num1,num2):
    return num1%num2 == 0

def binary_search(n,m,k):
    if isDivisible(n,k) | isDivisible(m,k):
        return True
    elif abs(n-m) <=1:
        return False
    mid = math.ceil((n+m)/2)
    if(isDivisible(mid,k)):
        return True
    elif mid-n < k:
        return binary_search(mid+1,m,k)
    else:
        return binary_search(n,mid-1,k)
    

def solution(k,n,m):
    if k == 1:
        return True
    elif isDivisible(n,k) | isDivisible(m,k):
        return True
    elif abs(n-m) <=1:
        return False
    elif k>m:
        return False
    else:
        return binary_search(n,m,k)



input = sys.stdin
output = sys.stdout
while True:
    lineElements = input.readline().rstrip("/n").split(" ")
    if(lineElements[0] == ''):
        break;
    if len(lineElements) == 1:
        k = int(lineElements[0])
    else:
        n,m = lineElements
        n,m = int(n),int(m)
        if solution(k,n,m) == True:
            print("OK")
        else:
            print("NG")

Submission status: Wrong Answer

Solution code:
K=input
A=input

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

K = int(input())
A, B = map(int, input().split())
a = math.floor(A/K)
b = math.floor(B/K)

if a < b or 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])
 
ans = False
 
if abs(a - b) < k:
  ans = True
else:
  for i in range(a, b + 1):
    if i % k == 0:
      ans = True
      break
print("OK" if ans else "NG")

Submission status: Wrong Answer

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

ans = False

if abs(a - b) < k:
  ans = True
else:
  for i in range(a, b):
    if i % k == 0:
      ans = True
      break
print("OK" if ans else "NG")

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

Solution code:
def main():
    K = int(input())
    A, B = map(int, input().split())
    #import math
    #wari = math.floor(B/K)
    wari = B / K
    if wari * K >= A:
        print("OK")
    else:
        print("NG")


main()

Submission status: Wrong Answer

Solution code:
def main():
    K = int(input())
    A, B = map(int, input().split())
    import math
    wari = math.floor(B/K)
    if wari * K >= A:
        print("OK")
    else:
        print("NO")


main()

Submission status: Wrong Answer

Solution code:
def main():
    K = int(input())
    A, B = map(int, input().split())
    wari = int(B/K)
    if wari * K >= A:
        print("OK")
    else:
        print("NO")


main()

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = [int(i) for i in 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("Yes")
        exit()
print("No")

Submission status: Wrong Answer

Solution code:
K = int(input())

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

yes = False
if A % K == 0 or B % K == 0:
    print("OK")

elif A == B:
    print("NG")


else:

    for i in range((A//K)+1, B//K):
        if (A <= i*K and i*K <= B):
            print("OK")
            yes = True
            break
    if not yes:
        print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

if k == 1:
    print('OK')
else:
    if a <= a//k * k <= b or a <= (a//k + 1) * k <= b:
        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 a//k == b//k:
        print('NG')
    else:
        print('OK')

Submission status: Wrong Answer

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

b = (b / k) * k

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def carry(K,A,B):
    K=int(K)
    A=int(A)
    B=int(B)
    m=1
    while K*m < B:
        if A <= K*m <= B:
            return "OK"
        else:
            m = m + 1
    return "NG"
    
K= input()
A,B=input().split()
print (carry(K,A,B))

Submission status: Wrong Answer

Solution code:
def carry(K,A,B):
    K=int(K)
    A=int(A)
    B=int(B)
    m=1
    while K*m < B:
        if A < K*m < B:
            return "OK"
        else:
            m = m + 1
    return "NG"
    
K= input()
A,B=input().split()
print (carry(K,A,B))

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:
a=int(input())
b=input().split()
c=int(b[0])
d=int(b[1])
if d-c>=a :
  print('OK')
else :
  for i in range(c,d+1) :
    if i%a==0 :
      print('OK')
      break
  print('NG')

Submission status: Wrong Answer

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

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

if (B-A+1)>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())

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

Submission status: Wrong Answer

Solution code:
target = int(input())
range_d = [int(i) for i in input().split()]
min_d = range_d[0]
max_d = range_d[1]

flag = False
if max_d < target:
  print('NG')
else:
  for i in range(min_d,max_d+1):
    if i%target == 0:
      flag = True
      break
print('OK') if flag else print('NG')

Submission status: Wrong Answer

Solution code:
N = int(input())
sh, lg = map(int, input().split())
ans = 'NG'
for i in range(sh, lg+1):
    if 7 % N == 0:
        ans = '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')
        exit()
print('NO')

Submission status: Wrong Answer

Solution code:
def run():
  N = int(input())
  A, B = map(int, input().split())
  
  for i in range(A, B+1):
    if A<N:
      break
    elif i%N==0:
      print("OK")
      return
    else:
      pass
    
  print("NG")
  return
    
if __name__ == "__main__":
  run()

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = list(map(int, input().split()))
x = 0
f = False
while x < b:
    if a <= x <= b:
        f = True
        break
    else:
        x += k

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

Submission status: Wrong Answer

Solution code:
def run():
  N = int(input())
  A, B = map(int, input().split())
  
  for i in range(A, B+1):
    if i<N:
      break
    elif i%N==0:
      print("OK")
      return
    else:
      pass
    
  print("NG")
  return
    
if __name__ == "__main__":
  run()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import floor

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

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

# 解法2
greatest_divisor = floor(B / K) * K
answer = 'OK' if greatest_divisor * K >= A else 'NG'

print(answer)

Submission status: Wrong Answer

Solution code:
from math import floor

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

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

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

print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = 'No'
for i in range(A, B+1):
    if not i % K: 
        ans = 'Yes'
        break
    
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

diff = B - A

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

Submission status: Wrong Answer

Solution code:

x = int(input())
counter = 0
goukei = 100

while goukei < x:
    goukei = int( goukei * 1.01)
    counter += 1
    
print(counter)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:


x = int(input())
counter = 0
goukei = 100.0

while goukei < x:
    goukei = int(goukei * 1.01)         ##goukei = int( goukei * 1.01)
    counter += 1
    
print(counter)

Submission status: Wrong Answer

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

tmp = A // K
if A % K == 0 or B <= ( tmp + 1 ) * K:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
import math

x = int(input())
counter = 0
goukei = 100.0

while goukei < x:
    goukei = int(goukei * 1.01)         ##goukei = int( goukei * 1.01)
    counter += 1
    
print(counter)

Submission status: Wrong Answer

Solution code:
import math

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

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


if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

Solution code:
import math

x = int(input())
counter = 0
goukei = 100.0

while goukei < x:
    goukei = math.floor(goukei * 1.01)         ##goukei += int( goukei * 0.01)
    counter += 1
    
print(counter)

Submission status: Wrong Answer

Solution code:
X = int(input())
x = 100
i = 0
while x < X:
    x += x//100 
    i += 1

print(i)

Submission status: Wrong Answer

Solution code:
import math

x = int(input())
counter = 0
goukei = 100

while goukei < x:
    goukei = math.floor(goukei * 1.01)         ##goukei += int( goukei * 0.01)
    counter += 1
    
print(counter)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

x = int(input())
counter = 0
goukei = 100

while goukei < x:
    goukei = int(goukei*1.01)         ##goukei += int( goukei * 0.01)
    counter += 1
    
print(counter)

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 = [int(i) for i in input().split()]

if B // K - A // K >= 1:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if B - A >= K:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
mon = 100
nen = 0
moku = int(input())

while mon < moku:
    mon = int(mon *1.01)
    nen += 1

print(nen)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

N = int(input())

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

# while	sum < N:
# 	sum += count
# 	i += 1

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

print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
mon = 100
nen = 0
moku = int(input())

while mon < moku:
    mon = mon // 100
    nen += 1

print(nen)

Submission status: Wrong Answer

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

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

print('NG')

Submission status: Wrong Answer

Solution code:
##import math

x = int(input())
counter = 0
goukei = 100

while goukei < x:
    goukei += int((1 + counter) * 0.01)
    counter += 1
    print(goukei)

    
print(counter)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
X = int(input())
n = 0
m = 100
while m < X:
    n += 1
    m += m//100 
 
print(n)

Submission status: Wrong Answer

Solution code:
##import math

x = int(input())
counter = 0
goukei = 100

while goukei < x:
    goukei += int(1 + counter * 0.01)
    counter += 1
    print(goukei)

    
print(counter)

Submission status: Wrong Answer

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

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

    largest = (b / k) * k

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
K = int(input())
i = list(map(int, input().split()))
A = i[0]
B = i[1]
C = A // K
D = B // K
if D - C > 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 or (b-a)>=k:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=list(map(int,input().split()))
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,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 = map(int, input().split()) 
i = 0
j = 0
if(A==B):
  if(A%K==0):
    print('OK')
    j = j +1
for x in range(A, B):
    if A / K == B  or (x % K == 0 or K % x == 0):
        print('OK')
        i += 1
        break
if i != 0 and j!=0:
    print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split()) 
i = 0
j = 0
if(A==B):
  if(A%K==0):
    print('OK')
    j = j +1
for x in range(A, B):
    if A / K == B  or (x % K == 0 or K % x == 0):
        print('OK')
        i += 1
        break
if i == 0 and j==0:
    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):
  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())
flag=1
for x in range(a,b+1):
  if x%k==0:
    flag=0
    print('OK')
if not flag:
  print('NG')

Submission status: Wrong Answer

Solution code:
K = int(input())
A,B = map(int,input().split())
for i in range(1,1000,K):
    if  A <= i and i <= B:
        print('OK')
        break
else:
    print('NG')

Submission status: Wrong Answer

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

for i in range(1001):
  if A<=i*K and i*K<=B:
    ans="YES"
    break

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(1,B//K+1):
  if A<=i*K and i*K<=B:
    ans="YES"
    break

print(ans)

Submission status: Wrong Answer

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

wk = (b//k)
if wk*k >=a:
    print('Ok')  
else:
    print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=int(input())
i=0
b=100
while b<a:
  b=int(b*1.01)
  i+=1
print(i)

Submission status: Wrong Answer

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

if B-A>=K-1 or A%K>=B%K:
  ans="OK"

print(ans)

Submission status: Wrong Answer

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


if ((b-a)-a%k >= k) or (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())
ans="NG"

if B-A>=K:
  ans="OK"
elif B%K<=A%K:
  ans="OK"

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split())) 
B = list(range(A[0],A[1]))
C = 0 
for i in range(1000):
    if i*N in B:
        print("OK")
        break
    C += 1
    if C == 1000:
        print("NG")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

C = 0

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if k>b:
    print('NG')
    sys.exit()

ans1 =a%k
ans2 = a+k-ans1
ans3 = b-k-(b%k)
if ans2<=b or k==1 or a<=ans3:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
import sys

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

#if k==1:
 #   print('Ok')      
#    sys.exit() 

wk = (a//k)
while wk*k <=b:
    print('Ok')  
    sys.exit()    
    wk+=1

print('NG')

Submission status: Wrong Answer

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

if a != b:
    lis = list(range(a,b))
elif a == b:
    lis = [a]

if all(j % k != 0 for j in lis):
    print('NG')
elif any(j % k == 0 for j in lis):
    print('OK')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
import fractions
 
K = int(input())
A,B = [int(i) for i in (input()).split(" ")]
 
if((B//K-A//K)>0 and K<=B):
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

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

#if k==1:
 #   print('Ok')      
#    sys.exit() 

wk = (a//k)
while wk*k <=b:
    print('Ok')  
    sys.exit()    
    wk+=1

print('NG')

Submission status: Wrong Answer

Solution code:
#提出時にコメントアウトを外す。
k = int(input())
ab = list(map(int, input().split()))
 
 
 
#作業用。ここは、作業最後に、コメントアウトする。
#k = 4
#ab = [1, 1]
 
 
#kの倍数をリストに格納する。
k_times = [0]
for i in range(1, 1001):
    m = i * k
    if m > 1000:
        break
    k_times.append(m)
#print(k_times)
 
#aからbの連続数リストを作る。
ab_list = []
a = ab[0]
b = ab[1]
if b == 1000:
    b = 1001
for j in range(a , b):
    ab_list.append(j)
if a == b:
    ab_list.append(a)
#print(ab_list)
 
k_ab_and = set(k_times) & set(ab_list)
 
#lenのチェック用
#print(len(k_ab_and))
 
num_result = len(k_ab_and)
 
if num_result > 0:
    print('OK')
 
elif num_result == 0:
    print('NG')