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)

if A>5 and A<13:
    print(B//2)

if A<= 5:
    print(0)

Submission status: Accepted

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

ans = 0

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

print(int(ans))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc127_a
# Ferris Wheel

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:
import sys,heapq
from collections import deque,defaultdict
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True # and False
def ddprint(x):
  if DBG:
    print(x)

a,b = inm()
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 6<=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(B // 2)
else:
    print(B)

Submission status: Accepted

Solution code:
Input = input().split()
A = int(Input[0])
B = int(Input[1])

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# abc 127 a
# # input
#a = int(input())
#a = input()
a, b = map(int, input().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 A >= 13:
  print(B)
else:
  print(B//2)

Submission status: Accepted

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

inp = input().split()
A = int(inp[0])
B = int(inp[1])

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

Submission status: Accepted

Solution code:
A, B = [int(i) for i in 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 > 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>=13:
    print(B)
elif 5<A<13:
    print(int(B/2))
else:
    print(0)

Submission status: Accepted

Solution code:
import sys
 
 
A,B = sys.stdin.readline().strip().split()
A = int(A)
B = int(B)

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:
  B = 0
elif A <=12:
  B //= 2

print(B)

Submission status: Accepted

Solution code:

# import math
# import random as rd
# import numpy as np

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())

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

print(price)

Submission status: Accepted

Solution code:
import sys
import os
A, B = map(int, input().split())
c=0
if A>=6:
    c=int(B/2)

if A>=13:
    c=B
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
a,b = input().split()
a = int(a)
b = int(b)
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().strip().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:
    print(int(B/2))
else:
    print(0)

Submission status: Accepted

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

import math

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if age >= 13:
    ans = value
elif age <= 5:
    ans = 0
else:
    ans = value / 2

print(int(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b= map(int,open(0).read().split())

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

Submission status: Accepted

Solution code:
a, b  = tuple(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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import sys

input = sys.stdin.readline

def main():
    a, b = [int(e) for e in input().split()]
    if a >= 13:
        print(b)
    elif 12 >= a >= 6:
        print(int(b/2))
    else:
        print(0)

main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math, string, itertools, fractions, heapq, collections, re, array, bisect, copy, functools, random
import sys
from collections import deque, defaultdict, Counter; from heapq import heappush, heappop
from itertools import permutations, combinations, product, accumulate, groupby
from bisect import bisect_left, bisect_right, insort_left, insort_right
from operator import itemgetter as ig
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20; INF = float("INF"); ans = 0; tmp = 0; ansli = []; tmpli = []; candili = []
eps = 1.0 / 10 ** 10; mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]; ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)]; ddn9 = ddn + [(0, 0)]
"""for dx, dy in dd:
        nx = j + dx; ny = i + dy
            if 0 <= nx < w and 0 <= ny < h:"""
def wi(): return list(map(int, sys.stdin.readline().split()))
def wip(): return [int(x) - 1 for x in sys.stdin.readline().split()]#WideIntPoint
def ws(): return sys.stdin.readline().split()
def i(): return int(sys.stdin.readline())
def s(): return input()
def hi(n): return [i() for _ in range(n)]
def hs(n): return [s() for _ in range(n)]#HeightString
def mi(n): return [wi() for _ in range(n)]#MatrixInt
def mip(n): return [wip() for _ in range(n)]
def ms(n): return [ws() for _ in range(n)]

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

Submission status: Accepted

Solution code:
def main():
    age, cost = map(int, input().split())

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

if __name__ == "__main__":
    main()

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

Submission status: Accepted

Solution code:
from sys import stdin

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

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

input = lambda: stdin.readline()
main()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
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:
import numpy as np
words = lambda t : list(map(t, input().split()))
a,b = words(int)

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())
print(b if a>12 else b//2 if 5<a<13 else 0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!venv/bin/python
 
import math
import numpy as np
import random
import copy
import statistics 
import bisect
import heapq
from collections import defaultdict 

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

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

Submission status: Accepted

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

if age <= 5:
	price = 0
elif age <= 12:
	price //= 2

print(price)

Submission status: Accepted

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

if A <= 5:
    print(int(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())

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

print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

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


if A >= 13:
  print(B)
else:
  if A>=6:
    print(B//2)
  else:
    print(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:
#!/usr/bin/env python3
import sys


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


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:
A, B = map(int, input().split())
money = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# sys.stdin.readline()
import sys
input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
# N = int(input())
# A = [int(x) for x in input().split()]
# V = [[0] * 100 for _ in range(100)]

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

ans = 0
if A >= 13:
    ans = B
elif 6 <= A and A <= 12:
    ans = B // 2

print(ans)

Submission status: Accepted

Solution code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

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

Submission status: Accepted

Solution code:
import sys,collections,math,random;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

Submission status: Accepted

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

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:
# -*- coding: utf-8 -*-
a, b = map(int, raw_input().split())
# 文字列の入力
#s = raw_input()
# 出力
if a >=13:
    print b
if a >=6 and 12 >=a:
    print b/2
if 5 >= a:
    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())

ans =  b if 13<= a else b//2 if 6<=a and a <= 12 else 0

print(ans)

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

a,b = li()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline

A, B = map(int, readline().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 > 12:
    print(B)
elif 5 < A < 13:
    print(int(B / 2))
else:
    print(0)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May 25 20:57:26 2019

@author: USER
"""

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:
#!/usr/bin/env python3
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 6 <= a <= 12: print(b // 2)
elif a <= 5: print(0)
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 > 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 >= 13:
    print(b)
elif 6 <= a <= 12:
    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:
a,b = map(int,input().split())

if a >= 13 : print("{}".format(b))
elif 6<= a <= 12 : print("{}".format(int(b/2)))
else: print("0")

Submission status: Accepted

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

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

Submission status: Accepted

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

if a >= 13:
    print(int(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(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 a <= 5:
    ans = 0
else:
    ans = b //2

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def main(inp):
    a,b = map(int,next(inp).split())
    if(a<=5): return 0
    elif(a<=12): return int(b/2)
    else: return b
    
print(main(sys.stdin))

Submission status: Accepted

Solution code:
from collections import Counter
from collections import deque
from functools import reduce
from pprint import pprint
# import statistics
import bisect
import copy
import fractions
import math
import random
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) 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 MI(): return map(int, sys.stdin.readline().split())
def II(): return int(sys.stdin.readline())
def IS(): return input()
def C(x): return Counter(x)
def GCD_LIST(numbers):
    return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers):
    return reduce(LCM, numbers)
def LCM(m, n):
    return (m * n // fractions.gcd(m, n))
def unite(x, y):
    # それぞれのノードの根を求める
    x = root(x)
    y = root(y)
    if x == y:
        return
    # node[x]の根をyに変更する
    node[x] = y
def same(x,y): return bool(root(x) == root(y))
def root(x):
    if node[x] == x:  # xが根の場合
        return x
    else:
        node[x] = root(node[x])  # 経路圧縮
        return node[x]
def dfs(v):
    # ノードに訪れた
    visited[v] = True
    for v2 in range(n):
        if graph[v][v2] == False:  # そもそもvとv2が辺でつながっていない
            continue
        if visited[v2] == True:  # もう見た
            continue
        dfs(v2)

a, b = MI()
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 A <= 5:
    print(0)
else:
    print(B//2)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:

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

def submit():
    a, b = read_input()

    if a >= 13:
        print(b)
        return

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

    print(0)
    return


if __name__ == '__main__':
    submit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
"""<https://github.com/cheran-senthil/PyRival>"""
from __future__ import division, print_function

import os
import 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()


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

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


# 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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = raw_input().split()
A = int(l[0])
B = int(l[1])

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

Submission status: Accepted

Solution code:
# coding: utf-8
import time
import os
import time
import re
import math


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

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

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

Submission status: Accepted

Solution code:
import sys

A, B = list(map(int, sys.stdin.readline().strip().split(" ")))

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
input = sys.stdin.readline
 
# bisect_left(lists, 3)
# bisect_right(lists, 3)
 
def main():
	A, B = map(int, input().split(" "))
	#N = int(input())
	#S = input()

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

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
def solve():
    A, B = [int(_) for _ in raw_input().split()]
    if A <= 5:
        print 0
    elif A >= 6 and A <= 12:
        print (B / 2)
    else:
        print B

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

a = data[0]

if a >= 13:
    print(data[1])
elif a >= 6:
    print(data[1] // 2)
else:
    print(0)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
s = input()
a, b = map(int, s.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:
import math

n,m = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
# 2019/05/25
# AtCoder Beginner Contest 127 - A

# Input
a, b = map(int,input().split())

# Calc
if a >= 13:
    ans = b
elif a >= 6:
    ans = int(b / 2)
else:
    ans = 0

# Output
print(ans)

Submission status: Accepted

Solution code:
A, B = [int(i) for i in input().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 >= 13):
    print(B)
elif ((A <= 12)and(A >= 6)):
    print(int(B/2))
else:
    print("0")

Submission status: Accepted

Solution code:
A, B = map(int, raw_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<6:
    print("0")
elif A>=6 and A<=12:
    print(B//2)
else:
    print(B)

Submission status: Accepted

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

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 6 <= a and 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 a >= 6 and a <= 12:
        print(b//2)
    else:
        print(0)

if __name__ == '__main__':
    main()

Submission status: Accepted

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


def solve(A: int, B: int):
    if(A >= 13):
        print(B)
    elif(6 <= A <= 12):
        print(int(B/2))
    else:
        print(0)
    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()