Problem:


Score : 100 points

Problem Statement

Takahashi, who is A years old, is riding a Ferris wheel.

It costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)

Find the cost of the Ferris wheel for Takahashi.

Constraints

0 ≤ A ≤ 100

2 ≤ B ≤ 1000

B is an even number.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the cost of the Ferris wheel for Takahashi.

Sample Input 1

30 100

Sample Output 1

100

Takahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.

Sample Input 2

12 100

Sample Output 2

50

Takahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.

Sample Input 3

0 100

Sample Output 3

0

Takahashi is 0 years old, and he can ride the Ferris wheel for free.



Sample input:
30 100


Sample output:
100

Submission status: Accepted

Solution code:
from __future__ import division, print_function
import os,sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip
else:
    _str = str
    str = lambda x=b"": x if type(x) is bytes else _str(x).encode()



# ///==========Libraries, Constants and Functions=============///

inf = float("inf")
mod = 10**9+7

#from collections import deque, Counter, OrderedDict,defaultdict
#from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace
#from math import ceil,floor,log,sqrt,factorial,pow,pi
#from bisect import bisect_left,bisect_right
#from decimal import *,threading

def dmain():
    sys.setrecursionlimit(100000000)
    threading.stack_size(40960000)
    thread = threading.Thread(target=main)
    thread.start()
    

abc='abcdefghijklmnopqrstuvwxyz'
abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod,MOD=1000000007,998244353
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]
def getKey(item): return item[0] 
def sort2(l):return sorted(l, key=getKey)
def d2(n,m,num):return [[num for x in range(m)] for y in range(n)]
def isPowerOfTwo (x): return (x and (not(x & (x - 1))) )
def decimalToBinary(n): return bin(n).replace("0b","")
def ntl(n):return [int(i) for i in str(n)]

def gcd(x, y):
    while y:
        x, y = y, x % y
    return x


def factorial_p(n, p):
    ans = 1
    if n <= p // 2:
        for i in range(1, n + 1):
            ans = (ans * i) % p
    else:
        for i in range(1, p - n):
            ans = (ans * i) % p
        ans = pow(ans, p - 2, p)
        if n % 2 == 0:
            ans = p - ans
    return ans

def nCr_p(n, r, p):
    ans = 1
    while (n != 0) or (r != 0):
        a, b = n % p, r % p
        if a < b:
            return 0
        ans = (ans * factorial_p(a, p) * pow(factorial_p(b, p), p - 2, p) * pow(factorial_p(a - b, p), p - 2, p)) % p
        n //= p
        r //= p
    return ans

