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:
N,K = (int(i) for i in input().split())
if (N+1)/2 >= K:
    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())

score = 0

if N % 2 == 1:
    score = (N + 1) / 2
else:
    score = N / 2

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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())

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def i1():
 return int(input())
def i2():
 return [int(i) for i in input().split()]

[n,k]=i2()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N, K = list(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 n >= (k*2-1):
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

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:
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(input())
def S(): return input()
n,k=IL()
if n%2==0:
    if 2*k>n:
        print("NO")
    else:
        print("YES")
else:
    if n//2+1<k:
        print("NO")
    else:
        print("YES")

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

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

Submission status: Accepted

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

if N%2 == 0:
    a = N/2
else:
    a = int(N/2) + 1

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

Submission status: Accepted

Solution code:
# import bisect
# import heapq
# import math
# import random
# from fractions import gcd
# from collections import Counter, defaultdict, deque
# from decimal import Decimal
# from functools import lru_cache, reduce
# from itertools import combinations, combinations_with_replacement, product, permutations
# from operator import add, mul, sub, itemgetter
# import numpy as np

import sys
sys.setrecursionlimit(10000)

def read_int(read=None):
	if read == None:
		read = sys.stdin.readline().strip()
	return int(read)

def read_int_n(read=None):
	if read == None:
		read = sys.stdin.readline().strip()
	return [int(x) for x in read.split()]

def read_float(read=None):
	if read == None:
		read = sys.stdin.readline().strip()
	return float(read)

def read_float_n(read=None):
	if read == None:
		read = sys.stdin.readline().strip()
	return [float(x) for x in read.split()]

def read_str(read=None):
	if read == None:
		read = sys.stdin.readline().strip()
	return str(read)

def read_str_n(read=None):
	if read == None:
		read = sys.stdin.readline().strip()
	return [str(x) for x in read.split()]	
	
def error_print(*args):
	print(*args, file=sys.stderr)

def mt(f):
	import time
	def wrap(*args, **kwargs):
		s = time.time()
		ret = f(*args, **kwargs)
		e = time.time()
		error_print(e - s, 'sec')
		return ret
	return wrap

@mt
def slv(N, K):
	if N+1 >= 2* K:
		ans = 'YES'
	else:
		ans = 'NO'
	return ans

def main():
	t = '''
	'''.splitlines()
	N, K = read_int_n()
	print(slv(N, K))

if __name__ == '__main__':
	main()

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 // 2 + 1 >= k): 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:
import sys
n,k = map(int, input().split())
x = 1
k -=1
while k>0:
  x+=2
  if x>n:
    print("NO")
    sys.exit()
  k -=1
print("YES")

Submission status: Accepted

Solution code:
def judge(n, k):
    r = 0
    for _ in range(1, n + 1, 2):
        r += 1
        if r >= k:
            return True
    return False


def main():
    n, k = (int(z) for z in input().split())
    if judge(n, k):
        print("YES")
    else:
        print("NO")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

now = N//2+N%2

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

Submission status: Accepted

Solution code:
import numpy as np
import sys
input = sys.stdin.readline
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N,K= IL()
if K*2-1 <= N:
  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:
# https://yahoo-procon2019-qual.contest.atcoder.jp/tasks/yahoo_procon2019_qual_a

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 2*K -1 > N:
    print('NO')
else:
    print('YES')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
def solve(N, K):
    return "YES" if K <= math.ceil(N / 2) else "NO"

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

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

Submission status: Accepted

Solution code:
"""AtCoder"""

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*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 -*-

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = [int(s) for s 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:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(10000)


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, K):
    return 'YES' if int(math.ceil(N/2)) >= K else 'NO'


def main():
    # N = read_int()
    N, K = read_int_n()
    # A = [read_int_n() for _ in range(N)]
    print(slv(N, K))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import numpy as np


# x=1,y=2
N,K = map(int,input().split())

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

Submission status: Accepted

Solution code:
from math import ceil
N,K = map(int,input().split())
n = ceil(N/2)
if n >= 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:
n, k = map(int, input().split())
print("YES" if (k-1)*2 < n else "NO")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math
N, K = map(int, input().split())

if K <= math.ceil(N/2):
    print("YES")
else:
    print("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 2 * K - 1 <= N:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
#!venv/bin/python

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:
N,K =list(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 n >= k*2-1:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
if a[0] < 2 * a[1] - 1:
    print("NO")
else:
    print("YES")

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:
def main():
    n,k = map(int,input().split())
    if n%2 == 0:
        m = int(n/2)
    else:
        m = int(n/2)+1

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

main()

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# import numpy as np

# import sys
# sys.setrecursionlimit(200000)


N, K = list(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 <= N:
    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())

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = []
for i in range(1, N + 1, 2):
    ans.append(i)

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

Submission status: Accepted

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

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

if -(-1 * a // 2) >= b:
	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 = [int(_) for _ in 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)//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())
print("NO" if n//2+n%2<k else "YES")

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
import math
def LI(): return list(map(int, input().split()))
def II(): return int(input())
def LS(): return input().split()
def S(): return input()
def IIR(n): return [II() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
mod = 1000000007

#A
n,k = LI()
if 2*(k-1) < n:
    print("YES")
else:
    print("NO")
#B

#C

#D

#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

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

else:
    if K <= ((N - 2) // 2) + 1:
        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 k <= (n+1) / 2:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:

def main():
    buf = input()
    buflist = buf.split()
    N = int(buflist[0])
    K = int(buflist[1])
    count = 0
    for i in range(0, N, 2):
        count += 1
    if count >= K:
        print("YES")
    else:
        print("NO")

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    import sys
    input = sys.stdin.readline
    h,w = map(int, input().split())
    if w <= h//2 +h%2:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import sys
import math
import fractions

def j(q):
    if q==1: print("YES")
    else:print("NO")
    exit(0)


def ct(x,y):
    if (x>y):print("")
    elif (x<y): print("")
    else: print("")

def ip():
    return int(input())

#n = ip()                              #入力整数1つ
x,y= (int(i) for i in input().split())      #入力整数横2つ
#a,b,k = (int(i) for i in input().split())    #入力整数横3つ
#n,m,x,y= (int(i) for i in input().split())  #入力整数横4つ
#a = [int(i) for i in input().split()]        #入力整数配列
#a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列

#jの変数はしようできないので注意
#全足しにsum変数使用はsum関数使用できないので注意

if (x+1)//2 >= y:j(1)
else:j(0)

Submission status: Accepted

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

if (N - 1) // 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:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, os
try: from typing import Any, Union, List, Tuple, Dict
except ImportError: pass
sys.setrecursionlimit(10**6)
if os.environ.get("USER") == "shun":
    def debug(*args): print(*args, file=sys.stderr)
else:
    print("NO DEBUG", file=sys.stderr)
    def debug(*args): pass
def exit(): sys.exit(0)


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


if n % 2 == 0:
    m = n // 2
else:
    m = n // 2 + 1

if k <= m:
    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//2+1>=K:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

Solution code:
# A
N, K = map(int, input().split())
if K*2 <= N+1:
    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:
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, K = map(int, input().split())
if (N+1)//2 >= K:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
N, K = list(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 N>=2*K-1:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# encoding: 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+1)//2 >= k:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

def getMN():
    a = input().split()
    b = [int(i) for i in a]
    return b[0],b[1]

def getlist():
    a = input().split()
    b = [int(i) for i in a]
    return b

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

Submission status: Accepted

Solution code:
#!/mnt/c/Users/moiki/bash/env/bin/python
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())
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:
# coding:utf-8

import sys
# from collections import Counter, defaultdict

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

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 LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()


def ceil(n, m):
    return -(-n//m)


n, k = LI()


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n, k = [int(_) for _ in 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 = list(map(int,input().split()))
if N >= 2*K -1:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
n,k =(int(i) for i in input().split())
ans = 'YES'
if n >= 2*k-1 :
  print(ans)
else:
  print('NO')

Submission status: Accepted

Solution code:
# A
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 (N + 1) / 2 >= K:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
N,K=list(map(int,input().split()))
a=N//2+(N%2)
if a>=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:
def main():
    n, k = map(int, raw_input().split())
    if (n + 1) / 2 >= k:
        print 'YES'
    else:
        print 'NO'


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
X = list(range(1, N + 1))[::2]

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n, k = map(int, input().split())
print(['NO', 'YES'][n >= 2 * k - 1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
n,k=[int(i) for i in input().split()]


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

Submission status: Accepted

Solution code:
def inpl(): return list(map(int, input().split()))

N, K = inpl()
print(['YES', 'NO'][-(-N//2) < K])

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())
r = n // 2 + n % 2
if r < k:
  print("NO")
else:
  print("YES")

Submission status: Accepted

Solution code:
[n,k] = [int(i) for i in 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:
a,b=map(int,input().split())
print("YES" if a>=2*b-1 else "NO")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline
n,m = map(int,input().split())
n= (n+1)//2
if n>= m:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

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


if N + 1 >= K * 2 or K == 1:
    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(i) for i in input().split()]

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

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math

import array
import bisect
import collections
from collections import Counter, defaultdict
import fractions
import heapq
import re

sys.setrecursionlimit(1000000)


def array2d(dim1, dim2, init=None):
    return [[init for _ in range(dim2)] for _ in range(dim1)]

def argsort(l, reverse=False):
    return sorted(range(len(l)), key=lambda i: l[i], reverse=reverse)

def argmin(l):
    return l.index(min(l))

def YESNO(ans, yes="YES", no="NO"):
    print([no, yes][ans])

II = lambda: int(input())
MI = lambda: map(int, input().split())
MIL = lambda: list(MI())
MIS = lambda: input().split()


def main():
    N, K = MI()
    return 2 * K - 1 <= N


if __name__ == "__main__":
    YESNO(main())

Submission status: Accepted

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

for i in xrange(1, N+1, 2):
    cnt += 1

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

Submission status: Accepted

Solution code:
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())

n, k = mi()
print('YES' if k <= (n + 1) // 2 else 'NO')

Submission status: Accepted

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+1) // 2 >= k:
        return 'YES'

    return 'NO'



print(main())

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

Submission status: Runtime Error

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

if a + 1 >= b:
  print(1 + k)
  
else:
  if k < a + 1:
    print(1 + k)
  else:
    
    a1 = b #a+1回
    if (k - (a + 1)) % 2 == 0:
      a2 = ((k - (a + 1)) // 2) * (b - a)
    else:
      a2 = ((k - (a + 1) - 1) // 2) * (b - a) + 1
    print(a1 + a2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
d=[0,0,0,0]
for i in range(3):
    a,b=map(int,input().split())
    d[a-1]+=1
    d[b-1]+=1

if d[0] <= 2 and d[1] <= 2 and d[2] <= 2 and d[3] <= 2:
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

Solution code:
d=[0,0,0,0]
for i in range(3):
    a,b=map(int,input().split())
    d[a-1]+=1
    d[b-1]+=1

if d[0] <= 2 and d[1] <= 2 and d[2] <= 2 and d[3] <= 2:
    print("YES")
else:
    print("NO")
#あああああああああああああああああああああああああああああああああああああああああああああああああああああああああああああああああああああああああああああああああああああああ

Submission status: Runtime Error

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