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: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

arglist = [int(i) for i in raw_input().split()]
N = arglist[0]
K = arglist[1]

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

Submission status: Accepted

Solution code:
import sys

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

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

else:
  print('NO')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
n,k = map(int, input().split())
if n==1 and k==1:
  print('YES')
elif n <= k:
  print('NO')
elif n < ((k-1)*2+1) :
  print('NO')
else:
  print('YES')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np
n, k = (int(x) for x in input().split())
if n%2==0:
  if k <= n/2:
    print("YES")
  else:
    print("NO")
if n%2!=0:
  if k <= np.ceil(n/2):
    print("YES")
  else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans='NO'

if N%2==0 and K<=(N/2):
    ans='YES'
if N%2==1 and K<=((N+1)/2) :
    ans='YES'

print(ans)

Submission status: Accepted

Solution code:
def read():
    return int(input())

def reads():
    return list(map(int, input().split()))

n,k = reads()
cnt = 0
a = 1
while (a<=n):
    a += 2
    cnt += 1
if cnt >= k:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
import math
n, k = [int(x) for x in input().split(' ')]
if k <= math.ceil(n/2):
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

if math.ceil(n/2) < k:
    print("NO")
else:
    print("YES")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#-*- coding: utf-8 -*-
"""
https://yahoo-procon2019-qual.contest.atcoder.jp/tasks/yahoo_procon2019_qual_a
"""


def sol(n, k):
    ans = int(n/2)+1 if n % 2 == 1 else int(n/2)
    return 'YES' if ans >= k else 'NO'

test = False
#test = True
if test:
    n, k = 3, 2
    #S =list( map(int, "1 6 3".split()))
    print(sol(n, k))

    n, k = 5, 5
    #S =list( map(int, "7 4 0 3".split()))
    print(sol(n, k))
    #
    n, k = 31, 10
    #S =list( map(int, "1000000000000".split()))
    print(sol(n, k))

    n, k = 10, 90
    #S =list( map(int, "1000000000000".split()))
    print(sol(n, k))

else:
    n, k = map(int, input().split())
    #S =list( map(int, input().split()))
    print(sol(n, k))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def function(N, K):

	nums = 0
	if N%2 == 0:
		nums = len([_ for _ in range(N) if (_+1)%2==0])
	else:
		nums = len([_ for _ in range(N) if (_+1)%2==1])
		
	if nums >= K:
		print('YES')
	else:
		print('NO')
	

def main():
	nums = input().split(' ')
	function(int(nums[0]), int(nums[1]))

if __name__ == '__main__':
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

a = 0
b = 0

for i in range(n):
    if i % 2 == 1:
        a = a + 1
    else:
        b = b +1

if a >= k or b >= k:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

if (n+1)//2 < m:
    print("NO")
if (n+1)//2 >= m:
    print("YES")

Submission status: Accepted

Solution code:
import sys,collections,math;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
N,K = map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0
for i in range(1,N+1,2) :
    cnt += 1
if cnt >= M :
    ans = "YES"
else :
    ans = "NO"
print(ans)

Submission status: Accepted

Solution code:
nk = list(map(int,input().split()))
n=nk[0]
k=nk[1]
if n >= 2*k-1:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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


lst = range(1, N + 1, 2)

