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 + 1 >= 2 * K:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]

tin=lambda : map(int, input().split())
lin=lambda : list(tin())
mod=1000000007

#+++++

def main():
	#a = int(input())
	#b , c = tin()
	#s = input()
	b, c= tin()
	return 'Yes' if (b + 1) // 2 >= c else 'No'
	
	
	
#+++++
isTest=False

def pa(v):
	if isTest:
		print(v)
		
def input_clipboard():
	import clipboard
	input_text=clipboard.get()
	input_l=input_text.splitlines()
	for l in input_l:
		yield l

if __name__ == "__main__":
	if sys.platform =='ios':
		if input_method==input_methods[0]:
			ic=input_clipboard()
			input = lambda : ic.__next__()
		elif input_method==input_methods[1]:
			sys.stdin=open('inputFile.txt')
		else:
			pass
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Wrong Answer

Solution code:
import sys

input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]

tin=lambda : map(int, input().split())
lin=lambda : list(tin())
mod=1000000007

#+++++

def main():
	#a = int(input())
	#b , c = tin()
	#s = input()
	b, c= tin()
	return 'Yes' if b >= (c*2)-1 else 'No'
	
	
	
#+++++
isTest=False

def pa(v):
	if isTest:
		print(v)
		
def input_clipboard():
	import clipboard
	input_text=clipboard.get()
	input_l=input_text.splitlines()
	for l in input_l:
		yield l

