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:
x = int(input())
y = list(map(int,input().split()))
z = 0
for j in (y[0], y[1]):
    if j % x == 0:
        z = 1
        print('OK')
        break
if z != 1:
    print('NO')

Submission status: Wrong Answer

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

if (a%k != b%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())

Flag = False
for i in range(a, b):
  if (i%k == 0):
    Flag = True

if (Flag):
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

Solution code:
n = int(input())
a, b = map(int, input().split())
if (b-a+1) >= n:
  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())
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())

print("OK" if a > k and b >= k*2 else "NG")

Submission status: Wrong Answer

Solution code:
k=int(input())
n,m=map(int,input().split())
F=0
for i in range(n,m+1):
  if i%7==0:
    F=1
if F==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)

s=range(A,B)   
for n in range(1,1000):  
        if K*n in s:
            print("OK")
            break
        if K==1:
            print("OK")
            break
else:
    print("NG")

Submission status: Wrong Answer

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

s=range(A,B)   
for n in range(1,1000):  
        if K*n in s:
            print("OK")
            break
else:
    print("NG")

Submission status: Wrong Answer

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


for n in range(1,10):
    if A<=K*n and K*n<=B:
        print("OK")
        i="ok"
        break
    else:
        i="ng"
    
if i == "ng":
    print("NG")

Submission status: Wrong Answer

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

if a & k == 0 or b % k == 0:
    print("OK")
elif a // k != b // k:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for n in range(A, B+1):
    if K % n == 0:
        print('OK')
        quit()

print('NG')

Submission status: Wrong Answer

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

aa = a % k
bb = b % k

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

Submission status: Wrong Answer

Solution code:
K=int(input())

ARGS=input().split()
A=int(ARGS[0])
B=int(ARGS[1])

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

Submission status: Wrong Answer

Solution code:
K=int(input())

ARGS=input().split()
A=int(ARGS[0])
B=int(ARGS[1])

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

Submission status: Wrong Answer

Solution code:
K=int(input())

ARGS=input().split()
A=int(ARGS[0])
B=int(ARGS[1])

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

Submission status: Wrong Answer

Solution code:
K=int(input())

ARGS=input().split()
A=int(ARGS[0])
B=int(ARGS[1])

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

Submission status: Wrong Answer

Solution code:
K=int(input())

ARGS=input().split()
A=int(ARGS[0])
B=int(ARGS[1])

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

Submission status: Wrong Answer

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

largest = (b / k) * k

if( a <= largest ):
    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())

a = 0

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

Submission status: Wrong Answer

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

a = 0

for i in range(A, B+1):
  if i%K == 0:
    a+=1
  else:
    pass
if a != 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

a = A/K
b = B/K

if A%K == 0 or B%K == 0:
  print("Yes")
else:
  if a == b:
    print("NG")
  else:
    print("Yes")

Submission status: Wrong Answer

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

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

if K == 1:
  print("Yes")
else:
  if a == b:
    print("NG")
  else:
    print("Yes")

Submission status: Wrong Answer

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

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

if a == b:
  print("NG")
else:
  print("Yes")

Submission status: Wrong Answer

Solution code:
K=int(input())
A, B=map(int, input().split())
listAtoB=list(range(A,B))
k=list(filter(lambda  x: x% K == 0,listAtoB))

if K==1 or len(k) >= 1:
	print("OK")
else:
	print("NG")

Submission status: Wrong Answer

Solution code:

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

k = int((B-(A-1))/K) 

if K == 1:
	print("OK")
elif k >= 1:
	print("OK")
else:
	print("NG")

Submission status: Wrong Answer

Solution code:

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

k = int(B/K)-int(A/K) 

if K == 1:
	print("OK")
elif k >= 1:
	print("OK")
else:
	print("NG")

Submission status: Wrong Answer

Solution code:

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

k = (B - A) / K 

if K == 1:
	print("OK")
elif k >= 1:
	print("OK")
else:
	print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
K = int(input())
AB = input()
l = AB.split()
A = int(l[0])
B = int(l[1])
li = []
for i in range(A, B+1) : 
  if i % K == 0 :
    li.append(i)
  else :
    continue
