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 a%k==0 or b%k==0:
  print("OK")
elif (a-b)==0 and k==1:
  print("OK")
elif (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 // K * K >= A:
  print('OK')
else:
  print('NO')

Submission status: Wrong Answer

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

for i in range(1,1000):
  if a<=k*i and k*i<=b:
    print('OK')
    q=1
    

if q==0:
  print('NG')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
k=int(input())
[a,b]=list(map(int, input().split()))
A=math.floor(a/k)
B=math.floor(b/k)
if A!=B:
  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())
a = A % K
b = B % K
if A == B:
    if A % K == 0:
        print('OK')
    else:
        print('NG')
elif b - a == B - A:
    print('NG')
else:
    print('OK')

Submission status: Wrong Answer

Solution code:
k = int(input())

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if B - A >= K:
    print("OK")
elif A == B and 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:
x  = int(input())
t = 100
ans = 0
while t<x:
  t = t//100
  ans +=1

print(ans)

Submission status: Wrong Answer

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

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

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, Counter
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)]
#S = input()
#S = [input() for _ in range(N)]

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a == b and a % target == 0:
    print('Ok')
elif (a // target + 1) * target <= 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):
    if i % K == 0:
        print("OK")
        break
    else:
        continue

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import bisect
import copy
import heapq
import math
import sys
from collections import *
from itertools import accumulate, combinations, permutations, product
from math import gcd
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

x=int(input())
tmp=100
ans=0
while tmp<x:
    ans+=1
    tmp=math.floor(tmp*1.01)
    # print(tmp)
print(ans)

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:
K = int(input())
A, B = map(int, input().split())

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

while True:
    if a % k == 0:
        print("OK")
        break
    if a == b:
        print("NO")
        break
    a += 1

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
class UnionFind:
    def __init__(self, n):
        self.root = [i for i in range(n + 1)]
        self.size = [1] * (n + 1)
    def find(self, x):
        y = self.root[x]
        if x == y:
            return x
        else:
            z = self.find(y)
            self.root[x] = z
            return z
    def union(self, x, y):
        rx = self.find(x)
        ry = self.find(y)
        sx = self.size[rx]
        sy = self.size[ry]
        if rx == ry:
            return 0
        else:
            if sx >= sy:
                self.root[ry] = rx
                self.size[rx] = sx + sy
            else:
                self.root[rx] = ry
                self.size[ry] = sx + sy
        return sx * sy
    def check(self):
        print([self.find(i) for i in range(1, len(self.root))])

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int, input().split(" "))
ngflag = True
while(a <= b):
    if a % 7 == 0 and a != 0:
        print("OK")
        ngflag = False
        break
    a += 1
if ngflag:
    print("NG")

Submission status: Wrong Answer

Solution code:

k = int(input())
a, b = map(int, input().split(" "))
ngflag = True
while(a <= b):
    if a % 7 == 0:
        print("OK")
        ngflag = False
        break
    a += 1
if ngflag:
    print("NG")

Submission status: Wrong Answer

