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:
# coding: utf-8
n, k = map(int, input().rstrip().split())

tmp = n%2
if tmp == 0:
    ok = int(n/2)
else:
    ok = int(n/2) + 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m = list(map(int,input().split()))
if m*2-1 <= n:
  print("YES")
else:
  print("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 % 2 == 0:
        # 割り切れる
        return K <= N/2
    else:
        return K <= N//2 +1



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

Submission status: Accepted

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

P = (N+1)//2

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K =[int(i)for i in 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())
if N >= K * 2 - 1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

if n < k:
    print('NO')
else:
    g = n // 2
    kk = n - g

    if k <= g or k <= kk:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

Solution code:
N,K = map(int,input().split())
kisuu = 0
seisuu = 0
for i in range(1,N+1):
    if i%2==0:
        seisuu+=1
    else:
        kisuu+=1
if kisuu>=K or seisuu>=K:
    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:
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())

#%%

def main():
    if n % 2 == 0:
        if n//2 >= k:
            return "YES"
    else:
        if n//2 + 1 >= k:
            return "YES"

    return "NO"

print(main())

Submission status: Accepted

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

nums = [i for i in range(1, N+1, 2)]

if len(nums) >= 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=[int(i) for i in input().split()]
cul=(n+1)//2
if k<=cul:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

temp = (n/2) + (n%2)

if k <= temp:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

    nums = [2*i+1 for i in range(K)]
    if nums[-1] <= N:
        return "YES"
    else:
        return "NO"


def main():
    ans = solve()
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
avail= int(A/2) if int(A/2)==(A/2) else int(A/2)+1
print('YES' if B<=avail else 'NO')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
d=0
if(n%2==0):
  d=n//2
else:
  d=n//2+1

if(k<=d):
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
S = list(map(int,input().split()))
N = S[0]
K = S[1]
if N % 2 == 1:
    number = N //2 + 1
else:
    number = N //2
if number < K:
    print('NO')
else:
    print('YES')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
p = input().split()
n = int(p[0])
k = int(p[1])
if n % 2 == 1:
    if k <= n//2+1:
        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 (2*K) - 1 <= N:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math

lines = sys.stdin.readlines()
N, K = map(int, lines[0].split())


print('YES' if math.ceil(N/2) >= K else 'NO')

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:
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 = [int(i) for i in input().split()]

# n以下の奇数の数をカウント
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:
A,B=input().split()
A=int(A)
B=int(B)
if 2*B-1<=A:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

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

print(re)

Submission status: Accepted

Solution code:
import math 
IN=lambda:list(map(int,input().split()))
a,b=IN()
if math.ceil(a/2)>=b:
  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:
# https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde	s=input()	s='abcde'
# abcde	s=list(input())	s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ)	a=int(input())	a=5
# 1 2	| x,y = map(int,input().split())|	x=1,y=2
# 1 2 3 4 5 ... n 　	li = input().split()	li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n 　	li = list(map(int,input().split()))	li=[1,2,3,4,5,...,n]
# FFFTFTTFF 　	li = input().split('T')	li=['FFF', 'F', '', 'FF']

# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]

import collections
import math
def inpl(): return list(map(int, input().split()))

#### START
# a_1, b_1 = map(int,input().split())

# if N-K>0:
#   print("YES")
# else:
#   print("NO")
N, K = map(int,input().split())

ans = math.ceil(N/2)
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('NO')
else:
    print('YES')

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==0:
    if k>n/2:
        print('NO')
    else:
        print('YES')
else:
    if k>(n/2+0.5):
        print('NO')
    else:
        print('YES')

Submission status: Accepted

Solution code:
def func():
    pass


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

import math

s = input().split()
N = int(s[0])
K = int(s[1])

print('YES' if K <= math.ceil(N / 2.0) else 'NO')

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**8) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

n,k = li()
if n%2:
    mx = n//2 + 1
else:
    mx = n//2
    
print('YES') if k <= mx else print('NO')

Submission status: Accepted

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

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

print(solve())

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
# author: ismdeep
# dateime: 2019-02-09 20:04:13
# filename: a.py.py
# blog: https://ismdeep.com
s = input()
n = int(s.split()[0])
k = int(s.split()[1])
if 2 * k - 1 <= n:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Feb  9 16:00:52 2019