if len(li) >=1 :
  print("YES")
else : 
  print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print('NG')

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    k = int(input())
    a, b = map(int, input().split())
    if a // k == b // k and k != 1:
        print('NG')
    else:
        print('OK')


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
print("OK" if (a-1)//k!=b//k else 'No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print('OK' if (a // 7 >= 1) and (b // 7 >= 1) else 'NG')

Submission status: Wrong Answer

Solution code:
K = int(input("K"))
A, B = [int(i) for i in input("A, B").split()]
C = B//K
if C*K >= A:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
if __name__ == '__main__':
    k = input()
    k = int(k)
    ab = input()
    ab = ab.split()
    a = int(ab[0])
    b = int(ab[1])
    flag = False
    sum = k
    while k<b:
        if a<=k and k<=b:
            flag = True
        k += sum
    if flag:
        print("OK")
    else:
        print("NG")

Submission status: Wrong Answer

Solution code:
if __name__ == '__main__':
    k = input()
    k = int(k)
    ab = input()
    ab = ab.split()
    a = int(ab[0])
    b = int(ab[1])
    print(a,b)
    flag = False
    sum = k
    while k<b:
        if a<=k and k<=b:
            flag = True
        k += sum
        print(k)
    if flag:
        print("OK")
    else:
        print("NG")

Submission status: Wrong Answer

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

    i = 1
    flag = False
    while k<b:
        k = k*i
        if a<=k and k<=b:
            flag = True
        i += 1
    if flag:
        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")
        break
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
print("NG")

Submission status: Wrong Answer

Solution code:
K = input()
AB = input()

K = int(K)
AB = [int(i) for i in list(AB.split())]
x = AB[1]/K

if int(x) * K >= AB[0]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
K = input()
AB = input()

K = int(K)
AB = [int(i) for i in list(AB.split())]
x = int(AB[1]/K)

if x * K >= AB[0]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
K = input()
AB = input()

K = int(K)
AB = [int(i) for i in list(AB.split())]
x = int(AB[1]/K)

if x * K >= AB[0]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
K = input()
AB = input()

K = int(K)
AB = [int(i) for i in list(AB.split())]
xb = int(AB[1]/K)

if xb * K >= AB[0]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
K = input()
AB = input()

K = int(K)
AB = [int(i) for i in list(AB.split())]


if AB[1]/K - AB[0]/K >= 1 or AB[1]/K - AB[0]/K == 0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

if a==b:
    if a%k==0:
        flg+=1

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

Submission status: Wrong Answer

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
X=int(input())
year=0
deposit=100
while deposit<X:
    deposit=deposit*101//100
    year+=1
print(year)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
K = int(input())
in1 = input().split(" ")
A = int(in1[0])
B = int(in1[1])
if (B+1)-A>=K:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
in1 = input().split(" ")
A = int(in1[0])
B = int(in1[1])
if 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")
    flg=1
    break
  else:
    flg=0

if flg==0:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = [int(a) for a in input().split()]
p = (A // K) * K + K
if K == 1:
    print("OK")
elif (A <= p and p <= B):
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = [int(a) for a in input().split()]
p = A // K * K + K
if K == 1:
    print("OK")
elif (A <= p and p <= B):
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = [int(a) for a in input().split()]
p = A // K * K + K
if (A <= p and p <= B) or (K == 1):
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = [int(a) for a in input().split()]
p = A // K * K + K
if A <= p and p <= B:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = [int(a) for a in input().split()]
p = A // K * 7 + 7
if A < p and p < B:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = [ int(a) for a in input().strip().split(' ')]
     
if (B - A) % K == 0:
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = [ int(a) for a in input().strip().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())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if k>=a and k<=b:
  print('OK')
print('NG')

Submission status: Wrong Answer

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


i = 1
while K * i <= 1000:
  if A <= K * i and K * i <= B:
    print("Yes")
    exit()
  else:
    i+=1

print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
A1 = A / K
A2 = A % K
B1 = B / K
# B2 = B % K
if (B1 - A1) >= 1 or A2 == 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:
    print('NG')
else:
    print('OK')

Submission status: Wrong Answer

Solution code:
K = int(input())

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

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

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

if A // K == B // K:
    if B % K == 0:
        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())

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys

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

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

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):
  print(i)
  if i % K == 0:
    ans = "OK"
    break

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())
a,b = map(int,input().split())
print('NYoe s'[b//k>a//k::2])

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("YES")
        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')

    elif B % K == 0:
        print('OK')
        
    else:
        print('NG')

else:
    for i in range(B-A):
        i += A
        if i % K == 0:
            print('OK')
            break

    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:
    for i in range(B-A):
        i += A
        if i % K == 0:
            print('OK')
            break

    else:
        print('NG')

Submission status: Wrong Answer

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

while not i % K == 0:
    if i > B:
        print('NG')
    i += 1

if i % K == 0:
    print('OK')

Submission status: Wrong Answer

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

while not i % K == 0:
    if i >= B:
        print('NG')
    i += 1

if i % K == 0:
    print('OK')

Submission status: Wrong Answer

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

if (a//k < b//k) or (a//k == 0):
    print("OK")
else:
    print("NG")

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
d = K
while d <= B:
    if d >= A:
        print("OK")
        exit()
    d += K
print("No")

Submission status: Wrong Answer

Solution code:
import math
K = int(input())
A, B = map(int, input().split())
para = math.floor(B/K) - math.floor(A/K)
if para > 0:
    print('OK')

else:
    print('NG')

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s,d = map(int,input().split())

c = 0
for i in range(s,d+1):
  if i % s == 0:
  	c = c + 1


if c != 0:
 	print("OK")
else:
  	print("NG")

Submission status: Wrong Answer

Solution code:
n = int(input())
s,d = map(int,input().split())

c = 0
for i in range(s,d+1):
  if i % s == 0:
  	c = c + 1


if c != 0:
 	print("YES")
else:
  	print("NO")

Submission status: Wrong Answer

Solution code:
n = int(input())
s,d = map(int,input().split())

c = 0
for i in range(s,d):
  if i % s == 0:
  	c = c + 1


if c != 0:
 	print("YES")
else:
  	print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

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

x=A%K
w=int(A/K)
y=int(B/K)
z=y-w
#print(z)
if B%K==0:
   print('OK')
elif z>0:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:

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

x=A%K
w=int(A/K)
y=int(B/K)
z=y-w
print(z)
if B%K==0:
   print('OK')
elif z>0:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

x=A%K
w=int(A/K)
y=int(B/K)
z=y-w
#print(z)
if B%K==0:
   print('OK')
elif z>=1:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

x=A%K
w=A/K
y=B-A
z=(y-x)//K

if B%K==0:
   print('OK')
elif int(z>=1):
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

x=A%K
w=A/K
y=B-A
z=(y+x)/K

if B%K==0:
   print('OK')
elif int(z>=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')

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

Submission status: Wrong Answer

Solution code:
k = int(input())

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

c = b - a

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

c = b - a

if c >= k or c % k == 0:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

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

a = A // K
b = B // K

if b-a >= 1 or K == 1:
    print("OK")
elif B%K==0:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

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

a = A // K
b = B // K

if b-a >= 1 or K == 1:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

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

a = A // K
b = B // K

if b-a >= 1:
    print("OK")
elif K==1:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

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

a = A // K
b = B // K

if b-a >= 1:
    print("OK")
elif K==1:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if (B // K)-(A // K) >= 1:
    print("OK")
elif (A >= K) & (K <= B):
    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 // 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()))
flg = 1
for i in range(A, B+1):
    if 7%K == 0:
        print('OK')
        flg = 0
        break
if (flg):
    print('NG')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
X = int(input())
Y = 100
count = 0
while int(Y) <= X:
    Y *= 1.01
    count += 1
print(count)

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
f=0
for i in range(1,1001):
  if a<=i+k<=b:
    print("OK")
    f=1
    quit()
if f==0:
  print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
d = A // K if A // K > 0 else 1
r = A % K

if K == 0:
  print("OK")
elif r == 0:
  print("OK")
elif K*(d+1) >= A and K*(d+1) <= B:
  print("OK")
else:
  print("NG")