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:
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 = list(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,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())
if a>12:
  print(b)
elif a>5 and a<13:
  print(int(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:
import sys
input=sys.stdin.readline


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)


def main():
    a,b = LI()
    if a >= 13:
        return b
    if a < 6:
        return 0

    return b // 2


print(main())

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
inf = float('inf')
mod = 10**9+7


def INT_(n): return int(n)-1


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


def MF(): return map(float, input().split())


def MI_(): return map(INT_, input().split())


def LI(): return list(MI())


def LI_(): return [int(x) - 1 for x in input().split()]


def LF(): return list(MF())


def LIN(n: int): return [input() for _ in range(n)]


def LLIN(n: int): return [LI() for _ in range(n)]


def LLIN_(n: int): return [LI_() for _ in range(n)]


def LLI(): return [list(map(int, l.split())) for l in input()]


def I(): return int(input())


def F(): return float(input())


def ST(): return input().replace('\n', '')


def main():
    A, B = MI()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b= list(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())
print(b if a >= 13 else int(b/2) if 6<=a<=12 else 0)

Submission status: Accepted

Solution code:
A, B = list(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 <= 5:
    print(0)
elif 6 <= A <= 12:
    print(B//2)
else:
    print(B)

Submission status: Accepted

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

ans = b

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

print(ans)

Submission status: Accepted

Solution code:
def main():
    from sys import stdin, stdout

    def read():
        return stdin.readline().rstrip('\n')

    def read_array(sep=None, maxsplit=-1):
        return read().split(sep, maxsplit)

    def read_int():
        return int(read())

    def read_int_array(sep=None, maxsplit=-1):
        return [int(a) for a in read_array(sep, maxsplit)]

    def write(*args, **kwargs):
        sep = kwargs.get('sep', ' ')
        end = kwargs.get('end', '\n')
        stdout.write(sep.join(str(a) for a in args) + end)

    def write_array(array, **kwargs):
        sep = kwargs.get('sep', ' ')
        end = kwargs.get('end', '\n')
        stdout.write(sep.join(str(a) for a in array) + end)

    a, b = read_int_array()
    if a >= 13:
        write(b)
    elif a >= 6:
        write(b // 2)
    else:
        write(0)

main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
a,b = list(map(int, 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):
    if 13 <= A:
        return B
    elif 6 <= A <= 12:
        return B//2
    else:
        return 0

A,B = map(int,input().split(" "))
print(main(A,B))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
#import numpy as np

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    A, B = i2nn()
    n = B
    if 6 <= A and A <= 12:
        n = B / 2
    elif A <= 5:
        n = 0
    n = int(n)
    print(n)

main()

Submission status: Accepted

Solution code:
a,b= list(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(" "))
if A >= 13:
    print(B)
elif A < 6:
    print(0)
else:
    print(B//2)

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<=5:
    print(0)
elif(A<=12):
    print(B//2)
else:
    print(B)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A >= 13:
	print(B)
elif A >=6:
	print(int(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:
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:
a,b = (int(num) for num in input().split())
if a > 12:
    print(b)
elif a > 5:
    print(b//2)
else:
    print(0)

Submission status: Accepted

Solution code:
def inpl(): return map(int, input().split())

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

Submission status: Accepted

Solution code:
import sys
import math
from itertools import permutations
input = sys.stdin.readline

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

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

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 sys


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


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


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

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 = [int(elm) for elm in input().split(" ")] 

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

print(out)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

A,B=[int(c) for c in input().split()]

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin
import math
import fractions
from collections import deque

INF = 10 ** 10

A, B = [int(x) for x in stdin.readline().rstrip().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:
    print(0)
elif 6 <= A <= 12:
    print(B // 2)
else:
    print(B)

Submission status: Accepted

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

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

Submission status: Accepted

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

if a <= 5:
    print(0)
elif 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 = [int(i) for i in input().split()]

if a > 12:
  print(b)
elif a > 5:
  print(b // 2)
else:
  print(0)

Submission status: Accepted

Solution code:
###############################################################################

from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


class UnionFind:

    def __init__(self, n):
        self.parent = [i for i in range(n)]

    def root(self, i):
        if self.parent[i] == i:
            return i
        self.parent[i] = self.root(self.parent[i])
        return self.parent[i]

    def unite(self, i, j):
        rooti = self.root(i)
        rootj = self.root(j)
        if rooti == rootj:
            return
        if rooti < rootj:
            self.parent[rootj] = rooti
        else:
            self.parent[rooti] = rootj

    def same(self, i, j):
        return self.root(i) == self.root(j)


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


def main():
    a, b = intin()

    if a >= 13:
        print(b)
        return
    if a >= 6:
        print(b // 2)
        return

    print(0)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#JMD
#Nagendra Jha-4096

 
import sys
import math

#import fractions
#import numpy
 
###File Operations###
fileoperation=0
if(fileoperation):
    orig_stdout = sys.stdout
    orig_stdin = sys.stdin
    inputfile = open('W:/Competitive Programming/input.txt', 'r')
    outputfile = open('W:/Competitive Programming/output.txt', 'w')
    sys.stdin = inputfile
    sys.stdout = outputfile

###Defines...###
mod=1000000007
 
###FUF's...###
def nospace(l):
    ans=''.join(str(i) for i in l)
    return ans
 
 
 
##### Main ####
t=1
for tt in range(t):
    #n=int(input())
    a,b= map(int, sys.stdin.readline().split(' '))
    if a<=5 :
        print(0)
    elif a<=12:
        print(b//2)
    else:
        print(b)
    #a=list(map(int,sys.stdin.readline().split(' ')))
    
    
#####File Operations#####
if(fileoperation):
    sys.stdout = orig_stdout
    sys.stdin = orig_stdin
    inputfile.close()
    outputfile.close()

Submission status: Accepted

Solution code:
from collections import defaultdict


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


if __name__ == '__main__':
    Solution().main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if a <= 5:
    print(0)

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

else:
    print(b)

Submission status: Accepted

Solution code:
A, B = [int(i) for i in raw_input ().split()]
if A <= 5: print 0
elif A > 5 and 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 6<=a<=12:
    print(b//2)
else:
    print(b)

Submission status: Accepted

Solution code:
A,B = [int(i) for i in 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,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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

a,b = map(int,input().strip().split())

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

Submission status: Accepted

Solution code:
import sys
rr = lambda: sys.stdin.readline().strip()
rri = lambda: int(rr())
rrs = lambda: [int(_) for _ in rr().split()]

A, B = rrs()
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 < 6:
    print(0)
elif a < 13:
    print(b // 2)
else:
    print(b)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys, math, collections, heapq, itertools
F = sys.stdin
def single_input(): return F.readline().strip("\n")
def line_input(): return F.readline().strip("\n").split()
def gcd(a, b):
    a, b = max(a, b), min(a, b)
    while a % b > 0: a, b = b, a % b
    return b
  
def solve():
    A, B = map(int, line_input())
    if A >= 13: print(B)
    elif A >= 6: print(B//2)
    else: print(0)
    return 0
  
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
    buf = input()
    buflist = buf.split()
    A = int(buflist[0])
    B = int(buflist[1])
    if A >= 13:
        print(B)
    elif A >= 6:
        print(B // 2)
    else:
        print(0)

if __name__ == '__main__':
    main()

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 < 6:
    print(0)
elif A < 13:
    print(B // 2)
else:
    print(B)

Submission status: Accepted

Solution code:
A,B = map(int, raw_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(0 if a<6 else(b//2 if a<13 else b))

Submission status: Accepted

Solution code:
a, b = (int(_) for _ in 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())
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 >= 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 >= 13:
	print(B)
elif A>= 6:
	print(B//2)
else:
	print(0)

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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


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:
import sys
input = sys.stdin.readline

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:
#coding:utf-8
a, b = map(int, input().split())
if a < 6:
    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:
    b = 0
elif a<=12:
    b = b//2
print(b)

Submission status: Accepted

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

if n <= 5:
  print(0)
elif 6 <= n <= 12:
  print(m // 2)
else:
  print(m)

Submission status: Accepted

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

Submission status: Accepted

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

if A >= 13:
    result = B
elif A >= 6:
    result = B // 2
else:
    result = 0

print(result)

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(B//2)
else:
    print(0)

Submission status: Accepted

Solution code:
from fractions import *
a, b = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if A>=13:
    print(B)
elif 12>=A>=6:
    print(B//2)
elif A>=0:
    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 = list(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, 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 >= 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:
    print(0)
elif 6 <= A <= 12:
    print(B // 2)
else:
    print(B)

Submission status: Accepted

Solution code:
import sys
from collections import deque
import math
sys.setrecursionlimit(20000000)
#input = sys.stdin.readline
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 itertools
from collections import Counter
from collections import defaultdict
import bisect

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(b if a > 12 else b // 2 if 6<= a <= 12 else 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:
a, b = list(map(int, input().split()))
if a>=13:
  print(b)
elif a>=6:
  print(b//2)
else:
  print(0)

Submission status: Accepted

Solution code:


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

if A <=5:
    print(0)
elif A >=6 and A <=12:
    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:
import sys

sys.setrecursionlimit(10**7)

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

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

a, b = na()

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

A, B = MAP()

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

Submission status: Accepted

Solution code:
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18
MOD=10**9+7

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

Submission status: Accepted

Solution code:
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:
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 >= 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 5<a<13:print(b//2)
elif 12<a:print(b)
else:print(0)

Submission status: Accepted

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

sys.setrecursionlimit(10000)
INF = float('inf')



A, B = list(map(int, 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 = (
    B if A >= 13 else
    B // 2 if A >= 6 else
    0
)

print(ans)

Submission status: Accepted

Solution code:
from collections import defaultdict as ddic, deque, Counter
from itertools import permutations, combinations, product
import bisect, heapq

rr = raw_input
rri = lambda: int(raw_input())
rrm = lambda: map(int, raw_input().split())

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

print solve(*rrm())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC127-A
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(input())
def S(): return list(input())
a,b=IL()
if a>=13:
    print(b)
elif 6<=a<=12:
    print(b//2)
else:
    print(0)

Submission status: Accepted

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

if A <= 5:
    print(0)
elif A <= 12:
    print(B // 2)
else:
    print(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:
	print(0)
elif 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 a >= 6:
    print(int(b / 2))
else:
    print(0)

Submission status: Accepted

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(ans)

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())

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

Submission status: Runtime Error

Solution code:
A = input()
B = input()

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

Submission status: Runtime Error

Solution code:
#年齢
A = input()
#料金
B = input()

if A >= 13:
  return B
elif 13> A >=6:
  return B/2
else:
  return 0

Submission status: Runtime Error

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

for i range(10):
  x = r*x -D
  print(x)

Submission status: Runtime Error

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

    a_list = list(map(int,input().split()))
    total = 0

    for i in range(m):
        b,c = map(int,input().split())
        a_list.extend([c]*b)

    a_list.sort(reverse=True)
    print(sum(a_list[:n]))

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
n, m = map(int, input().split())
l, r = list(map(int, [input().split() for i in range(m)]))

max_l = max(l)
min_r = min(r)
print(max(min_r - max_l, 0))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#ABC127 A

A, B = map(int,input(),split())
if A >= 13:
    print(B)
elif 6 <= A <= 12:
    print(B/2)
elif A <= 5:
    print(0)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b = input().split(" ")
if int(a) >= 13:
  print(b)
elif int(a) in range(6,13):
  print(b/2)
elif int(a) <= 5:
  print(0)

Submission status: Runtime Error

Solution code:

def main():
    a, b = map(int, input())
    if a >= 13:
        print(b)
    elif 6 <= a <= 12:
        print(b // 2)
    else:
        print(0)


if __name__ == "__main__":
    main()