if __name__ == "__main__":
	if sys.platform =='ios':
		if input_method==input_methods[0]:
			ic=input_clipboard()
			input = lambda : ic.__next__()
		elif input_method==input_methods[1]:
			sys.stdin=open('inputFile.txt')
		else:
			pass
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rf = lambda: map(float, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, b = rm()
if a <= b:
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rf = lambda: map(float, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, b = rm()
if a >= b:
    print('NO')
else:
    print('YES')

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:
#「みんなのプロコン 2019」a
import itertools
n,k=map(int,input().split())
num=[int(i) for i in range(1,n+1)]
cnt=0
for x,y in itertools.combinations(num,2):
    if abs(x-y)!=1:
        cnt+=1
if cnt>=k:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
N, K = map(int,input().split())
if N + 1 >= 2 * 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 "NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
print('YES' if n <= k * 2 + 1 else '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:
n, k = map(int, input().split())
if n > k:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
N,K=map(int,input().split())
print('YNeos'[2*K-1>N::2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y = map(int,input().split())

if x > y:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
res = 0
for i in range(1,n-1):
    for j in range(i+2,n+1,2):
        res += 1
if k <= res:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print("YNEOS"[eval(input().replace(" ","<="))::2])

Submission status: Wrong Answer

Solution code:
print("YNeos"[eval(input().replace(" ","<="))::2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
# -*- coding: utf-8 -*-

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]

######OUTPUT######
def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()

#####Shorten#####
def DD(arg): return defaultdict(arg)


#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr

#####MakeDivisors######
def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors

#####MakePrimes######
def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum

#####GCD#####
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#####BitCount#####
def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count

#####ChangeBase#####
def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))

#####IntLog#####
def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count

#############
# Main Code #
#############
N,K = IL()

if -(-N//2)>=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:
x, y  = map(int,input().split())

if x > y:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

#入力
# s = input()[0:-1]
# n = int(input())
n,k = map(int, input().split())
# a = list(map(int,input().split()))
# a = [int(input()) for i in range()]


# ab=[]
# for i in range():
#     a,b = map(int, input().split())
#     ab.append([a,b])


     
def main():
    if (n+2-1)//2 <k:
        print("No")
    else:
        print("Yes")

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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:
N,K=map(int,input().split())
if K>=K*2-1:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N,K=map(int, input().split())
print('YES' if N>2*K-1 else '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 = list(map(int,input().split()))
if (N+1)//2 >= K:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

from math import ceil

n, k = map(int, read().split())
if ceil(n / k) >= 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 == n:
  print('NO')
else:
  print('YES')

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

    n,k = map(int, input().split())
    if n > k:
        print('YES')
    else:
        print('NO')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

if (n+1//2)>=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:
a,b = map(int,input().split())
if b+b-1 >= a:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split());print("YNEOS"[k*2-(k%2==0)>n::2])

Submission status: Wrong Answer

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

ans = 0

for i in range(1,N+2,2):
    ans = ans + 1

if ans >= K:
    print("YES")
    sys.exit()

print("NO")

Submission status: Wrong Answer

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

if N <= K:
    print("NO")
    sys.exit()

ans = 0

for i in range(0,N+1,2):
    ans = ans + 1

if ans >= K:
    print("YES")
    sys.exit()

print("NO")

Submission status: Wrong Answer

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

if N <= K:
    print("NO")
    sys.exit()

ans = 0

for i in range(1,N+2,2):
    ans = ans + 1

if ans >= K:
    print("YES")
    sys.exit()

print("NO")

Submission status: Wrong Answer

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

if N <= K:
    print("NO")
    sys.exit()

ans = 0

for i in range(1,N+1,2):
    ans = ans + 1

if ans >= K:
    print("YES")
    sys.exit()

print("NO")

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
x = [i for i in range(n+2) if i % 2 == 1]
if int(len(x)) >= k:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    a = [int(i) for i in input().split()]


    if a[0]//2 >=a[1] :
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

n,k =iim()
if n%2 == 0:
    if k <= n//2:
        print('YES')
elif k <= (n-1)//2+1:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

if (N+1)//K >= 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:
n,k=map(int,input().split())
print("Yes" if n//2+n%2>=k else "No")

Submission status: Wrong Answer

Solution code:
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 = map(int, input().split())

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
a=n/2+0.5
if n>=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 <= K:
    print("NO")
elif N == K:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

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

if  N <= K:
    print("NO")
elif N == K:
    print("NO")
else:
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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())

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

Submission status: Wrong Answer

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


print("YES" if n-2 >= k or k == 1 or (n == 3 and 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" if n-1 <= k else "YES")

Submission status: Wrong Answer

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

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

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,b= map(int,input().split())
print("Yes" if (a+1)//2>=b else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print("YES" if a>b else "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:
#coding:utf-8
n, k = map(int, input().split())
if n >= 2 * (k-1)-1:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
if k*2<=n:
  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:
n,k=map(int,input().split())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if round(n / 2) >= k:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

if len([i for i in range(1, n+1) if i % 2 != 0]) >= k:
    print("YES")
else:
    print("No")

Submission status: Wrong Answer

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

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())
print("Yes" if (n+1)//2>=k else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

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

# print(N)
# print(K)

# print(N // K)
# print(N % K)

# print((N // K) + (N % K) >= K)

if (N // 2) + (N % K) >= 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:
n,k=map(int,input().split())
print('Yes' if n/2+0.5>=k else 'No')

Submission status: Wrong Answer

Solution code:
n, k= [ int(v) for v in input().split() ]
print("Yes" if k <= (n+1)//2 else "No")

Submission status: Wrong Answer

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

print('YES' if n//2>k else 'NO')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main(N, K):
    if N - 1 >= K:
        return 'YES'
    else:
        return 'NO'


if __name__ == '__main__':
    N, K = map(int, input().split(' '))
    print(main(N, K))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
if n / 2 + 1 >= k or n == 2 and k == 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:
n,k = map(int,input().split())
if n * 2 - 1 > k or n == 1 and k == 1:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
if n > k or n == 1 and 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:
n,k = map(int,input().split())
if n > k:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
print("YES" if k==1 or n-k>0 else "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())
print('YES' if N >= 1+2*K else 'NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
if N > K and N-K >= 1:
    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 + 1) >= K:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
print('YES' if (N + 1) // 2 > K else '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 2 * k - 1 < n : print("Yes")
else : print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
sum = 0
for i in range (1, n-1):
    sum = sum + i
if k >= sum:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
sum = 0
for i in range (1, n-1):
    sum = sum + i
    print(sum)
if k >= sum:
    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:
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())
res = "NO"
if N + 1 / 2 >= K:
  res = "YES"
print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

YES = "YES"  # type: str
NO = "NO"  # type: str

def solve(N: int, K: int):
    if N - K >= 1:
        ret = YES
    else:
        ret = NO
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    solve(N, K)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
input=sys.stdin.read
d=list(map(int, input().split()))
c=round(float(d[0])/d[1])
if c < 2:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
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=map(int,input().split())
if n>=k*2+1:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if (N+1)/2 > K:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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 N<K:
    print('NO')
    exit()
elif N> K:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k = input().split()
n = int(n)
k = int(k)
if 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:
    print('YES')
    
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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