Problem:


Score : 200 points

Problem Statement

There are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.

Takahashi says: "there are X animals in total in the garden, and they have Y legs in total." Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.

Constraints

1 \leq X \leq 100

1 \leq Y \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

X Y

Output

If there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.

Sample Input 1

3 8

Sample Output 1

Yes

The statement "there are 3 animals in total in the garden, and they have 8 legs in total" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.

Sample Input 2

2 100

Sample Output 2

No

There is no combination of numbers of cranes and turtles in which this statement is correct.

Sample Input 3

1 2

Sample Output 3

Yes

We also consider the case in which there are only cranes or only turtles.



Sample input:
3 8


Sample output:
Yes

Submission status: Runtime Error

Solution code:
    # template by 3xC and starkizard.
    # contributors: 

    #####################################################################################
    from __future__ import division, print_function 

    import sys
    import os
    from collections import Counter, deque, defaultdict
    import itertools
    import math
    import io


    """Uncomment modules according to your need"""


    # from bisect import bisect_left, bisect_right, insort
    # from heapq import heappop, heapify, heappush
    # from random import randint as rn
    # from Queue import Queue as Q
    # from copy import deepcopy
    # from decimal import *
    # import re
    # import operator

    #####################################################################################
    # this enables you to write python3 code with PyPy2 (Python 2)
    if sys.version_info[0] < 3:
        input = raw_input
        range = xrange

        filter = itertools.ifilter
        map = itertools.imap
        zip = itertools.izip

    #####################################################################################

    """value of mod"""
    MOD = 998244353
    mod = 10**9 + 7

    """Uncomment next 4 lines if doing huge recursion"""
    # import threading
    # threading.stack_size(1<<27)
    # sys.setrecursionlimit(10000

    def prepare_factorial(mod=mod):
        """ returns two lists, factorial and inverse factorial modulo argument by default 10**9 +7 """
        # Comment code out when you don't need inverse factorial or vice versa
        fact = [1]
        for i in range(1, 200005):
            fact.append((fact[-1] * i) % mod)

        ifact = [0] * 200005
        ifact[200004] = pow(fact[200004], mod - 2, mod)
        for i in range(200004, 0, -1):
            ifact[i - 1] = (i * ifact[i]) % mod

        return fact, ifact

    def modinv(n, p):
        """ returns N inverse modulo p """
        return pow(n, p - 2, p)

    def ncr(n, r,  fact, ifact):
        """ takes 4 arguments: n , r and factorial and inverse factorial lists"""
        t = (fact[n] * (ifact[r]*ifact[n-r]) % MOD)% MOD
        return t


    def get_n(Sum):    
        """this function returns the maximum n for which Summation(n) <= Sum"""
        ans = (-1 + sqrt(1 + 8*Sum))//2
        return ans

    def sieve(n):
        """ returns a list of prime numbers till n """
        if n < 2: return list()
        prime = [True for _ in range(n + 1)]
        p = 3
        while p * p <= n:
            if prime[p]:
                for i in range(p * 2, n + 1, p):
                    prime[i] = False
            p += 2
        r = [2]
        for p in range(3, n + 1, 2):
            if prime[p]:
                r.append(p)
        return r



    def divs(n, start=1):
        """ returns a list of all divisors till n """
        divisors = []
        for i in range(start, int(math.sqrt(n) + 1)):
            if n % i == 0:
                if n / i == i:
                    divisors.append(i)
                else:
                    divisors.extend([i, n // i])
        return divisors



    def divn(n, primes):
        """ returns the number of divisors, two arguments n and the sieve till n """
        divs_number = 1
        for i in primes:
            if n == 1:
                return divs_number
            t = 1
            while n % i == 0:
                t += 1
                n //= i
            divs_number *= t



    def lrfind(d, x, default=-1):
        """ Takes 2 arguments an iterable and an element. returns a tuple (firstoccurence,lastoccurence) -1 if not found """
        left = right = -1
        for i in range(len(d)):
            if d[i] == x:
                if left == -1: left = i
                right = i
        if left == -1:
            return default, default
        else:
            return left, right

    def gcd(x, y): # math.gcd is slower
        """ returns greatest common divisor of x and y """
        while y:
            x, y = y, x % y
        return x

    def check_sorted(a):
        ''' returns True/False '''
        for i in range(len(a)-1):
            if a[i]>a[i+1]:
                return False
        return True
    def ceil(n, k=1): return n // k + (n % k != 0) #returns math.ceil but protecting against floating inconsistencies
    def input(): return sys.stdin.readline().strip()
    def ii(): return int(input()) #inputs integer
    def mi(): return map(int, input().split()) # inputting space seperated variables for example x,y,z
    def li(): return list(map(int, input().split())) #inputting a space seperated list of integers
    def lw(): return input().split() #inputting a space seperated list of strings
    def lcm(a, b): return abs(a * b) // gcd(a, b) #returns LCM of two arguments
    def prr(a, sep=' ', end='\n'): print(sep.join(map(str, a)), end=end) #For printing an iterable with seperator sep as optional second argument (default : " "), ending character (default: "\n") as optional third
    def dd(): return defaultdict(int) #returns a dictionary with values defaulted to 0
    def ddl(): return defaultdict(list) #returns a dictionary with values defaulted to []
    def write(s): return sys.stdout.write(s)












    ###################################################################
    def main():
        #CODE GOES HERE:
        x,y=mi()
        if (y//2<x):
            print("No")
            return
        if (y/2==x):
            print("Yes")
            return
        
        if(y/4 >x):
            print("No")
            return

        if(y/4==x):
            print("Yes")
            return
        
        print("Yes")

            











































    """ -------- Python 2 and 3 footer by Pajenegod and c1729 ---------"""

    py2 = round(0.5)
    if py2:
        from future_builtins import ascii, filter, hex, map, oct, zip
        range = xrange

    import os, sys
    from io import IOBase, BytesIO

    BUFSIZE = 8192

    class FastIO(BytesIO):
        newlines = 0

        def __init__(self, file):
            self._file = file
            self._fd = file.fileno()
            self.writable = "x" in file.mode or "w" in file.mode
            self.write = super(FastIO, self).write if self.writable else None

        def _fill(self):
            s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
            return s

        def read(self):
            while self._fill(): pass
            return super(FastIO, self).read()

        def readline(self):
            while self.newlines == 0:
                s = self._fill();
                self.newlines = s.count(b"\n") + (not s)
            self.newlines -= 1
            return super(FastIO, self).readline()

        def flush(self):
            if self.writable:
                os.write(self._fd, self.getvalue())
                self.truncate(0), self.seek(0)


    class IOWrapper(IOBase):

        def __init__(self, file):
            self.buffer = FastIO(file)
            self.flush = self.buffer.flush
            self.writable = self.buffer.writable
            if py2:
                self.write = self.buffer.write
                self.read = self.buffer.read
                self.readline = self.buffer.readline
            else:
                self.write = lambda s: self.buffer.write(s.encode('ascii'))
                self.read = lambda: self.buffer.read().decode('ascii')
                self.readline = lambda: self.buffer.readline().decode('ascii')


    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
    input = lambda: sys.stdin.readline().rstrip('\r\n')
    # sys.stdin = open('input.txt', 'r')
    # sys.stdout = open('output.txt', 'w')

    """ main function"""

    if __name__ == '__main__':
        main()
        # threading.Thread(target=main).start()

Submission status: Runtime Error

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

if 2 * XY[0] - XY[1] / 2 == 0 and -XY[0] + XY[1] / 2 == 0:
  print('NO')

if 2 * XY[0] - XY[1] / 2 >= 0 and -XY[0] + XY[1] / 2 >= 0:
  print('YES')
else:
  print('NO')

Submission status: Runtime Error

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

for a in range(x + 1):
    if (2 * a + 4 * (x - a) == y):
        print('Yes')
        exit(1)

print('No')

Submission status: Runtime Error

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

if (y-2*x)%2==0:
  k = (y-2*x)//2
  t = x-k

if 0 <= k and 0 <= t:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
x, y = map(int,input().split())
flag=False
for i in range(x+1):
  yi=2*i+4(x-i)
  if y==yi:
    flag=True
    break
    
print("Yes") if flag else print("No")

Submission status: Runtime Error

Solution code:
a = list(input().split(" "))
animal = int(a[0])
foot = int(a[1])
 
saisyo = 2 * animal
saidai = 4 * animal
 
if (foot % 2 = 0) and (saisyo <= foot <= saidai):
	print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a = list(map(int,input().split()))
if (a[0] * 4) <= a[1]:
  if (a[0] * 2) >= a[1]:
    print("Yes")
  else:
    print("No")
else:
print("No")

Submission status: Runtime Error

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

if((2*x <= y <= 4*x) and (y%2==0)):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a = list(input().split(" "))
animal = int(a[0])
foot = int(a[1])

saisyo = 1 * animal
saidai = 2 * animal
b = foot / 2

if (foot % 2 = 0) and (saisyo <= b <= saidai):
	print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

if(2*x <= y <= 4*x and y%2==0):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
X,Y = map(int,input().split())
if Y % 2 == 0 and X * 4 >= Y and X * 2 <= Y:
    print("Yes")
else 
    print("No")

Submission status: Runtime Error

Solution code:
X,Y = map(int,input().split())
if Y % 2 == 0 and X * 4 >= Y and if X * 2 <= Y:
    print("Yes")
else 
    print("No")

Submission status: Runtime Error

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


"""
a + b = x
2a + 4b = y

a = x-b
2x- 2b + 4b = y

a = x-b
2b = y  - 2x
"""
def f(x,y):
  
	if (y - 2*x) < 0 or (y - 2*x) %2 != 0:
      return False
  	b = y - 2*x
    a = x - b
    if a < 0:
      return False
    return True
  
print 'Yes' if f(x,y) else 'No'

Submission status: Runtime Error

Solution code:
q=0
for a in range(x+1):
    s=0
    s+=a*2
    s+=(x-a)*4
    if s==y:
        q=1
        break

if q==0:
    print('No')
else:
    print('Yes')

Submission status: Runtime Error

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

def func(x,y):
    if y % 2 == 1:
        return False
    if 4*x < y:
        return False
    else:
        return True
    
if func(x,y):
    print("Yes")
else:

Submission status: Runtime Error

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

flg = true
for i in range(x):
  if 2*i + 4*(x-i) == y:
    print('Yes'):
    flg = False
      break
      
if flg:print('No')

Submission status: Runtime Error

Solution code:
X,Y=map(int,input().split())
a+b=X
if 2a+4b=Y:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
C:\Users\kouya\Anaconda3\python.exe C:/Users/kouya/pywork/atcoder/past/Contest170.py
2 100
No

Process finished with exit code 0

Submission status: Runtime Error

Solution code:
from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt
import math

import bisect
import re
import heapq


from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

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


yes = "Yes"
no = "No"


def main():
    x,y = mi()
    flag = False
    for i in range(x+1):
        if i*2+(x-i)*4 == y:
            flag = True
    if flag:
        print(yes)
    else:
        print(no)



main()


j

Submission status: Runtime Error

Solution code:
X, Y = map(int, input().split())
k = Y/2
q = y/4
if q<=X and X <= k:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import sys
X, Y = map(int, input().split())

for x in range(0, X+1):
    if 2 * x + 4 * (X-x) == Y:
        print('Yes')
        sys.exit()
print('No'

Submission status: Runtime Error

Solution code:
n,m=[int(n) for n in input().split()]
if(m>(n*4) or m<(n*2)):
  print("No")
else:
  if(m%2==0):
    print("Yes"):
  else:
    print("No")

Submission status: Runtime Error

Solution code:
x,y=map(int,input().solit())
if 2*x<=y and y%2==0 and 4*x>=y:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
import java.io.*;
import java.util.*;

public class cranes {
	static class InputReader {
		BufferedReader reader;
		StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream));
			tokenizer = null;
		}

		public String next() {
			if (tokenizer == null || !tokenizer.hasMoreTokens())
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			return tokenizer.nextToken();
		}

		public long nextLong() {
			return Long.parseLong(next());
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public void close() throws IOException {
			reader.close();
		}
	}

	public static void main(String[] args) throws IOException {
		InputReader f = new InputReader(System.in);
		PrintWriter out = new PrintWriter(System.out);
		
		int X = f.nextInt(), Y = f.nextInt();
		
		int z = Y - 2 * X;
		System.out.println((z >= 0 && (z) % 2 == 0 && z <= X) ? "YES" : "NO");
		
		f.close();
		out.close();
	}
}

Submission status: Runtime Error

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

if y % 2 == 0:
    turu = y // 2 - x
    kame = 2*x - y // 2
    if turu >= 0 and kame >= 0:
        print('Yes')
        sys.exit()
print('No')

Submission status: Runtime Error

Solution code:
x, y = map(int, input.split())
if y % 2 == 1:
  print('No')
elif x * 4 < y:
  print('No')
elif x * 2 > y:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
s=list(map(int,input().split()))
if Y-2*X>=0 and (Y-2*X)%2==0:
  a=int((Y-2*X)//2)
  if X-a>=0:
    print('Yes')
  else:
    print('No')
else:
  print('No')

Submission status: Runtime Error

Solution code:
MOD = 10**9+7

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

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

def main():
    X, Y = list(mi())
    if 4*X-Y >= 0 and (4*X-Y)%2 == 0 and a <= X:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
X, Y = map(int, input().split())
for a in range(X+1):
    b = X - a
    if 2 * a + 4 * b == Y:
        print('Yes')
        exit()
print('No')X, Y = map(int, input().split())
for a in range(X+1):
    b = X - a
    if 2 * a + 4 * b == Y:
        print('Yes')
        exit()
print('No')

Submission status: Runtime Error

Solution code:
i = input().split()
i = [int(j) for j in i]

flg = 0
for a in range(i[0]):
  if 2*a+4*b==i[1]:
    print("Yes")
    flg = 1
    
if flg==0:
  print("No")

Submission status: Runtime Error

Solution code:
import sys
readline = sys.stdin.readline

def solve():
    X, Y = map(int, readline().split())

    Y - X * 2 = a

    if a >= 0 and a % 2 == 0:
        print('Yes')
    else:
        print('No')

solve()

Submission status: Runtime Error

Solution code:
a=list(map(int,input().split()))
print(a.index(0)+1)

Submission status: Runtime Error

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

if(2*x <= y <= 4*x):
    print("Yes")
else:
    print("No")