Problem:


Score : 100 points

Problem Statement

Determine if we can choose K different integers between 1 and N (inclusive) so that no two of them differ by 1.

Constraints

1\leq N,K\leq 100

N and K are integers.

Input

Input is given from Standard Input in the following format:

N K

Output

If we can choose K integers as above, print YES; otherwise, print NO.

Sample Input 1

3 2

Sample Output 1

YES

We can choose 1 and 3.

Sample Input 2

5 5

Sample Output 2

NO

Sample Input 3

31 10

Sample Output 3

YES

Sample Input 4

10 90

Sample Output 4

NO



Sample input:
3 2


Sample output:
YES

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if N <= K and N!=1 and K!=1:
  print("NO")
elif 2*N-1 >= K:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
n, k = (int(x) for x in input().split())
if k <= int(n/2.0+1):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
from sys import stdin
N,K=[int(x) for x in stdin.readline().rstrip().split()]
if K == 1:
    print("YES")
else:
    if N/K >1:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
def Main(n, k):
    if n - k > 0:
        return "YES"
    else:
        return "NO"

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
even = 0
odd = 0

for num in range(1,N+1):
  if num % 2 == 0:
    even += 1
  elif num % 2 == 1:
    odd += 1
if even + odd > K:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
#n = int(input())
a,b=map(int,input().split()) #横並び
#x=[int(input()) for i in range(3)] #縦に並んだのを配列に
#y=list(map(int,input().split())) #横に並んだのを配列に
print('YNEOS'[not((a+2)//2>=b)::2])

Submission status: Wrong Answer

Solution code:

A, B = map(int, input().split())
line = []
for k in range(0,A+1):
    line.append(k)

print(line)
if len(line) >= B:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
num = int(n/2) + 1
if (n!=2 and num>=k):
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if (N / 2) + 1 >= K:
    
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
n=n/2+1
if n>=k:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
import math

n, k = [int(i) for i in input().split()]

if math.ceil(n-1) < k:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
N, K = map(int,input().split())
if N <= 2:
    print("NO")
    exit(0)

if N%2 + N//2 >= K:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
i = input().split()
n = int(i[0])
k = int(i[1])

if k < 0:
    print("NO")

else:
    x = n % 2
    y = n / 2
    if x > 0:
        y += 1

    if y > k:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
N,K=map(int,input().split())
a=N//K+1
if a>=K:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

if k >= n:
  print("NO")
elif k <= 1:
  print("NO")
elif n % k == 0 or n % k == k - 1:
  print("YES")

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if N <= K:
  print("NO")
elif 2*N-1 >= K:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
even = 0
odd = 0

for num in range(1,N+1):
  if num % 2 == 0:
    even += 1
  elif num % 2 == 1:
    odd += 1
if even + odd > K:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if K >= round(N/2):
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().strip().split())
if n<=k or k<=1:
    print("NO")
else:
    t=-(-n//2)
    if k<=t:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

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

cnt = 0
for nn in range(1, N+1):
    for mm in range(nn + 2, N+1):
        #print(nn, mm)
        cnt += 1
        break
#print(cnt)
if cnt >= K:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
line = []
for k in range(0,A+1):
    line.append(k)
line = line[1::2]
print(line)
if len(line) >= B:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N, K = input().split() 
if int(N)==1:
    if int(K)==1:
        print('YES')
    else:
        print('NO')
elif int(N)>int(K):
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
# coding:utf-8

import math

N, K = map(int, input().split())

if math.ceil(N / 2) >= K:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
N , K = (int(i) for i in input().split()) 
if N % 2 == 0:
    if N//2 >= K:
        print('Yes')
    else:
        print('No')
elif N % 2 == 1:
    if N//2 +1 >= K:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

if N % 2 == 1 :
    if N - M >= 1 :
        ans = "YES"
    else :
        ans = "NO"
else :
    if N - M >= 2 :
        ans = "YES"
    else :
        ans = "NO"
print(ans)

Submission status: Wrong Answer

Solution code:
N,K = input().split()
if (int(N) // int(K))>1 :
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

import sys

i_str = input().split(' ')
a = int(i_str[0])
n = int(i_str[0])

if (a+1) / 2 >= n:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

if n/2 > k:
    print("YES")
elif n%2 + 1 == k:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N, K = map(int,input().split())
if N == 2:
    print("NO")
    exit(0)

if N%2 + N//2 >= K:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

if a-b > 0:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N,K = map(int,input().split())
if N/K > 1.5:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

if n>k:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if N == K:
  print("NO")
elif 2*N-1 >= K:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
N,K = [int(i) for i in input().split()]
if (N / 2 >= K or K == 1):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if N>K:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
from sys import stdin
N,K=[int(x) for x in stdin.readline().rstrip().split()]
if N/K >1:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

if n-1==1:
    print("NO")
if n - 1 >= k:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
b = - ( -a[0] // 2 )
if b >= a[1]:
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
import math

n, k = [int(i) for i in input().split()]

if math.ceil(n-1) < k:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

if int(n/2) + 1 >= k:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
a=input().split()
b=int(a[0])
c=int(a[1])
if b>=(c+1)/2:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if (N / 2) + 1 >= K:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
line = []
for k in range(0,A):
    line.append(k)
line = line[1::2]
if len(line) >= B:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

if -(-1*N // 2)  > K:
	print "YES"
else:
	print "NO"

Submission status: Wrong Answer

Solution code:
def antiAdjacency(n, k):
    if n - k > 0:
        return "YES"
    else:
        return "NO"

Submission status: Wrong Answer

Solution code:
# 2019/02/09
# Minnano Procon 2019 - A

# Input
n, k = map(int,input().split())

# Calc
wn = int(n / 2 + 0.5)
print(wn)

if wn >= k:
    ans = "YES"
else:
    ans = "NO"

# Output
print(ans)

Submission status: Wrong Answer

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

if n-1==1:
    print("NO")
elif n - 1 > k:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if K > round(N/2):
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

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

if n-1>=k:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

if a%b > 0:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N , K = (int(i) for i in input().split()) 
if N % 2 == 0:
    if N/2 >= K:
        print('Yes')
    else:
        print('No')
elif N % 2 == 1:
    if N/2 +1 >=K:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
n, k = [int(x) for x in input().split()]
if n % 2 == 1:
    ans = 'yes' if (n + 1) / 2 >= k else 'no'
else :
    ans = 'yes' if n / 2 >= k else 'no'

print(ans)

Submission status: Wrong Answer

Solution code:
import math
import copy
import bisect








def nCast(number):
    if type(number)==str:
        return int(number)
    for idx in range(0,len(number)):
        if type(number[idx])==str:

            number[idx]=int(number[idx])
        else:
            nCast(number[idx])
    return number
    
def inputArr(w):
    l=list()
    for idx in range(0,w):
        l.append(input())
    return l
def inputArr1(w):
    l=list()
    for idx in range(0,w):
        l.append(input().split())
    return l

n=nCast(input().split())

def func():
    if n[1]==1:
        return "YES"
    if n[0]%2!=0:
        n[0]=n[0]+1
    if n[1]*2==n[0]:
        return "YES"
    else:
        return "NO"
    
print(func())

Submission status: Wrong Answer

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

print('YES' if N > K else 'NO')

Submission status: Wrong Answer

Solution code:
# A Anti-Adjacency
n,k = map(int,input().split())
if int((n +1) / 2) > k:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

if N==K==2:
	print "NO"
else:
	print "YES" if (K-1)*2<=N else "NO"

Submission status: Wrong Answer

Solution code:
N, K = map(int,input().split())
if N>=(K-1)*2 + 1:
    ans = 'yes'
else:
    ans = 'no'
print(ans)

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split(" "))
resultCount = round(N/2)
if resultCount >= K :
    print("YES")
else :
    print("NO")

Submission status: Wrong Answer

Solution code:
N,K=map(int,input().split())
print("YES") if N-2 > 0 and (N+1)//2 >= K else print("NO")

Submission status: Wrong Answer

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

ans='NO'

if N>=K+1 and N>=2 :
    ans='YES'

print(ans)

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
n = (n+1)//2
if n >= k:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

print("YES" if n >= k*2 else "NO")

Submission status: Wrong Answer

Solution code:
N,K=map(int,input().split( ))
if N-K>1:
    print('YES')
else :
    print('NO')

Submission status: Wrong Answer

Solution code:
N,K = input().split()
if (int(N) / int(K))>1 :
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
i = input().split()
n = int(i[0])
k = int(i[1])

x = n % 2
y = n / 2
if x > 0:
    y += 1

if y > k:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N, K = map(int,input().split())
if N==K or K>N:
  print("NO")
else:
  print("YES")

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if N > K * 2:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
num = int(n/2) + 1
if num>=k:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

if n - 1 > k:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
if n%k == 0 or n <= k:
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
count=0
for i in range(1,n+1):
    for j in range(1,n+1):
        if(i-j==1):
            count+=1

if(count>=k):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a<=b :
    print("No")
else :
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N,K = map(int, input().split(" "))

if int((N / 2)) + 1 >= K:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
ans = "NO"
if n//2+1 >= k:
    ans = "YES"
print(ans)

Submission status: Wrong Answer

Solution code:
import math
import copy
import bisect








def nCast(number):
    if type(number)==str:
        return int(number)
    for idx in range(0,len(number)):
        if type(number[idx])==str:

            number[idx]=int(number[idx])
        else:
            nCast(number[idx])
    return number
    
def inputArr(w):
    l=list()
    for idx in range(0,w):
        l.append(input())
    return l
def inputArr1(w):
    l=list()
    for idx in range(0,w):
        l.append(input().split())
    return l

n=nCast(input().split())



def func():
    if n[1]==1:
        return "YES"
    if n[0]%2!=0:
        n[0]+=1
    if n[1]*2==n[0]:
        return "YES"
    else:
        return "NO"
    
print(func())

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
print(["YES", "NO"][n<=k])

Submission status: Wrong Answer

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

if 2*N-1 >= K:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
n,k= map(int, input().split())
if n+1>k*2:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a=input().split()
b=int(a[0])
c=int(a[1])
if b>=(c-1)/2:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if (N + K - 1) // 2 >= K:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
a = n / 2
if n == 2 and k == 1:
    print("YES")
elif n == 3 and k <= 2:
    print("Yes")
elif a >= k:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
k = (k+1)//2
if n >= k:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a<=b+1 :
    print("No")
else :
    print("Yes")

Submission status: Wrong Answer

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

if(A>2*B-1):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
if n % 2 == 0:
    print('YES' if n//2 > k else 'NO')
else:
    print('YES' if n//2+1 >= k else 'NO')

Submission status: Wrong Answer

Solution code:
N,K=map(int,input().split())
if N <= K :
    print('NO')
else :
    print('YES')

Submission status: Wrong Answer

Solution code:
n,k = map(int, raw_input().split())
if n <= k:
	print 'NO'
else:
	if ((n+1)/2) >= k or k == 1:
		print 'YES'
	else:
		print "NO"

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(200000)


def input():
    return sys.stdin.readline()[:-1]


def ii(t: type = int):
    return t(input())


def il(t: type = int):
    return list(map(t, input().split()))


def imi(N: int, t: type = int):
    return [ii(t) for _ in range(N)]


def iml(N: int, t: type = int):
    return [il(t) for _ in range(N)]


def solve():
    A, B = il()
    return "YES" if A - 1 <= B  else "NO"


if __name__ == "__main__":
    print(solve())

Submission status: Wrong Answer

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

if K >= N:
    print('NO')
elif len(list(range(1, N+1, 2))) >= K:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

if k <= n//2 + 1:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N, K = input().split() 
if N>K:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
a, b = list(map(int, input().split()))
print("YES" if (a + b - 1) / 2 >= b else "NO")

Submission status: Wrong Answer

Solution code:
#n = int(input())
a,b=map(int,input().split()) #横並び
#x=[int(input()) for i in range(3)] #縦に並んだのを配列に
#y=list(map(int,input().split())) #横に並んだのを配列に
print('YNEOS'[((a+2)/2.0<b)::2])

Submission status: Wrong Answer

Solution code:
N,K=map(int,input().split())
if N>2*K:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

N = N//2 + 1

if N >= K:
  res = "YES"
else:
  res = "NO"
if N == 1 and K == 0:
  res = "NO"
  
print(res)

Submission status: Wrong Answer

Solution code:
N,K=map(int,input().split( ))
if N <= K :
    print('NO')
else :
    print('YES')

Submission status: Wrong Answer

Solution code:
# coding: utf-8
line = input().split()


if(int(line[0])>int(line[1])):
    print("YES")
else :
    print("NO")

Submission status: Wrong Answer

Solution code:
N,K = map(int,input().split())
if N/K > 1:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if N % 2 == 0:
    maxk = N // 2 -1
else:
    maxk = N // 2 +1
if maxk >= K:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
if n-2*k>0:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools


sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]


def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    N, K = LI()

    if N % 2 == 0:
        # 割り切れる
        return K <= N*2
    else:
        return K <= N//2 +1



if main():
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

if K == 0:
    print("YES")
elif N / K > 1:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

max_num=N//2+1
if max_num>=K:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a=input()
N=int(a.split()[0])
K=int(a.split()[1])

if(N>(K/2-1)):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a>=2*b+1:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
N, K = [int(_) for _ in input().split()]

if N == 2:
    print("NO")

elif N // 2 + 1 >= K:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
print("YES") if n/2+1>=k else print("NO")

Submission status: Wrong Answer

Solution code:
import sys

n, k = map(int, input().split())

cnt = 1
for i in range(1,n,2):
    cnt += 1
if cnt < k:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
# A Anti-Adjacency
n,k = map(int,input().split())
if int(n +1 / 2) >= k:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(200000)


def input():
    return sys.stdin.readline()[:-1]


def ii(t: type = int):
    return t(input())


def il(t: type = int):
    return list(map(t, input().split()))


def imi(N: int, t: type = int):
    return [ii(t) for _ in range(N)]


def iml(N: int, t: type = int):
    return [il(t) for _ in range(N)]


def solve():
    A, B = il()
    return "Yes" if A - 1 >= B  else "No"


if __name__ == "__main__":
    print(solve())

Submission status: Wrong Answer

Solution code:
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools


sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]


def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    N, K = LI()
    print(N, K)

    if N % 2 == 0:
        # 割り切れる
        return K <= N*2
    else:
        return K <= N//2 +1



if main():
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

if (N//2 == 0 and N / 2 >= K) or (N//2 == 1 and (N + 1) / 2 >= K):
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
count = 1
for i in range(1,N,2):
    count+=1
if(count >= K):
    print("YES")
    
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
if n//2+ n%2 >= k:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if N <= K:
    print('NO')
else:
    if N % 2 == 1:
        print('YES')
    else:
        if N / 2 >= K:
            print('YES')
        else:
            print('NO')

Submission status: Wrong Answer

Solution code:
list = input().split()
for i in range(len(list)):
  list[i] = int(list[i])
  i = i + 1

if(list[0] > list[1]):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
N, K = map(int,input().split())
if(N%K != 1):
  print("NO")
else:
  print("YES")

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if N % 2 != 0 and K <= round(N / 2):
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import math
import copy
import bisect








def nCast(number):
    if type(number)==str:
        return int(number)
    for idx in range(0,len(number)):
        if type(number[idx])==str:

            number[idx]=int(number[idx])
        else:
            nCast(number[idx])
    return number
    
def inputArr(w):
    l=list()
    for idx in range(0,w):
        l.append(input())
    return l
def inputArr1(w):
    l=list()
    for idx in range(0,w):
        l.append(input().split())
    return l

n=nCast(input().split())



def func():
    if n[0]%2!=0:
        n[0]+=1
    if n[1]*2==n[0]:
        return "YES"
    else:
        return "NO"
    
print(func())

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
if n <= k:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
a=input()
N=int(a.split()[0])
K=int(a.split()[1])

if(N>K/2):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
N,K = map(int,input().split())
if (N+1) // 2 > K-1:
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
N,K = map(int,input().split())
if 2*K-1 <= N:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
N,K= map(int,input().split())
if N > K*2-1:
	print('YES')
else:
	print('NO')

Submission status: Wrong Answer

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

if int(a/2) + 1 >= b:
    result = 'YES'
else:
    result = 'NO'
# 出力
print("{}".format(result))

Submission status: Wrong Answer

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

if k <= n-1:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
#coding:utf-8
n,k = map(int,input().split())
if 2 * k - 1 <= n:
    print ("Yes")
else:
    print ("No")

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
if int(n/2)+1 >= k:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
if n == 2 and k > 1:
    print("NO")
    exit()
if n//2 + 1 >= k:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

re = 'No'
if (N+1)/2 >= K:
    re = 'Yes'

print(re)

Submission status: Wrong Answer

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

ans='NO'

if N>=K+1:
    ans='YES'

print(ans)

Submission status: Wrong Answer

Solution code:
import sys

n, k = map(int, input().split())
if n == 2 and k == 2:
    print("NO")
    sys.exit()
if n // 2 + 1 >= k:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N,K=map(int, raw_input().split())
print "YES" if (K-1)*2<=N else "NO"

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
print('YES' if N//2+1 >= K else 'NO')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
n,k = map(int, input().split())

if n==2 and k==2:
    print("NO")
elif n//2+1>=k:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N,K = map(int, input().split(" "))

if (N / 2) + 1 >= K:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
if n % 2 == 0:
    if n >= k * 2:
        print("Yes")
    else:
        print("No")
else:
    if n + 1 >= k * 2:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
N, K = map(int,input().split())
if N==K or K>=N:
  print("NO")
else:
  print("YES")

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
l = n//2
if n == 1: l = 1
if k <= l:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
in_list = input().split()
n = int(in_list[0])
k = int(in_list[1])
num = 1
ans = "Yes"
for i in range(k):
   num+=2
   if(num>n):
      ans="No"
      break
print(ans)

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
count = 1
for i in range(1,N,2):
    count+=1
if(count >= K):
    print("Yes")
    
else:
    print("No")

Submission status: Wrong Answer

Solution code:
n,k = list(map(int, input().split()))
if n//2+((n+1)%2) >= k:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
(N,K) = map(int, input().split())
if 2*K -1 <= N:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
N, K = map(int,input().split())
if (N/2 + 1) >= K:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if K <= N // 2 + 1:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
import math
N,K = map(int,input().split())
if math.ceil(N/K) > 1:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if (N-1)//K>0:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
n,k=map(int, input().split())
a = n // 2
a += n % 2
print(a)
if a >= k:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
if n > 2*(k-1) :
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
p = input().split()
n = int(p[0])
k = int(p[1])
if k <= n//2+1:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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


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

    if n <= k:
        print('NO')
    else:
        print('YES')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n,k = map(int, input().split())
print("YNEOS"[n//2+1 < k::2])

Submission status: Wrong Answer

Solution code:
n,k = map(int, raw_input().split())
if n <= k:
	print 'NO'
else:
	if n/k >= 2 or k == 1 or n <= 3:
		print 'YES'
	else:
		print 'NO'

Submission status: Wrong Answer

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

if int(N/2)+1 >= K:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if (N + K - 1) // 2 >= K:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
N, K = map(int,input().split())
if (N/2 + 1) >= K:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

ans = ''
if (N+1)//2 >= K:
    ans = 'YES'
else:
    ans = 'No'

print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np
n,k = list(map(int, input().split()))

if (n//2 + 1) >= k:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

if int(N/2)+1>=K:
        print("YES")
else:
        print("NO")

Submission status: Wrong Answer

Solution code:
# A Anti-Adjacency
n,k = map(int,input().split())
if int(n +1 / 2) > k:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
ans = n // 2
if (n + 1) // 2 > k:
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

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

def solve():
    n, k = map(int, input().split())
    print("YES" if (n // 2 + 1) >= k else "NO")

if __name__=="__main__":
    solve()

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a>b:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

print("YES" if n <= k*2 else "NO")

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
N = a[0]
K = a[1]

if (N // 2 + 1) >= K:
  print('YES')

else:
  print('NO')

Submission status: Wrong Answer

Solution code:
nk = [int(i) for i in input().split()]
if nk[0] > nk[1]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
l = n//2
if k <= l:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

print("Yes" if n <= k*2 else "No")