def prime_sieve(n):
    """returns a sieve of primes >= 5 and < n"""
    flag = n % 6 == 2
    sieve = bytearray((n // 3 + flag >> 3) + 1)
    for i in range(1, int(n**0.5) // 3 + 1):
        if not (sieve[i >> 3] >> (i & 7)) & 1:
            k = (3 * i + 1) | 1
            for j in range(k * k // 3, n // 3 + flag, 2 * k):
                sieve[j >> 3] |= 1 << (j & 7)
            for j in range(k * (k - 2 * (i & 1) + 4) // 3, n // 3 + flag, 2 * k):
                sieve[j >> 3] |= 1 << (j & 7)
    return sieve

def prime_list(n):                            #<----- You have to call me if you wanna get list of primes upto range n
    """returns a list of primes <= n"""
    res = []
    if n > 1:
        res.append(2)
    if n > 2:
        res.append(3)
    if n > 4:
        sieve = prime_sieve(n + 1)
        res.extend(3 * i + 1 | 1 for i in range(1, (n + 1) // 3 + (n % 6 == 1)) if not (sieve[i >> 3] >> (i & 7)) & 1)
    return res

def is_prime(n):
    """returns True if n is prime else False"""
    if n < 5 or n & 1 == 0 or n % 3 == 0:
        return 2 <= n <= 3
    s = ((n - 1) & (1 - n)).bit_length() - 1
    d = n >> s
    for a in [2, 325, 9375, 28178, 450775, 9780504, 1795265022]:
        p = pow(a, d, n)
        if p == 1 or p == n - 1 or a % n == 0:
            continue
        for _ in range(s):
            p = (p * p) % n
            if p == n - 1:
                break
        else:
            return False
    return True


def all_factors(n):
    """returns a sorted list of all distinct factors of n"""
    small, large = [],[]
    for i in range(1, int(n**0.5) + 1, 2 if n & 1 else 1):
        if not n % i:
            small.append(i)
            large.append(n//i)
    large.reverse()
    small.extend(large)
    return small

def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()

#======================================================================================================

def main():
	age,B=get_ints()
	if age>=13:
		print(B)
	elif 6<=age<=12:
		print(B//2)
	else:
		print(0)
		
# region fastio===================================================================================================================

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        if self.buffer.tell():
            return self.buffer.read()
        return os.read(self._fd, os.fstat(self._fd).st_size)

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

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


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", b" "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", b"\n"))
    if kwargs.pop("flush", False):
        file.flush()


sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
input = lambda: sys.stdin.readline().rstrip(b"\r\n")

# endregion=========================================================================================================

# ///===========MAIN=============///

if __name__ == "__main__":
    main()
    #dmain()

Submission status: Accepted

Solution code:
a,b=(int(i) for i in input().split())

if a>12:
  print(b)
elif 6<=a<=12:
  print(b//2)
else:
  print(0)

Submission status: Accepted

Solution code:
a,b = [int(x) for x in input().split(" ")]

if a <= 5:
    print("0")
elif a <=12:
    print(int(b/2))
else:
    print(int(b))

Submission status: Accepted

Solution code:
a, b = [int(i) for i in input().split()]
if a >= 13:
  print(b)
elif a >= 6:
  print(b//2)
else:
  print(0)

Submission status: Accepted

Solution code:
A,B=map(int, input().split())

if A<=5:
    ans=0
elif A>=13:
    ans=B
else:
    ans=B/2
print(int(ans))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
from collections.abc import Iterable
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
    from math import gcd
except Exception:
    from fractions import gcd


def solve(A: int, B: int):
    if 13 <= A:
        return B
    elif 6 <= A:
        return B // 2
    return 0


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    result = solve(A, B)
    if isinstance(result, Iterable) and not isinstance(result, str):
        result = '\n'.join([str(v) for v in result])
    print(result)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

A, B = map(int, input().split())

if 13 <= A:
    print(B)
elif 6 <= A:
    print(B//2)
else:
    print(0)

Submission status: Accepted

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

s = list(map(int,input().split()))
A=s[0]
B=s[1]

if A > 12:
    print(B)
elif 5 < A <= 12:
    print(int(B/2))
elif A <= 5:
    print(0)

Submission status: Accepted

Solution code:
money = input().split()
money_one = int(money[0])
money_two = int(money[1])

if money_one <= 5:
    print("0")
elif money_one >= 13:
    print(money_two)
else:
    print(round(money_two/2))

Submission status: Accepted

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

if a <= 5:
    print(0)
elif a >= 13:
    print(b)
else:
    print(int(b/2))

Submission status: Accepted

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

if 6 <= a <= 12:
    b //= 2
elif a < 6:
    b = 0
    
print(b)

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
if A >= 13:
    print(B)
elif A >= 6 and A <= 12:
    print(B//2)
else:
    print(0)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
if A >= 13:
  print(B)
elif A < 6:
  print(0)
else:
  print(B//2)

Submission status: Accepted

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


def solve(A: int, B: int):
    if A >= 13:
        print(B)
    elif A <= 5:
        print(0)
    else:
        print(B//2)
    return


# Generated by 1.1.4 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()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def solve():

  a,b = (int(i) for i in input().split())
  if a <= 5:
    ans = 0
  elif 6<= a and a <= 12:
    ans = b//2
  else:
    ans = b
  print(ans)
solve()

Submission status: Accepted

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

res = b
if a <= 5:
    res = 0
elif 6 <= a <= 12:
    res = res // 2

print(res)

Submission status: Accepted

Solution code:
A, B  = list(map(int, input().split()))

cost = 0
if A >= 13:
    cost = B
elif 6 <= A and A <= 12:
    cost = B // 2
else:
    cost = 0
print(cost)

Submission status: Accepted

Solution code:
[A, B] = [int(i) for i in input().split()]

ans = 0

if A > 12:
    ans = B
elif A > 5:
    ans = int(B/2)

print(ans)

Submission status: Accepted

Solution code:
def main():
    A, B = [int(ele) for ele in input().split()]
    ans = -1
    if 13 <= A:
        ans = B
    elif 6 <= A <= 12:
        ans = int(B/2)
    else:
        ans = 0

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
inpl = lambda: list(map(int,input().split()))
A, B = inpl()
if A >= 13:
    print(B)
elif A <= 5:
    print(0)
else:
    print(B//2)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a >= 13:
    print(b)
elif 12 >= a >= 6:
    print(int(b/2))
else:
    print(0)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

ans = 0
if A >= 13:
    ans = B
elif 6 <= A <= 12:
    ans = B/2
elif A <= 5:
    ans = 0
print(int(ans))

Submission status: Accepted

Solution code:
c = input().split()
a = c[0]
b = c[1]


def main():
    if int(a) > 12:
        return int(b)
    elif int(a) > 5 and int(a) < 13:
        return int(int(b)/2)
    else:
        return 0
                

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

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc127/tasks/abc127_a

AB = [int(i) for i in input().split()]

if AB[0] >= 6 and AB[0] <= 12:
    print(int(AB[1] / 2))
elif AB[0] <= 5:
    print(0)
else:
    print(AB[1])

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A >= 13:
    print(B)
elif A>= 6 and A<=12:
    print(B//2)
else:
    print(0)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a >= 13:
    print(b)
if a >= 6 and a <= 12:
    print(int(b / 2))
if a <= 5:
    print(0)

Submission status: Accepted

Solution code:
A,B = (int(i) for i in input().split())
if A >= 13:
    print(B)
elif 6 <= A <= 12:
    print(B//2)
else:
    print("0")

Submission status: Accepted

Solution code:
A, B = input().split(" ")
A, B = int(A), int(B)

if A >= 13:
    print(B)
elif A <= 12 and A >= 6:
    print(B//2)
else:
    print(0)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if(5>=a):
  print(0)
elif(a>=13):
  print(b)
else:
  print(int(b/2))

Submission status: Accepted

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

if (a < 6):
    print(0)
elif (6 <= a and a <= 12):
    print(b // 2)
else:
    print(b)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
cost = B
if 5 < A < 13:
  cost //= 2
elif A < 6:
  cost = 0
print(cost)

Submission status: Accepted

Solution code:
a, b = [int(item) for item in input().split()]

if a >= 13:
    print(b)
elif 6 <= a <= 12:
    print(b // 2)
else:
    print(0)

Submission status: Accepted

Solution code:
def main():
    A, B = map(int, input().split())
    if A >= 13:
        print(B)
    elif 6 <= A <= 12:
        print(B // 2)
    else:
        print(0)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b = [int(i) for i in input().split(" ")]
if 13 <= a:
    print(b)
elif 6 <= a and a <= 12:
    print(b // 2)
else:
    print(0)

Submission status: Accepted

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

if a>=13:
    print(b)
elif a>=6 and a<=12:
    print(int(b/2))
elif a<=5:
    print(0)

Submission status: Accepted

Solution code:
A, B = map(int,input().split())

if A >= 13:
	print(str(B))
if A >= 6 and A <= 12:
	print(str(int(B / 2)))
if A <= 5:
	print(0)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a>=13:
    print(b)
elif 6<=a<=12:
    print(b//2)
else:
    print(0)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a > 12:
    print(b)
elif a > 5 and a < 13:
    print(b//2)
else:
    print(0)

Submission status: Accepted

Solution code:
A,B=map(int, raw_input().split())

if 13<=A:
	print B
elif 6<=A<=12:
	print B/2
elif A<=5:
	print 0

Submission status: Accepted

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

from collections import deque
import itertools as ite
import sys
import math

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

A, B = map(int, raw_input().split())

if A >= 13:
    print B
elif 6 <= A <= 12:
    print B / 2
else:
    print 0

Submission status: Accepted

Solution code:
A,B = map(int, input().split())

if A <= 5:
    print(0)
elif A >= 6 and A <= 12:
    print(B//2)
else:
    print(B)

Submission status: Accepted

Solution code:
A, B = list(map(int, input().split()))

if A >= 13:
  print(B)
elif 13>A>=6:
  print(B//2)
else:
  print(0)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A < 6:
    print(0)
elif A  < 13:
    print(B//2)
else:
    print(B)

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
if A > 12:
    print(B)
elif 6 <= A and A <= 12:
    print(int(B/2))
else:
    print(0)

Submission status: Accepted

Solution code:
A,B = map(int, input().split())
if(A<=5):
    print("0")
elif(A<=12):
    print(int(B/2))
else:
    print(B)

Submission status: Accepted

Solution code:
# coding: utf-8

A, B = map(int, input().split())

if A >= 13:
    print(B)
elif 6 <= A <= 12:
    print(B // 2)
else:
    print(0)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())

answer = B
if 6 <= A <= 12:
  answer = B//2
elif A <= 5:
  answer = 0
  
print(answer)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if 13<=a: print(b)
elif a<=5: print(0)
else: print(b//2)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print(B if A >= 13 else B // 2 if 6 <= A <= 12 else 0)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if(6<=a<=12):
    b//=2
elif(a<6):
    b=0
print(b)

Submission status: Accepted

Solution code:
li = input().split()
a = int(li[0])
b = int(li[1])
if a > 12:
    print(b)
elif a >= 6:
    print(int(b/2))
else:
    print(0)

Submission status: Accepted

Solution code:
A, B = list(map(int, input().split(" ")))
if A > 12:
  	print(B)
elif A < 6:
    print(0)
else:
    print(B // 2)

Submission status: Accepted

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

if N <= 5:
    print(0)
elif N <= 12:
    print(int(M/2))
else:
    print(M)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def solve(): 
    A, B =  map(int, input().split())
    if A <= 5:
        res = 0
    elif A >= 13:
        res = B
    else:
        res = B//2
    return str(res)

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

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
print(b if a >= 13 else int(b/2) if a >= 6 else "0")

Submission status: Accepted

Solution code:
from io import StringIO
from collections import *
from functools import *
import sys


def main(inputs):
    # n = int(next(inputs))
    # n, k = map(int, next(inputs).split())
    # xs = list(map(int, next(inputs).split()))
    a, b = map(int, next(inputs).split())
    if a >= 13:
        return b
    if a >= 6:
        return b // 2
    return 0


def gen_inputs(str_=None):
    inputs = StringIO(str_) if str_ else sys.stdin
    while True:
        a = inputs.readline().rstrip()
        yield a
        pass
    pass


if __name__ == "__main__":
    print(main(gen_inputs()))
    pass

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
if (a>=13):
  print(b)
elif(a>=6):
  print(b//2)
else:
  print('0')

Submission status: Accepted

Solution code:
# coding:utf-8

import math
import re

def main(params):
    a,b = params[0].split()
    a = int(a)
    b = int(b)
    if a <= 5:
        print 0
    elif a >= 6 and a <= 12:
        print b / 2
    else:
        print b
#    a = params[1].split()
#    b = list(params[2])

if __name__ == "__main__":
    cnt = 1 # TODO: edit here
    params = []
    for i in range(cnt):
        param = raw_input()
        params.append(param)
    main(params)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

if A >= 13:
    print(B)
elif A > 5:
    print(int(B/2))

else:
    print(0)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a > 12:
    print(b)
elif a > 5:
    print(b // 2)
else:
    print(0)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print(B if A>=13 else B//2 if A >= 6 else 0)

Submission status: Accepted

Solution code:
A,B = [int(i) for i in input().split()]

if(A>=13):
    print(B)
elif(A>=6):
    print(B//2)
else:
    print(0)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
ans = 0
if A >= 13:
    ans = B
elif 6 <= A <= 12:
    ans = B // 2

print(ans)

Submission status: Accepted

Solution code:
A, B = [int(n) for n in input().split()]
if A >= 13:
    print(B)
elif A >= 6:
    print(B // 2)
else:
    print(0)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if 6<=a<=12:
  print(int(b/2))
elif 13<=a:
  print(b)
else:
  print(0)

Submission status: Accepted

Solution code:
#入力取得
A, B = map(int, input().split())

if A <= 5:
    print(0)
elif A >= 6 and A <=12:
    print(int(B/2))

else:
    print(int(B))

Submission status: Accepted

Solution code:
A,B = [int(it) for it in input().split()]
if (A>=13):
  print ( B )
elif (A>=6):
  print (B//2)
else:
  print ( 0 )

Submission status: Accepted

Solution code:
import sys


fin = sys.stdin.readline
A, B = [int(elem) for elem in fin().split()]

if A >= 13:
    print(B)
elif A <= 5:
    print(0)
else:
    print(int(B/2))

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

if A < 6:
    print(0)
elif A < 13:
    print(int(B / 2))
else:
    print(B)

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a <= 5:
    print(0)
elif a <= 12:
    print(b//2)
else:
    print(b)

Submission status: Accepted

Solution code:
a, b = map(int, raw_input().split())
if(a >= 13):
    print b
elif(a >= 6 and a <= 12):
    print b / 2
else:
    print 0

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
def price(A,B):
    if A>=13:
        price=B
    elif A>=6 and A<=12:
        price=int(B/2)
    else:
        price=0
    return price

print("{}".format(price(A,B)))

Submission status: Accepted

Solution code:
A,B = map(int,input().split())

if A>=13:
    print(B)
elif A<=5:
    print(0)
else:
    print(B//2)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

if A >= 13:
    print(B)
elif 6 <= A <= 12:
    print(int(B / 2))
else:
    print(0)

Submission status: Accepted

Solution code:
a, b = map(int, raw_input().strip().split())
if a >= 13:
    print b
if a >= 6 and a <= 12:
    print b >> 1
if a <= 5:
    print 0

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
if a>12:
    print(b)
elif 5<a<13:
    print(b//2)
else:
    print(0)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a >= 13:
    ans = b
elif 6 <= a <= 12:
    ans = b//2
else:
    ans = 0
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Apr 20 20:47:47 2019

@author: Owner
"""

# -*- coding: utf-8 -*-
"""
Created on Sat Apr 13 09:53:12 2019

@author: Owner
"""
import numpy as np
import sys
import collections
import scipy.misc
import math
from operator import itemgetter
import itertools
import copy
import bisect

#素因数を並べる
def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(int(i))
    i += 1
  if n > 1:
    table.append(int(n))
  return table   
# 桁数を吐く
def digit(i):
    if i > 0:
        return digit(i//10) + [i%10]
    else:
        return []
    
def getNearestValueIndex(list, num):
    """
    概要: リストからある値に最も近い値のインデックスを取得する関数
    @param list: データ配列
    @param num: 対象値
    @return 対象値に最も近い値
    """

    # リスト要素と対象値の差分を計算し最小値のインデックスを取得
    idx = np.abs(np.asarray(list) - num).argmin()
    return idx

def find_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

class UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        """
        x が属するグループを探索
        """
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        """
        x と y のグループを結合
        """
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        """
        x と y が同じグループか否か
        """
        return self.find(x) == self.find(y)

    def get_size(self, x):
        """
        x が属するグループの要素数
        """
        x = self.find(x)
        return self.size[x]
    

"""
N, X = map(int, input().split())

x = list(map(int, input().split()))

P = [0]*N
Y = [0]*N
for n in range(N):
    P[n], Y[n] = map(int, input().split())

# 多次元配列の宣言（あとでintにすること。）（タプルにすること。）
dp = np.zeros((N+1, 4,4,4))
    
all(nstr.count(c) for c in '753')

# 複数配列を並び替え
ABT = zip(A, B, totAB)
result = 0
# itemgetterには何番目の配列をキーにしたいか渡します
sorted(ABT,key=itemgetter(2))
A, B, totAB = zip(*ABT)
A.sort(reverse=True)

# 2進数のbit判定
(x >> i) & 1

# dp最小化問題
dp = [np.inf]*N
for n in range(N):
    if n == 0:
        dp[n] = 0
    else:
        for k in range(1,K+1):
            if n-k >= 0:
                dp[n] = min(dp[n], dp[n-k] + abs(h[n]-h[n-k]))
            else:
                break
# 累積和
add = 1 # 問題によって決まる
res = 0
sums = [0]*(len(nums)+1)
for i in range(len(nums)):
    sums[i+1] = sums[i] + nums[i]
for i in range(0, len(nums), 2):
    left = i
    right = min(i+add, len(nums))
    tmp = sums[right] - sums[left]
    res = max(tmp, res)

#２分探索
li, ri = bisect.bisect_left(p_ac, l[i]-1), bisect.bisect_right(p_ac, r[i]-1)    

#ソート関数
org_list = [3, 1, 4, 5, 2]
new_list = sorted(org_list)
print(org_list)
print(new_list)
# [3, 1, 4, 5, 2]
# [1, 2, 3, 4, 5]

#Distance Transformation
    for h in range(0,H):
        for w in range(0,W):
            if h == 0 and w == 0:
                pass
            elif h == 0:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h-1][W-w]+1)
            elif w == 0:   
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1)
            else:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1, D[H-h-1][W-w]+1, D[H-h][W-w]+2)
            d_max = max(D[H-h-1][W-w-1], d_max)

"""



A, B = list(map(int, input().split()))
def main(): 
    if A >= 13:
        return print(B)
    elif 6 <= A and A <= 12:
        return print(int(B/2))
    else:
        return print(0)
    
                
                
                
            
            
                

    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

if A >= 13:
    print(B)
elif A >= 6:
    print(B//2)
else:
    print('0')

Submission status: Accepted

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

N, B = list(map(int, input().split()))

if N >= 13:
    print(B)
elif 6<=N and N<=12:
    print(int(B/2))
else:
    print(0)

Submission status: Accepted

Solution code:
A, B = map(int, input().split(' '))

if 13 <= A :
    ans = B
elif 6 <= A :
    ans = B // 2
else :
    ans = 0

print(ans)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a>=13:
 print(b)
elif 6<=a<=12:
 print(b//2)
else:
 print(0)

Submission status: Accepted

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

if 6 <= a and a <= 12:
    print(int(b/2))
elif a < 6:
    print(0)
else:
    print(b)

Submission status: Accepted

Solution code:
A,B=list(map(int,input().strip().split(' ')))
if A >=13:
    print(B)
elif A>=6:
    print(B//2)
else:
    print(0)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if A>=13:print(B)
elif A>=6:print(B//2)
else:print(0)

Submission status: Accepted

Solution code:
import sys
range = xrange
input = raw_input

a,b = [int(x) for x in input().split()]

if a>=13:
    print b
elif a>= 6:
    print b//2
else:
    print 0

Submission status: Accepted

Solution code:
age, fee = map(int, input().split())

if age < 6:
    print(0)
elif age < 13:
    print(int(fee/2))
else:
    print(fee)

Submission status: Accepted

Solution code:
# def gcd(a_gcd, b_gcd):
#     while b_gcd != 0:
#         a_gcd, b_gcd = b_gcd, a_gcd % b_gcd
#     return a_gcd
#
#
# def lcm(a_lcm, b_lcm):
#     return a_lcm * b // gcd(a_lcm, b_lcm)
#
#
# def max_sum(N_max_sum, a_max_sum):
#     dp = [0] * (N_max_sum + 1)
#     for i in range(N_max_sum):
#         dp[i + 1] = max(dp[i], dp[i] + a_max_sum[i])
#     return dp[N]
#
#
# def knapsack(N_knapsack, W, weight, value):
#     inf = float("inf")
#     dp = [[-inf for _ in range(W+1)] for j in range(N_knapsack + 1)]
#     for i in range(W+1):
#         dp[0][i] = 0
#
#     for i in range(N_knapsack):
#         for w in range(W+1):
#             if weight[i] <= w:
#                 dp[i+1][w] = max(dp[i][w-weight[i]]+value[i], dp[i][w])
#             else:
#                 dp[i+1][w] = dp[i][w]
#     return dp[N_knapsack][W]
#
#
# class UnionFind:
#     def __init__(self, n):
#         self.par = [i for i in range(n+1)]
#         self.rank = [0] * (n+1)
#
#     # 検索
#     def find(self, x):
#         if self.par[x] == x:
#             return x
#         else:
#             self.par[x] = self.find(self.par[x])
#             return self.par[x]
#
#     # 併合
#     def union(self, x, y):
#         x = self.find(x)
#         y = self.find(y)
#         if self.rank[x] < self.rank[y]:
#             self.par[x] = y
#         else:
#             self.par[y] = x
#             if self.rank[x] == self.rank[y]:
#                 self.rank[x] += 1
#
#     # 同じ集合に属するか判定
#     def same_check(self, x, y):
#         return self.find(x) == self.find(y)
#
# S = input()
# N = int(input())
# A = list(map(int, input().split()))
# X = [int(input()) for _ in range(N)]

A, B = map(int, input().split())

if A >= 13:
    print(B)
elif A <= 5:
    print(0)
else:
    print(int(B/2))



ans = 0





# print(ans)

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
if n >= 13:
    print(k)
elif n < 13 and n >= 6:
    print(int(k/2))
else:
    print(0)

Submission status: Accepted

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

if a <= 5:
  print(0)
elif 6 <= a <= 12:
  print(int(b / 2))
else:
  print(b)

Submission status: Accepted

Solution code:
from sys import stdin
import numpy as np
# import math
# import random
# import fractions
# import sys
# sys.setrecursionlimit(100000)
# N = int(stdin.readline().rstrip().split()[0])
# A = [int(x) for x in stdin.readline().rstrip().split()]
# N, X = [int(x) for x in stdin.readline().rstrip().split()]
# S = stdin.readline().rstrip().split()[0]
A, B = [int(x) for x in stdin.readline().rstrip().split()]

if A>12:
  print(B)
elif A>5:
  print(int(B/2))
else:
  print(0)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
        
if A <= 5:
    print(0)
elif 6 <= A <= 12:
    print(B // 2)
else:
    print(B)

Submission status: Accepted

Solution code:
A, B = map(int , input().split())

if A <= 5:
    print(0)
elif A <= 12:
    print(int(B/2))
else:
    print(B)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())


def f():
    if A <= 5:
        return 0
    elif 6 <= A <= 12:
        return B // 2
    else:
        return B


print(f())

Submission status: Accepted

Solution code:
A,B = map(int, input().split())

if A>=13:
  print(B)
elif 6<=A<=12:
  print(B//2)
else:
  print(0)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
if A>12:
  print(B)
elif A>5:
  print(B//2)
else:
  print(0)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a <= 5:
    print(0)
elif a <= 12:
    print(b // 2)
else:
    print(b)

Submission status: Accepted

Solution code:
import math
a,b=map(int,input().split())
if a>=13:
    print(b)
elif a>=6:
    print(math.floor(b/2))
else:
    print(0)

Submission status: Accepted

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

if a>=13:
    print(b)
elif 6<=a and a<=12:
    print(int(b/2))
else:
    print(0)