Problem:


Score : 100 points

Problem Statement

Determine if we can choose K different integers between 1 and N (inclusive) so that no two of them differ by 1.

Constraints

1\leq N,K\leq 100

N and K are integers.

Input

Input is given from Standard Input in the following format:

N K

Output

If we can choose K integers as above, print YES; otherwise, print NO.

Sample Input 1

3 2

Sample Output 1

YES

We can choose 1 and 3.

Sample Input 2

5 5

Sample Output 2

NO

Sample Input 3

31 10

Sample Output 3

YES

Sample Input 4

10 90

Sample Output 4

NO



Sample input:
3 2


Sample output:
YES

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
for i in range(1, N + 1, 2):
    K -= 1
print("Yes" if K <= 0 else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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


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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
N,K=[int(x) for x in stdin.readline().rstrip().split()]
if N>K:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

N = N//2 + 1

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

# Calc
if n <= k:
    ans = "NO"
else:
    ans = "YES"

# Output
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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
def inpl(): return list(map(int, input().split()))

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

if N-K>0:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if n < 2 * k - 1:
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

    cnt = (N + 1) // 2

    if cnt >= 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:
#!/usr/bin/env python3
import sys
def input():
    return sys.stdin.readline()[:-1]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

    if n % 2 == 1:
        n += 1

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

#+++++

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, math, re
from functools import lru_cache
from collections import defaultdict
sys.setrecursionlimit(500000)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]


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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
'''
Created on 2020/08/20

@author: harurun
'''
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  
  N,K=map(int,pin().split())
  t=0
  if N%2==0:
    t=N//2
  else:
    t=N//2+1
  if t>=K:
    print("YES")
    return 
  print("NO")
  return 

main()

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
print("YES" if 1+(k-1)*2<=n else "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:
#「みんなのプロコン 2019」a
n,k=map(int,input().split())
i=1
cnt=0
while i<=n:
    cnt+=1
    i+=2

if cnt>=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())
kk = 0
if n%2 != 0:
    kk = (n+1)//2
else:
    kk = n//2

if k <= kk:
    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())
ans = 0
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())
ans = 0 - -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('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
N,K=map(int,input().split())
if N%2==1:
  s=N//2+1
else:
  s=N//2
if K<=s:
  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:
from math import ceil

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

Submission status: Accepted

Solution code:
import math
import sys
import collections
import bisect


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import math

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    N, K = map(int, readline().split())
    if math.ceil(N/2)>=K:
        print('YES')
    else:
        print('NO')

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

n,k = map(int,readline().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:
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())
a = [0]*n

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

Submission status: Accepted

Solution code:
def main():
    n, k = list(map(int, input().split()))
    print('YES' if k <= -(-n // 2) else 'NO')

if __name__ == '__main__':
    main()

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 n >= k * 2 - 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:
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'[2*K-1>N::2])

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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+2*(k-1) else "NO")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2, log
from itertools import accumulate, permutations, combinations, combinations_with_replacement, 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, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
from decimal import Decimal
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
from decimal import *

N, K = MAP()

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2, log
from itertools import accumulate, permutations, combinations, combinations_with_replacement, 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, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
from decimal import Decimal
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
from decimal import *

N, K = MAP()

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

Submission status: Accepted

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

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

import sys
input = sys.stdin.readline

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


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

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

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

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

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

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


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Submission status: Accepted

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

if k > frag:
    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:
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
import math
from copy import deepcopy
import queue
import numpy as np
# sympy as syp(素因数分解とか)
Mod = 1000000007
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[y] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)

def main():  #startline-------------------------------------------
    n, k = map(int, input().split())
    print("YES" if n >= 2*k-1 else "NO")
if __name__ == "__main__":
    main() #endline===============================================