Solution code:
class Prime:
    def __init__(self, n):
        self.prime_factor = [i for i in range(n + 1)]
        self.prime = []
        for i in range(2, n + 1):
            if self.prime_factor[i] == i:
                for j in range(2, n // i + 1):
                    self.prime_factor[i * j] = i
                self.prime.append(i)
        #print(self.prime_factor)
        #print(self.prime)
    def factorize(self, m):
        ret = []
        while m != 1:
            if not ret:
                ret = [[self.prime_factor[m], 1]]
            elif self.prime_factor[m] == ret[-1][0]:
                ret[-1][1] += 1
            else:
                ret.append([self.prime_factor[m], 1])
            m //= self.prime_factor[m]
        return ret
    def divisors(self, m):
        ret = []
        for i in range(1, int(m ** 0.5) + 1):
            if m % i == 0:
                ret.append(i)
                if i != m // i:
                    ret.append(m // i)
        #self.divisors.sort()
        return ret

Submission status: Wrong Answer

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

t = a<=b

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

Submission status: Wrong Answer

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

t = a<b

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

Submission status: Wrong Answer

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

t = 0

a <= t <= b

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
class Prime:
    def __init__(self, n):
        self.prime_factor = [i for i in range(n + 1)]
        self.prime = []
        for i in range(2, n + 1):
            if self.prime_factor[i] == i:
                for j in range(2, n // i + 1):
                    self.prime_factor[i * j] = i
                self.prime.append(i)
        print(self.prime_factor)
    def factorize(self, m):
        self.factorize = []
        while m != 1:
            if not self.factorize:
                self.factorize = [[self.prime_factor[m], 1]]
            elif self.prime_factor[m] == self.factorize[-1][0]:
                self.factorize[-1][1] += 1
            else:
                self.factorize.append([self.prime_factor[m], 1])
            m //= self.prime_factor[m]
        return self.factorize
    def divisors(self, m):
        self.divisors = []
        for i in range(1, int(m ** 0.5) + 1):
            if m % i == 0:
                self.divisors.append(i)
                if i != m // i:
                    self.divisors.append(m // i)
        #self.divisors.sort()
        return self.divisors

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = [int(i) for i in input().split()]
ans = 'OK' if - a + b >= k else 'NG'
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
AB = input().split()
A = int(AB[0])
B = int(AB[1])

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

Submission status: Wrong Answer

Solution code:
K = int(input())
AB = input().split()
A = int(AB[0])
B = int(AB[1])

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

Submission status: Wrong Answer

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

a, mod_a = divmod(A, K)
b, mod_b = divmod(B, K)

if mod_a == 0 or mod_b == 0:
    print('OK')
    exit()

if mod_a == mod_b:
    print('NG')
else:
    print('OK')

Submission status: Wrong Answer

Solution code:
X=int(input())
n=0
m=100
while True:
    n+=1
    m+=m//100
    if m >=X:
        print(n)
        break

Submission status: Wrong Answer

Solution code:
X=int(input())
n=0
m=100
while True:
    n+=1
    m+= m//100
    if m >=X:
        print(n)
        break

Submission status: Wrong Answer

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

print(cnt)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
X = int(input())

a = 100
i = 0
while a < X:
  a = int(a*1.01)
  i += 1

print(i)

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 = 'NO'
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())

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

print('NO')

Submission status: Wrong Answer

Solution code:
class UnionFind:
    def __init__(self, n):
        self.root = [i for i in range(n + 1)]
        self.size = [1] * (n + 1)
    def find(self, x):
        y = self.root[x]
        if x == y:
            return x
        else:
            z = self.find(y)
            self.root[x] = z
            return z
    def union(self, x, y):
        rx = self.find(x)
        ry = self.find(y)
        sx = self.size[rx]
        sy = self.size[ry]
        if rx == ry:
            return 0
        else:
            if sx >= sy:
                self.root[ry] = rx
                self.size[rx] = sx + sy
            else:
                self.root[rx] = ry
                self.size[ry] = sx + sy
        return sx * sy

Submission status: Wrong Answer

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

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

class UnionFind:
    def __init__(self, n):
        self.root = [i for i in range(n + 1)]
        self.size = [1] * (n + 1)
    def find(self, x):
        y = self.root[x]
        if x == y:
            return x
        else:
            z = self.find(y)
            self.root[x] = z
            return z
    def union(self, x, y):
        rx = self.find(x)
        ry = self.find(y)
        sx = self.size[rx]
        sy = self.size[ry]
        if rx == ry:
            return 0
        else:
            if sx >= sy:
                self.root[ry] = rx
                self.size[rx] = sx + sy
            else:
                self.root[rx] = ry
                self.size[ry] = sx + sy
        return sx * sy

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)]
#AB = [list(map(int, input().split())) for _ in range(N)]
#S = input()
#S = [input() for _ in range(N)]

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if '__main__' == __name__:
    resolve()

Submission status: Wrong Answer

Solution code:
s   = ['MG', 'OK']
k   = int(input())
a,b = map(int,input().split())
f   = 0
t   = a

if (a // k >= 1 and a % k == 0) or (b // k >= 1 and b % k == 0):
    f = 1
else:
    while t < b:
        if not (t // k >= 1 and t % k == 0):
            t += 1
        else:
            f = 1
            break
print(s[f])

Submission status: Wrong Answer

Solution code:
s   = ['Mo', 'Yes']
K   = str(input())
A,B = map(str,input().split())

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

f   = 0
t   = a

if (a // k >= 1 and a % k == 0) or (b // k >= 1 and b % k == 0):
    f = 1
else:
    while t < b:
        if not (t // k >= 1 and t % k == 0):
            t += 1
        else:
            f = 1
            break

print(s[f])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
if k==1 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 a == b == k:
    print('OK')
elif a == b and a % k == 0:
    print('OK')
else:
    for i in range(a, 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 a == b == k:
    print('NG')
elif a == b and a % k == 0:
    print('OK')
else:
    for i in range(a, 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 ())
X = 'No'
while A <= B:
  if A%K == 0:
    X = 'Yes'
    break
  A += 1
print (X)

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
AK = int(A / K)
BK = int(B / K)
G = BK - AK
O = 'OK' if G > 0 else 'NG'
print(O)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
K = int(input())
S = input().split()
A = int(S[0])
B = int(S[1])

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

Submission status: Wrong Answer

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

if flag==1:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
a, b = map(int, input().split())
c=b-a
d=c-x
if d > -2 or (a==b and a%x==0):
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k=int(input())
l,r=map(int,input().split())
if(r%k==0 or l%k==0 or r-l>=k):
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
k=int(input())
l,r=map(int,input().split())
if(r-l==0 or r-l>=k):
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

min_value = a // k
max_value = b // k
if k * (min_value + 1) >= a and k * (max_value - 1) <= b:
    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+1):
	if i % k == 0:
		print('Yes')
		sys.exit()
print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if A == 0 or B == 0:
    print("OK")

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

    else:
        print("NG")

Submission status: Wrong Answer

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

if A == 0 or B == 0:
    print("OK")

else:
    if (b-a)//k != 0:
        print("OK")

    else:
        print("NG")

Submission status: Wrong Answer

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

if k == 1:
    print("OK")
else:
    if a % k == 0 or b % k == 0:
        print("OK")

    else:
        if (b-a)//k != 0:
            print("OK")

        else:
            print("NG")

Submission status: Wrong Answer

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

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

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("NG")
else:
  print("OK")

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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

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

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    s = list(map(int,input().strip().split()))

    if s[0] % n == 0 or s[1] % n == 0:
        print("OK")
        return 

    if (s[1] - s[0]) > n:
        print("OK")
        return 
    else:
        print("NG")
        return

main()

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    s = list(map(int,input().strip().split()))

    if n == 1:
        print("OK")
        return
    
    if s[0] % n == 0 or s[1] % n == 0:
        print("OK")
        return 
    if (s[1] - s[0]) >= n:
        print("OK")
        return 
    else:
        print("NG")
        return

main()

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    s = list(map(int,input().strip().split()))

    if n == 1:
        print("OK")
        return
    if (s[1] - s[0]) >= n:
        print("OK")
        return 
    else:
        print("NG")
        return

main()

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