if len(lst) >= K:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
N , K = map(int, 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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# 01

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

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

Submission status: Accepted

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

Submission status: Accepted

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

max_density = k * 2 - 1

if n >= max_density:
    print("YES")
else:
    print("NO")
exit(0)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

res = (N+1) // K

if (2 <= res):
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

print('{}'.format(ans))

Submission status: Accepted

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

import sys

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

# print(N//2)

Submission status: Accepted

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

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

threshold = K * 2 - 1

if( N >= threshold):
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(res)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
N, K = map(int, input().split())
print('YES' if K <= ((N + 1) // 2) else 'NO')

Submission status: Accepted

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

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

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

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

# Output
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

Solution code:
#coding:utf-8

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


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

if count < K:
    print('NO')
else:
    print('YES')

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

N, K = map(int, input().split())
if K <= math.ceil(N / 2.0):
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

print(["YES", "NO"][-(-N//2)<M])

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline

def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [N, K] = [long(input_raw[0]), long(input_raw[1])]
    if N/2 + N % 2 >= K :
        print "YES"
    else:
        print "NO"

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
count = 0
for i in range(1,N+1):
    if i%2 == 0:
        pass
    else:
        count += 1

if count >= K:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

fig = 0

ans = int(N / 2 +0.5)

#print(ans)

if  ans < K:
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
"""
問題文

1 以上 N 以下の異なる整数を、差が 1 の整数をともに選ばないように K 個選ぶことができるか判定してください。
制約

    1≤N,K≤100
    N,K は整数である
"""

def func(N , K) : 
    #K = 1 OK
    #K = 2 N > 2であればOK
    #K = 3 N > 5であればOK
    #K = 4 N > 7であればOK
    #K = k N > 2*k + 1
    if N >= 2*(K-1) + 1 : 
        return "YES"
    else : 
        return "NO"

if not func(3 , 2) == "YES" : 
    raise Exception("test 1 fail")

if not func(5, 5) == "NO" : 
    raise Exception("test 2 fail")

if not func(31 , 10) == "YES" : 
    raise Exception("test 3 fail")

if not func(10 , 90) == "NO" : 
    raise Exception("test 4 fail")

s = input().split(" ")
print(func(int(s[0]) , int(s[1])))

Submission status: Accepted

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

if(n>=(k * 2 - 1)):
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n,k = map(int, input().split())
a = [i for i in range(1,n+1,2)]
print("YNEOS"[len(a) < k::2])

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sat Feb  9 20:41:09 2019

@author: shinjisu
"""


# 2019/2/9 Yahoo
def getInt(): return int(input())


def getIntList(): return [int(x) for x in input().split()]


def zeros(n): return [0]*n


def db(x):
    global debug
    if debug:
        print(x)


def probA():
    N, K = getIntList()
    db((N, K))
    if (N+1)//2>=K:
        print('YES')
    else:
        print('NO')


def probB():
    return 0


def probC():
    return 0


debug = False
probA()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import os

if __name__ == "__main__":
    # input
    N, K = map(int, input().split())

    if N % 2 == 0:
        if K <= N / 2:
            print("YES")

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
if N % 2 == 1:
    N += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int,input().split())
cnt = 0
for i in range(1,N+1)[::2]:
  cnt += 1
  if(cnt == K):
    print("YES")
    break
else:
  print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

p = n % 2
s = int(n / 2)

if p:
    if k <= s+p:
        print('YES')
    else:
        print('NO')
else:
    if k <= s:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

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: Accepted

Solution code:
# coding: utf-8
# Your code here!
N,K =map(int, input().split(" "))
ans =0
for i in range(1,N+1):
    if i%2==1:
        ans +=1
if ans>=K:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

if x%2 == 0:
    z = x/2

else:
    z = x/2 + 1

if z >= y:
    print("YES")

else:
    print("NO")

Submission status: Accepted

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

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

Submission status: Accepted

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

if b <= (a+1)/2:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
import sys

def parse(inp):
    a,b=map(int,next(inp).split())
    return a,b
  
def main(inp):
    N,K=parse(inp)
#     print(int(N/2))
    
    if(N >= 2*K-1):
        return """YES
"""
    else: return """NO
"""
    
print(main(sys.stdin))

Submission status: Accepted

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

if N % 2 == 0:
    # guusuu
    if (N / 2) >= K:
        print('YES')
    else:
        print('NO')
else:
    # kisuu
    if ((N / 2) + 0.5) >= K:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

Solution code:
inp = [int(i) for i in input().split()]
if inp[0] % 2 == 0:
    if inp[1] <= inp[0]//2:
        print("YES")
    else:
        print("NO")
else:
    if inp[1] <= inp[0]//2 + 1:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
i = 1
c = 0
while i < n+1:
    c += 1
    i += 2

if c < k:
    print("NO")
else:
    print("YES")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin

def main():
    N, K = map(int, input().split())

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

input = lambda: stdin.readline()
main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = list(map(int, input().split()))
D = [i+1 for i in range(N[0])]

x = 1
for i in range(N[1]-1):
   x += 2
if x <= N[0]:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# encoding:utf-8

import copy
import numpy as np
import random


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

if 2*k <= n+1:
    answer = "YES"
else:
    answer = "NO"

print(answer)

Submission status: Accepted

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