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

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:
#########行列読み込み ##############################################
"""
from sys import stdin
n = int(stdin.readline().rstrip())
data = [stdin.readline().rstrip().split() for _ in range(n)]
print(data)
print(*data, sep='\n')
"""
##################################################################
#########入力系####################################################
"""
s =input()
s=list(input())
a=int(input())
x,y = map(int,input().split())	
li = input().split()	
li = list(map(int,input().split()))	
li = input().split('T')	
"""
##################################################################
K = int(input())
A,B = map(int,input().split())	
if K == 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())
for i in range(a, b+1, 1):
    print(i)
    if i % k == 0:
        print('OK')
        exit()
print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if A % K == 0 or B//K != A//K:
    print("OK")
else:
    print("NO")

Submission status: Wrong Answer

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

count = 0
for ele in range(a, b):
    if ele % k == 0:
        print("OK")
        count += 1
        break
if count == 0:
    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:
K = int(input())
a,b=map(int,input().split())
if b//K-a//K>0:
  ans ='OK'
elif K==1:
  ans = 'OK'
else:
  ans = 'NG'
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

c=b//N
if N*(c-1)>=a or N*c==a:
    print('OK')
else:
    print("NG")

Submission status: Wrong Answer

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

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print("OK" if b-a>=n else "NG")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if(1<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")
    exit()
print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if B - A >= 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")
  quit()

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

a_ = a // k
b_ = b // k
if b_ > a_:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

print("OK" if b-a+1 >= N else "NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    K = int(_in[0])  # type:int
    A,B = list(map(int,_in[1].split(' ')))  # type:list(int)
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    TF = 'OK' if B//K-A//K>=0 else 'NG'
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(TF)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#a
M = int(input())
N,K=map(int,input().split())
if K-N>=M:
    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 else 'NO')

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

co = 0
f = 0
while True:
    co += k
    if a <= co and co <= b:
        f = 1
        break
    elif co > b:
        break
if f:
    print("OK")
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 B - A >= 1:
  print("OK")
else :
  if B % K == 0:
    print("OK")
  else:
    print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

min = a // k
max = b // k

if max - min >0:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
from sys import stdin
import sys
import math

# A, B, C = [int(x) for x in stdin.readline().rstrip().split()]
# A, B = [int(x) for x in stdin.readline().rstrip().split()]
# U = input().split()
K = int(input())

A, B = [int(x) for x in stdin.readline().rstrip().split()]
for i in range(A,B+1):
    if i%K==0:
        print("OK")
        sys.exit()
print("NO")
# A, B = [str(x) for x in stdin.readline().rstrip().split()]

# print("YES")
# print("NO")

Submission status: Wrong Answer

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

if (A//K) != (B//K):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    K = int(input())
    A, B = list(map(int, input().split(' ')))
    
    
    
    for i in range(A-10, B+10):
        if i % K == 0:
            print('OK')
            return
            
    print('NG')
        
        
    
    
    
main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
S, W = map(int, input().split())

for i in range(S, W+1):
    if i%K==0:
        print("OK")
        exit()
else:print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

n = a//k

if (a == n*k) or (b > (n+1)*k):
  print('OK')
else:
  
  print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
l = list(input().split(" "))
a = int(l[0])
b = int(l[1])
if a//n == b//n:
  print("NG")
else:
  print("OK")

Submission status: Wrong Answer

Solution code:
def main():
    k = int(input())
    a,b = tuple([int(t)for t in input().split()])

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

flag = False
for i in range(1000):
    if A <= i*K and i*K <= B:
        flag = True

if flag:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input().split()
k=int(s[0])
s = input().split()
a=int(s[0])
b=int(s[1])
if k>1:
    if (b-a)/7>1:
        print('OK')
    else:
        print('NG')
else:
    print('OK')

Submission status: Wrong Answer

Solution code:
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush, nlargest, nsmallest
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from fractions import Fraction
# sys.setrecursionlimit(2*pow(10, 6))
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
mod = pow(10, 9) + 7
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(" ".join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]


k = int(data())
a, b = sp()
if b - a + 1 >= k:
    out("OK")
    exit()
out("NG")

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"
        break

print(ans)

Submission status: Wrong Answer

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

ans = 'NG'
check = K
while check <= 1000:
    check += K
    if A <= check and check <= B:
        ans = 'OK'
        break

print(ans)

Submission status: Wrong Answer

Solution code:
K = int(input())
A,B= list(map(int, input().split()))
S = 0
while S<A:
    S += K
if S<B:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
def main():
    #入力
    readline=stdin.readline
    K=int(readline())
    A,B=map(int,readline().split())
    if A%K==0:
        print("Yes")
    elif A//K<B//K:
        print("Yes")
    else:
        print("No")
if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:

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

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

if Flag:
  print("OK")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
K = int(input())

A, B = map(int, input().split())
if (A - 1) // K < B // K:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

k = int(readline())
a, b = map(int, readline().split())
for i in range(a, b + 1):
    if i % a == 0:
        print('OK')
        exit()
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:
def iin(): return int(input())
def iln(): return list(map(int, input().split()))

K = iin()
A, B = iln()

curr_num = 1
while curr_num < A:
    curr_num += K

if curr_num < B:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

d = a//k
e = b//k
if d!=e or k == 1:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

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

if cnt > 0:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
import sys
n= int(input())

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

for i in range(a, b):
    if i % 4 == 0:
        print('OK')
        sys.exit()

print('NG')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if k:
    print("OK")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys


def solve(K: int, A: int, B: int):

    if K == 1:
        print("OK")
        exit()
    
    a = A // K
    b = B // K

    if a == b:
        print('NG')
    else:
        print('OK')
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  # type: int
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(K, A, B)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 6)

def main():
    K = int(input())
    A, B = map(int, input().split())
    if K <= (B - A + 1):
        print('OK')
    else:
        print('NG')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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


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

if A%K==0 or B%K==0 or A//K<B//K:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

num = k
while num < b:
    if a < num:
        print("Yes")
        exit()
    num += k

print("No")

Submission status: Wrong Answer

Solution code:

N = int(input())
A,B = map(int,input().split())
ans =0

for x in range(A,B+1):
    if x%N ==0:
        ans =1
        break
if ans ==1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def a165(k, a, b):

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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:
# ANSHUL GAUTAM
# IIIT-D

from math import *
from copy import *					# ll = deepcopy(l)
from heapq import *					# heappush(hp,x)
from string import *				# alpha = ascii_lowercase
from random import *				# l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from bisect import *				# bisect_left(arr,x,start,end)  => start and end parameters are temporary
from sys import stdin				# bisect_left return leftmost position where x should be inserted to keep sorted
from sys import maxsize				# minn = -maxsize
from operator import *				# d = sorted(d.items(), key=itemgetter(1))
from itertools import *				# pre = [0] + list(accumulate(l))
from collections import Counter		# d = dict(Counter(l))
from collections import defaultdict # d = defaultdict(list)

'''

'''

def solve(l):
	n = len(l)
	

N = int(stdin.readline())
a,b = list(map(int, stdin.readline().rstrip().split()))
if(abs(a-b) >= N-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')
else:
  print('NG')

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:
def mapint_inp():
    return map(int, input().split())

def intinp():
    return int(input())

K = intinp()
A, B = mapint_inp()

ans = False
for i in (A, B):
    if i%K == 0:
        ans = True
    
if ans:
    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 % i == 0:
        print("OK")
        exit()

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

input_line = input()
Line = input_line.split()
Line = [int(s) for s in Line]



if Line[1]-Line[0] < N:
    print("No")
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("Yes")
    break
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import random
import math
LI = lambda: list(map(int,input().split()))
MI = lambda: map(int,input().split())
yes = lambda: print("Yes")
no = lambda: print("No")
I = lambda: list(input())
J = lambda x: "".join(x)
II = lambda: int(input())
SI = lambda: input()
#---khan17---template
t = II()
a,b = MI()
print("OK" if a+t<=b or a%t == 0 or b%t == 0 else "NG")

Submission status: Wrong Answer

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

for i in range(a, b-1):
  if i % k:
    print('OK')
    sys.exit()
print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(1000):
    if i>=A and i<= B:
        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 b-a+1>=k:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
import sys


sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7


def input():
    return sys.stdin.readline().strip()


def main():
    K = int(input())
    A, B = map(int, input().split())
    flag = False
    if A % K == 0:
        flag = True
    elif B % K == 0:
        flag = True
    elif (B - A) // K > 0:
        flag = True

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

def main():

    input = stdin.readline

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
goal=int(input())
list=input().split(" ")
max=int(list[0])
min=int(list[1])
if(max-min>goal):
    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('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May  2 20:55:33 2020

@author: Kanaru Sato
"""

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = "NG"
for i in range(A,B+1):
    if i % K == 0:
        ans = "Yes"

print(ans)

Submission status: Wrong Answer

Solution code:
# ABC165a


def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)
    # 再帰関数を使わない限りPypyで出すこと

    def dump(*args):
        sys.stderr.write(str(args))

    k = int(input())
    a, b = map(int, input().split())
    c = 1
    d = 1
    while c <= b * 2:
        if a <= c <= b:
            print('OK')
            exit(0)
        c = k * d
        d += 1
    print('NG')


if __name__ == '__main__':
    main()

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

Submission status: Wrong Answer

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

if(i[1]-i[0]>=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('Yes')
print('No')

Submission status: Wrong Answer

Solution code:
def main():
    K = int(input())
    A, B = list(map(int, input().split(' ')))
    
    
    
    for i in range(A, B):
        if i % K == 0:
            print('OK')
            return
            
    print('NG')
        
        
    
    
    
main()

Submission status: Wrong Answer

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

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

print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#abc165_a.py
K = int(input())
I = input().split()
A = int(I[0])
B = int(I[1])
if(A//K == B//K):
    print("NG")
else:
    print("OK")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

target = a
res = 'No'
while target <= b:
    if target % k == 0:
        res = 'OK'
    target += 1
print(res)

Submission status: Wrong Answer

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

if a // k < b // k:
    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())
c=b-a
p=c/K
if p > 0:
    print("OK")
else:
    print("NG")