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

Submission status: Accepted

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

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

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

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

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())
ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
A,B = (int(x) for x 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 6<=a<=12:
    print(int(b/2))
else:
    print("0")

Submission status: Accepted

Solution code:
import sys
# gcd
from fractions import gcd
# 切り上げ，切り捨て
# from math import ceil, floor
# リストの真のコピー（変更が伝播しない）
# from copy import deepcopy
# 累積和。list(accumulate(A))としてAの累積和
from itertools import accumulate
# l = ['a', 'b', 'b', 'c', 'b', 'a', 'c', 'c', 'b', 'c', 'b', 'a']
# S = Counter(l)  # カウンタークラスが作られる。S=Counter({'b': 5, 'c': 4, 'a': 3})
# print(S.most_common(2))  # [('b', 5), ('c', 4)]
# print(S.keys())  # dict_keys(['a', 'b', 'c'])
# print(S.values())  # dict_values([3, 5, 4])
# print(S.items())  # dict_items([('a', 3), ('b', 5), ('c', 4)])
# from collections import Counter
# import math
# from functools import reduce
#
# input関係の定義
# fin = open('in_1.txt', 'r')
# sys.stdin = fin
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
# template


def iterate_tokens():
    for line in sys.stdin:
        for word in line.split():
            yield word


if __name__ == '__main__':

    # tokens = iterate_tokens()
    # N = int(next(tokens))  # type: int
    # K = int(next(tokens))  # type: int
    # S = list(next(tokens))  # type: str
    A, B = mi()

    # write code
    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)
elif a<=5:
    print("0")

Submission status: Accepted

Solution code:
a = list(map(int,input().split())) #input from array of integer like "1 2 3"

if a[0]>12:
  ans = a[1]
elif a[0]>5:
  ans = a[1]/2
else:
  ans = 0

print(int(ans))

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

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

solve()

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:
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:
#d=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
#import numpy as np
#n=int(input())
#li=input().split()
#import fractions
#n=int(input())
#S=input()
#import math

lis=list(map(int,input().split()))
ans=0
if lis[0]>=13:
    ans=lis[1]
elif lis[0]>=6 and lis[0]<=12:
    ans=int(lis[1]/2)
else:
    ans=0
print(ans)

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

Submission status: Accepted

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

