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

if x >= y*2-1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

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


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


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

if __name__ == '__main__':
    main()

Submission status: 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())
import math
print('YES' if math.ceil(n/2) >= k else 'NO')

Submission status: Accepted

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

Submission status: Accepted

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

    
resolve()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


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

    res = [i for i in range(1, n + 1, 2)]
    print("YES" if len(res) >= k else "NO")


if __name__ == '__main__':
    resolve()

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

Submission status: Accepted

Solution code:
from sys import stdin
N, K = [int(_) for _ in stdin.readline().rstrip().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 -(-n // 2) >= k else "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>=K*2-1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
from sys import stdin
import math
import re
import queue

input = stdin.readline

MOD = 1000000007
INF = 122337203685477580

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

    
if __name__ == '__main__':
    solve()

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<0:
  print('NO')
else:
  print('YES' if N>=2*K-1 else '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 sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

n, k = map(int, input().split())
if n%2==1:
    if (n-1)//2 >= k-1: print('YES')
    else: print('NO')
else:
    if n//2 >= 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:
import sys
import math
import bisect

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n,k=map(int, input().split())
    num=-(-n // 2)
    if num<k:
        print('NO')
    else:
        print('YES')
resolve()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    
    N,K=map(int,input().split())
    print('YES' if -(-N//2)>=K else 'NO')
    
resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
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())
print("YES" if n >= k+k-1 else "NO")

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

n, k = map(int, read().split())
if (n + 1) // 2 >= 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:
number_list = [int(i) for i in input().split()]

if number_list[0] % 2 == 0:#偶数のとき
  if number_list[0] >= number_list[1]*2:
    print('YES')
  else:
    print('NO')
else:
  if number_list[0] + 1 >= number_list[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:
import sys
input = sys.stdin.readline

# A - Anti-Adjacency
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:
import math

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

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

Submission status: Accepted

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

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# 1
# https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_a
N,K=map(int,input().split())
print('YES' if N-K-(K-1)>=0 else 'NO')

Submission status: Accepted

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

Submission status: Accepted

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

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

if K > 0:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    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,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if b+b-1 <= a:
  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:
# みんなのプロコン 2019: A – Anti-Adjacency
n, k = map(int, input().split())
print('YES' if n >= k * 2 - 1 else 'NO')

Submission status: Accepted

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

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
import re
import math
import itertools
from copy import deepcopy
import fractions
import random
from heapq import heappop,heappush
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
readline=sys.stdin.readline
sys.setrecursionlimit(2000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def is_power(a,b):#aはbの累乗数か
    now=b
    while now<a:
        now*=b
    if now==a:return True
    else:return False
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def fac_list(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(a,b,c):
    if a:return b
    else:return  c
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n,type_="dict"):
    b = 2
    list_ = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            list_.append(b)
        b+=1
    if n > 1:list_.append(n)
    if type_=="dict":
        dic={}
        for a in list_:
            if a in dic:
                dic[a]+=1
            else:
                dic[a]=1
        return dic
    elif type_=="list":
        return list_
    else:
        return None
############################################
N,K=map(int,input().split())
YN((N+1)//2>=K)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, K = MAP()

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

Submission status: Accepted

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

ans = 0

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

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

print("NO")

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]

n, k = MAP()
if (n + 1) // 2 >= 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())
x = [i for i in range(n+2) if i % 2 == 1]
for i in range(len(x)):
    if x[i] >=100:
        x.pop(i)

if int(len(x)) >= k:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

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:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

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

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    
    if a[0] % 2 ==1:
        a[0] +=1


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

Submission status: Accepted

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

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

Submission status: Accepted

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

n,k =iim()
if n%2 == 0:
    if k <= n//2:
        print('YES')
    else:
        print('NO')
elif k <= (n-1)//2+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=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 // 2) >= k):
    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,k=map(int,input().split())
print("YES" if n//2+n%2>=k else "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
n,k = map(int,input().split())
if math.ceil(n/2) >= k:
    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:
import math
N, K = map(int, input().split())
tmp = math.ceil(N / 2)
if tmp >= K:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
N,K = [int(i) for i in input().split()]
if N % 2 == 0:
    if (N//2) >= K:
        print('YES')
        exit()
    else:
        print("NO")
        exit()
else:
    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 + 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:
import math
N,K = map(int,input().split())

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

Submission status: Accepted

Solution code:
def main():
    N, K = (int(i) for i 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())
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:
n, k = map(int, input().split())
c = 0

for i in range(1,n + 1):
	if i % 2 != 0:
		c += 1

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


if __name__ == '__main__':
    main()

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

q, r = divmod(n, 2)
if k <= q + r:
    ans = "YES"
else:
    ans = "NO"

print(ans)

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

Submission status: Accepted

Solution code:
def main():
    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, input().split())
odd = (n + 1) // 2
print('YES' if odd >= 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 (K*2)-1<=N:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

n, k = [int(x) for x in input().split()]
print("YES" if n >= k * 2 - 1 else "NO")

Submission status: Accepted

Solution code:
import sys
# import math
# import decimal
# import queue
# import bisect
# import heapq
import time
# import itertools

mod = int(1e9+7)
INF = 1<<29

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
''' Hey stalker :) '''
INF = 10**10
def main():
    print = out.append
    ''' Cook your dish here! '''
    n, k = get_list()
    print("YES") if k<=(n+1)//2 else print("NO")

''' Pythonista fLite 1.1 '''
import sys
from collections import defaultdict, Counter
from bisect import bisect_left, bisect_right
#from functools import reduce
import math
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
out = []
get_int = lambda: int(input())
get_list = lambda: list(map(int, input().split()))
main()
#[main() for _ in range(int(input()))]
print(*out, sep='\n')

Submission status: Accepted

Solution code:
"""
NTC here
"""
import sys
inp= sys.stdin.readline
input = lambda : inp().strip()
flush= sys.stdout.flush
# import threading
# setrecursionlimit(10**6)
# threading.stack_size(2**26)

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

# range = xrange
# input = raw_input

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





        
main()
#threading.Thread(target=main).start()

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

Submission status: Accepted

Solution code:
def examA():
    N, K = LI()
    if (N+1)//2>=K:
        print("YES")
    else:
        print("NO")
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LFI(): return list(map(float,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examA()

"""

"""

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin
n,k = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Accepted

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

if k <= cnt:
  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:
def main():
    N,K = map(int,input().split())
    if N%2==0:
        pass
    else:
        N += 1
    
    if K<=N//2:
        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:
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 (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 + 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:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
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())

s = -(-n//2)

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

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
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('NO' if n<2*k-1 else '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("YNEOS"[k>-~n//2::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2019/11/26

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

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n, k = list(map(int, readline().split()))
    n += 1 if n % 2 != 0 else 0
    print("YES" if n // 2 >= k else "NO")


if __name__ == '__main__':
    solve()

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

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