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 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random

import os
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    N,K = inputMap()
    
    ans = 0
    for i in range(1, N+1):
        if i % 2 == 1:
            ans += 1
            if ans >= K:
                print("YES")
                sys.exit()
                
    print("NO")
    
    
if __name__ == "__main__":
	main()

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())
print(("NO","YES")[(n+1)//2>=k])

Submission status: Accepted

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

if n%2 == 0:
    cnt = n//2
else:
    cnt = n//2 + 1
    
if cnt >= 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:
# みんなのプロコン 2019: A – Anti-Adjacency
n, k = [int(s) for s in input().split()]
print('YES' if k * 2 - 1 <= n 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 = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x = [i for i in range(1, n+1)][::2]

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    n, k = list(map(int, input().rstrip('\n').split()))
    print("YES" if (n + 2 - 1) // 2 >= k else "NO")


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = tuple(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:
#!/usr/bin/env python3
import sys

YES = "YES"  # type: str
NO = "NO"  # type: str


def solve(N: int, K: int):
    from math import ceil
    if(ceil(N/2) >= K):
        print(YES)
    else:
        print(NO)
    return


# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    solve(N, K)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

N+=N%2
N//=2

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

Submission status: Accepted

Solution code:
import math


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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():

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


if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    n, k = list(map(int, input().rstrip('\n').split()))
    c = (n + 1) // 2
    print("YES" if c >= k else "NO")


if __name__ == '__main__':
    slove()

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());print("YNEOS"[-~n//2<k::2])

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

# print(N)
# print(K)

# print(N // K)
# print(N % K)

# print((N // K) + (N % K) >= K)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
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+0.5>=k else 'NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(n, k):
    return "YES" if (2*k-1 <= n) else "NO"

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10000000)
def input():
    return sys.stdin.readline()[:-1]
from bisect import *
from collections import *
from heapq import *
from math import *
from fractions import Fraction

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

Submission status: Accepted

Solution code:
def main(N, K):
    if K * 2 - 1 <= N:
        return 'YES'
    else:
        return 'NO'


if __name__ == '__main__':
    N, K = map(int, input().split(' '))
    print(main(N, K))

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())
if N>=2*K-1:
  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:
N, K = [int(_) for _ in input().split()]

if K <= (N+1) // 2:
    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())
temp = -1
if N % 2 != 0:
  temp = (N+1)//2
else:
  temp = N // 2
if K > temp:
  print('NO')
else:
  print('YES')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# yahoo-procon2019-qualA - Anti-Adjacency
def main():
    n, k = list(map(int, input().rstrip().split()))
    print("YES" if (n + 1) // 2 >= k else "NO")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:

def main():
    a, b = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

print(["YES", "NO"][not(K <= ((N + 1) // 2))])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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())
print('YES' if (N+1) // K >= 2 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 = map(int, input().split())

for i in range(1, N+1):
    if i%2 != 0:
        K -= 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")

N, K = list(map(int, sys.stdin.readline().split()))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
pos = -(-n//2)
if pos >= k :
    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("YES" if (N-1)//2>=K-1 else "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:
print("YNEOS"[eval(input().replace(" ","<")+"*2-1")::2])

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

Submission status: Accepted

Solution code:
###template###
import sys
input = sys.stdin.readline
def mi(): return map(int, input().split())
###template###

N, K = mi()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

"""
import sys


def solve(N, K):
    if (N+1) //2 >= K:
        return 'YES'
    return 'NO'


def main(args):
    N, K = map(int, input().split())
    ans = solve(N, K)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

Solution code:
print("YNEOS"[eval(input().replace(" ","+1<2*"))::2])

Submission status: Accepted

Solution code:
print("YNEOS"[eval(input().replace(" ","<-1+2*"))::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
ans = "YNEOS"
print(ans[(N+1)//2 < K::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__=="__main__":
    n, k = input().split(' ')
    n = int(n)
    k = int(k)
    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:
n, k = map(int, input().split())

w_n = 0
if n % 2 == 0:
    w_n = n
else:
    w_n = n + 1

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

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

YES = "YES"  # type: str
NO = "NO"  # type: str

def solve(N: int, K: int):
    if N >= 2 * (K - 1) + 1:
        ret = YES
    else:
        ret = NO
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    solve(N, K)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,math
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float('inf')
MOD = 10**9+7
dy = [0,1,0,-1]
dx = [1,0,-1,0]
ddy = [0,1,1,1,0,-1,-1,-1]
ddx = [1,1,0,-1,-1,-1,0,1]

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

Submission status: Accepted

Solution code:
import sys
#input=sys.stdin.read
d=list(map(int, input().split()))
c=(d[0]+1)//2
if d[1] > c: print("NO")
else: print("YES")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N,K=MAP()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
if n>=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 = (int(i) for i in input().split())

if k <= (n+1)//2:
    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:
#!/usr/bin/env python3

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if (a+1)>=b*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:
N, K = [ int(x) for x in input().split() ]

ans = 2 * K - 1 <= N

print("YES" if ans 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 = input().split()
n = int(n)
k = int(k)
if k * 2 - 1 <= n:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
n,k = input().split()
n = int(n)
k = int(k)
for l in range(k):
  l = 2*l +1
  c = l
if c <= n:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

tmp = 0
for i in range(1, N + 1):
    if i%2 == 1:
        tmp += 1
        
if tmp >= K:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = 'YES'

if K > temp:
    ans = 'NO'
    
print(ans)

Submission status: Accepted

Solution code:
import sys


line = sys.stdin.readline()
N, K = line.split(" ")
N = int(N)
K = int(K)
if N%2 == 0:
	if K <= (N/2):
		print("YES")
	else:
		print("NO")	
else:
	if K <= (N/2 + 1):
		print("YES")
	else:
		print("NO")

Submission status: Accepted

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

if N % 2 == 1:
  if len([i for i in range(N+1) if i % 2 == 1]) >= K:
    print("YES")
  else:
    print("NO")
else:
  if len([i for i in range(N) if i % 2 == 1]) >= K:
    print("YES")
  else:
    print("NO")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math


def solution(N, K):
    if (math.floor((N + 1) / 2) >= K):
        return "YES"
    else:
        return "NO"


n, k = [int(s) for s in input().split(' ')]
print(solution(n, k))

Submission status: Accepted

Solution code:

import math

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import array
import bisect
import collections
import fractions
import heapq
import itertools
import math
import re
import string
 
class joshu:
 
  # stdio
  @staticmethod
  def getInt():
    return int(raw_input().strip())
  @staticmethod
  def getInts():
    return [int(i) for i in raw_input().strip().split()]
  @staticmethod
  def getFloat():
    return float(raw_input().strip())
  @staticmethod
  def getFloats():
    return [float(i) for i in raw_input().strip().split()]
  @staticmethod
  def getStr():
    return str(raw_input().strip())
  @staticmethod
  def getStrs():
    return [str(i) for i in raw_input().strip().split()]
 
def main():
  n, k = joshu.getInts()
  if (n + 1) / 2 >= k:
    print('YES')
  else:
    print('NO')
  pass
 
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import array
import bisect
import collections
import fractions
import heapq
import itertools
import math
import re
import string

class joshu:

  # stdio
  @staticmethod
  def getInt():
    return int(raw_input().strip())
  @staticmethod
  def getInts():
    return [int(i) for i in raw_input().strip().split()]
  @staticmethod
  def getFloat():
    return float(raw_input().strip())
  @staticmethod
  def getFloats():
    return [float(i) for i in raw_input().strip().split()]
  @staticmethod
  def getStr():
    return str(raw_input().strip())
  @staticmethod
  def getStrs():
    return [str(i) for i in raw_input().strip().split()]

def main():
  n, k = joshu.getInts()
  if (n + 1) / 2 >= k:
    print('YES')
  else:
    print('NO')

if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

result = 'YES' if N>=1+(K-1)*2 else 'NO'

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

r = int(N / 2 + 0.5)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
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())
if (n+1)//2 >= k:
    print('YES')

else:
    print('NO')