@author: Yamazaki Kenichi
"""

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

if A >= 13:
    print(B)
elif A > 5:
    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:
# coding: utf-8

import sys
import math

import array
import bisect
import collections
from collections import Counter, defaultdict
import fractions
import heapq
import re

sys.setrecursionlimit(1000000)


def array2d(dim1, dim2, init=None):
    return [[init for _ in range(dim2)] for _ in range(dim1)]

def argsort(l, reverse=False):
    return sorted(range(len(l)), key=lambda i: l[i], reverse=reverse)

def argmin(l):
    return l.index(min(l))

def YESNO(ans, yes="YES", no="NO"):
    print([no, yes][ans])

II = lambda: int(input())
MI = lambda: map(int, input().split())
MIL = lambda: list(MI())
MIS = lambda: input().split()


def main():
    a, b = MI()
    if a >= 13: return b
    if a >= 6: return b // 2
    return 0


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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

a,b = get_nums_l()

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

Submission status: Accepted

Solution code:

from math import *

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 = 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 sys import stdin
A, B = [int(_) for _ in stdin.readline().rstrip().split()]
if A >= 13:
    print(B)
elif 6 <= A <= 12:
    print(int(B/2))
elif A <= 5:
    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 = list(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:
# from sys import exit
A, B = [int(n) for n in input().split()]
# N = int(input())
# a = [int(input()) for _ in range(N)]
# S = str(input())
# L = len(S)
# T = str(input())
# exit()
if A >= 13:
    print(B)
elif 6 <= A <= 12:
    print(B//2)
else:
    print(0)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    [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:
import sys

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

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


# aとbの最大公約数
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)

# aとbの最小公倍数
def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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:
def intinput():
    return map(int,input().split())

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

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

print(r)

Submission status: Accepted

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

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

if x >= 13:
    print(y)

elif x <= 5:
    print(0)

else:
    print(int(y/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline



def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [A, B] = [int(input_raw[0]), int(input_raw[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 <= 5:
    print(0)
elif 6 <= A <= 12:
    print(int(B/2))
else:
    print(B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import functools
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

A,B = IL()

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

print(int(res))

Submission status: Accepted

Solution code:
#!/usr/bin/env python
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(x) for x in input().split()]
if a<=5:
    print(0)
elif 6<=a<=12:
    print(b//2)
else:
    print(b)

Submission status: Accepted

Solution code:
# abcde	s=input()	s='abcde'
# abcde	s=list(input())	s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ)	a=int(input())	a=5
# 1 2	| x,y = s_inpl()   |	x=1,y=2
# 1 2 3 4 5 ... n 　	li = input().split()	li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n 　	li = inpl()	li=[1,2,3,4,5,...,n]
# FFFTFTTFF 　	li = input().split('T')	li=['FFF', 'F', '', 'FF']

# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]

import math
import copy
from collections import defaultdict
from collections import Counter
from collections import deque
# 直積 A={a, b, c}, B={d, e}:のとき，A×B={(a,d),(a,e),(b,d),(b,e),(c,d),(c,e)}: product(A, B)
from itertools import product
# 階乗 P!: permutations(seq), 順列 {}_len(seq) P_n: permutations(seq, n)
from itertools import permutations
# 組み合わせ {}_len(seq) C_n: combinations(seq, n)
from itertools import combinations
from bisect import bisect_left, bisect_right
# import numpy as np

def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W

# 四方向: 右, 下, 左, 上
dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]

def i_inpl(): return int(input())
def s_inpl(): return map(int,input().split())
def l_inpl(): return list(map(int, input().split()))
INF = float("inf")

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

A, B = l_inpl()

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:ans=0
elif 6<=a<=12:ans=b*.5
else:ans=b
print(int(ans))

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)
    elif 5 >= A:
        print(0)


main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# IMPORT ###############################################################################################################
import sys                                                      # システム
sys.setrecursionlimit(10**6)                                    # 再帰処理の上限変更
from collections import deque, Counter                          # キュー・個数カウント
from itertools   import accumulate, permutations, combinations  # 累積和・順列・組み合わせ
from operator    import itemgetter                              # ソート補助
from bisect      import bisect_left, bisect_right, bisect       # 二分探索
from heapq       import heappop, heappush                       # プライオリティキュー
from fractions   import gcd                                     # 最大公約数
from math        import ceil, floor, sqrt, cos, sin, tan, pi    # 数学処理
from copy        import deepcopy                                # オブジェクトコピー
import numpy         as np                                      # 数値計算

# MAIN #################################################################################################################
def main():
    # Init #############################################################################################################
    im = InputManager()
    # Input ############################################################################################################
    a, b = im.inputMultiple()
    # Logic ############################################################################################################
    if a>=13:
        print(b)
    elif a >= 6:
        print(b // 2)
    else:
        print(0)
    # Output ###########################################################################################################

    # Return ###########################################################################################################
    return

# INPUT MANAGER ########################################################################################################
class InputManager(object):
    def __init__(self):
        pass

    @staticmethod
    def inputSingle(dtype=int):
        return dtype(input())
    
    @staticmethod
    def inputMultiple(dtype=int, aslist=False):
        if aslist:
            return list(map(dtype, input().split()))
        else:
            return map(dtype, input().split())

    @staticmethod
    def input2D(h, dtype=int):
        return [list(map(dtype, input().split())) for i in range(h)]

# CALL MAIN ############################################################################################################
main()

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

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

Submission status: Accepted

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

A,B=MAP()

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

if A >= 13:
	print(B)
elif A >= 6 and A <= 12:
	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 >= 6:
    ans = int(B / 2)

print(ans)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
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 II(): return int(sys.stdin.readline())
def SI(): return input()

def main():
    A, B = LI()
    if A >= 13:
        ans = B
    elif A >= 6:
        ans = B // 2
    else:
        ans = 0
    return ans

print(main())

Submission status: Accepted

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

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:
from itertools import product
import bisect
import sys


def input():
    return sys.stdin.readline()[:-1]

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

if a >= 13:
    print(b)
if 6 <= a <= 12:
    print(b//2)
if  a <= 5:
    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:
listAB = list(map(int,input().split()))
A = listAB[0]
B = listAB[1]

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

print(output)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import collections
ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
nm = lambda: map(int, sys.stdin.readline().split())
nl = lambda: list(nm())
nsm = lambda: map(str, sys.stdin.readline().split())

a, b = nm()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
from sys import exit

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 = 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 = map(int,input().split())
import math 
if a <= 5:
    print(0)
elif 6<=a<=12:
    print(math.floor(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:
def getlist():
	return list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)


def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(A, B):
    if A <= 5:
        return 0
    elif A <= 12:
        return B//2
    return B


def main():
    # N = read_int()
    A, B = read_int_n()
    # A = [read_int_n() for _ in range(N)]
    print(slv(A, B))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

if n>=13:
    print(m)
elif 6<=n<=12:
    print(m//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 6 <= A <= 12:
    print(B//2)
else:
    print(B)

Submission status: Accepted

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

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

print(Ans)

Submission status: Accepted

Solution code:

def main():
    a, b = map(int, raw_input().split())
    if a <= 5:
        print 0
    elif a < 13:
        print b // 2
    else:
        print b


if __name__ == '__main__':
    main()

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 and a <= 12:
    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:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

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

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