@author: Yamazaki Kenichi
"""

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a=[]#入力画面の二文字を別々の文字に格納
a=input().split(" ")
N=int(a[0])
K=int(a[1])
x=2*K-1
if N>=x :
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

def solve():
    N, K = map(int, input().split())
    if 2*K-1 <= N:
        res = 'YES'
    else:
        res = 'NO'
    return str(res)
if __name__ == '__main__':
    print(solve())

Submission status: Accepted

Solution code:

import math
n,k = map(int,input().split())
print(["NO","YES"][int(math.ceil(n/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//2+1)>=k:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if __name__=="__main__":
    solve()

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
# import bisect
# import math
# import numpy as np


"""Template"""


class IP:
    """
    入力を取得するクラス
    """
    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def HF(self, p):
        """
        Half enumeration
        半分全列挙です
        pの要素の和の組み合わせを作ります。
        ソート、重複削除行います
        :param p: list : 元となるリスト
        :return: list : 組み合わせられた和のリスト
        """
        return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))

    def Bfs2(self, a):
        """
        bit_full_search2
        bit全探索の改良版
        全探索させたら2進数のリストと10進数のリストを返す
        :return: list２つ : １個目 2進数(16桁)  2個目 10進数
        """
        # 参考
        # https://blog.rossywhite.com/2018/08/06/bit-search/
        # https://atcoder.jp/contests/abc105/submissions/4088632
        value = []
        for i in range(1 << len(a)):
            output = []

            for j in range(len(a)):
                if self.bit_o(i, j):
                    """右からj+1番目のiが1かどうか判定"""
                    # output.append(a[j])
                    output.append(a[j])
            value.append([format(i, 'b').zfill(16), sum(output)])

        value.sort(key=lambda x: x[1])
        bin = [value[k][0] for k in range(len(value))]
        val = [value[k][1] for k in range(len(value))]
        return bin, val

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def bit_n(self, a, b):
        """
        bit探索で使います。0以上のときにTrue出します
        自然数だからn
        :param a: int
        :param b: int
        :return: bool
        """
        return bool((a >> b & 1) > 0)

    def bit_o(self, a, b):
        """
        bit探索で使います。1のときにTrue出すよ
        oneで1
        :param a: int
        :param b: int
        :return: bool
        """
        return bool(((a >> b) & 1) == 1)

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x//y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)


"""ここからメインコード"""


def main():
    # 1文字に省略
    r, e = range, enumerate
    ip = IP()
    id = Idea()

    """この下から書いてね"""
    n, k = ip.IL()
    a = k * 2
    if a - 2 < n:
        print("YES")
    else:
        print("NO")


main()

Submission status: Accepted

Solution code:
import math
NK = [int(x) for x in input().split()]
if math.ceil(NK[0]/2) >= NK[1]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

if N%2 == 0 and K <= N/2:
	print("YES")
	exit()
elif N%2 == 1 and K <= N/2+1:
	print("YES")
	exit()
else:
	print("NO")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Feb  9 21:02:07 2019

@author: doppe
"""

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:
n,k=map(int,input().split())
print(["NO","YES"][2*k-1 <= n])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys

def main():
  input = sys.stdin.readline
  N, K = map(int, input().split())
  m = N // 2 + N % 2
  if K <= m:
    print('YES')
  else:
    print('NO')


if __name__ == '__main__':
  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:
import math
n,k = map(int,input().split())
z = (math.ceil(n/2))

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

Submission status: Accepted

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

print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    N, K = [int(a) for a in 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())
s=0
if n%2!=0:
    s=n//2+1
else:
    s=n/2
print("YES"if s>=k else"NO")

Submission status: Accepted

Solution code:
# 100 points
import math

# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
n, k = map(int, input().split())

if math.ceil(n/2.0) >= k:
    # 出力
    print('YES')
else:
    # 出力
    print('NO')

Submission status: Accepted

Solution code:
import numpy as np
import sys
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)+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:
import math

N, K = [int(x) for x in input().split()]
# A = [int(x) for x in input().split()]


s = 0
for i in range(1, N + 1, 2):
    s += 1
    # print(i)

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

Submission status: Accepted

Solution code:
# coding: utf-8
n, k = map(int, input().split())
print("YES" if k <= (n >> 1) + (n & 1) else "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 = list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
# -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
N, K = inpl()
x = -(-N//2)
if x >= 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 1 + 2*(K-1) > N:
    print("NO")
else:
    print("YES")

Submission status: Accepted

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

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor

import heapq
import itertools
import operator


def get_int():
    return int(input())


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


def get_int_list():
    return [int(i) for i in input().split()]


def get_char_list():
    return list(input().strip())


def main():
    n, k = get_int_list()
    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 int(N/2.0+0.5) >= K:
	print('YES')
else:
	print('NO')

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

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

Submission status: Accepted

Solution code:
import math
import sys
from operator import itemgetter

# N, K = map(int, input().split())
# h = list(map(int, input().split()))
# S = [input() for _ in range(H)]
# X = [[0 for j in range(100)] for i in range(200)]

# if __name__ == '__main__':


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