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:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque, defaultdict
#deque(l), pop(), append(x), popleft(), appendleft(x)
#q.rotate(n)で → にn回ローテート
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import reduce,lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("## ",*x,file=sys.stderr)
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reversed=True)  #二個目の要素で降順並び替え

    #N = int(input())
    A,B = map(int, input().split())
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列


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

Submission status: Accepted

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

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

Submission status: Accepted

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

if 13 <= A:
    print(B)

elif 6 <= A <= 12:
    print(B//2)

elif A <= 5:
    print(0)

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

Submission status: Accepted

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

if a>12:
    print(b)
else:
    if a<6:
        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:
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
import heapq
import re
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from math import factorial, sqrt, ceil, gcd
from functools import lru_cache, reduce
from decimal import Decimal
from operator import mul

INF = 1 << 60
MOD = 1000000007
sys.setrecursionlimit(10 ** 7)


# UnionFind
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# ダイクストラ
def dijkstra_heap(s, edge, n):
    #始点sから各頂点への最短距離
    d = [10**20] * n
    used = [True] * n #True:未確定
    d[s] = 0
    used[s] = False
    edgelist = []
    for a,b in edge[s]:
        heapq.heappush(edgelist,a*(10**6)+b)
    while len(edgelist):
        minedge = heapq.heappop(edgelist)
        #まだ使われてない頂点の中から最小の距離のものを探す
        if not used[minedge%(10**6)]:
            continue
        v = minedge%(10**6)
        d[v] = minedge//(10**6)
        used[v] = False
        for e in edge[v]:
            if used[e[1]]:
                heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
    return d

# 素因数分解
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

# 組合せnCr
def combinations_count(n, r):
    if n < r:
        return 0
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom

# 2数の最小公倍数
def lcm(x, y):
    return (x * y) // gcd(x, y)

# リストの要素の最小公倍数
def lcm_list(numbers):
    return reduce(lcm, numbers, 1)

# リストの要素の最大公約数
def gcd_list(numbers):
    return reduce(gcd, numbers)

# 素数判定
def is_prime(n):
    if n <= 1:
        return False
    p = 2
    while True:
        if p ** 2 > n:
            break
        if n % p == 0:
            return False
        p += 1
    return True


# limit以下の素数を列挙
def eratosthenes(limit):
    A = [i for i in range(2, limit+1)]
    P = []

    while True:
        prime = min(A)
        
        if prime > sqrt(limit):
            break
            
        P.append(prime)
            
        i = 0
        while i < len(A):
            if A[i] % prime == 0:
                A.pop(i)
                continue
            i += 1
            
    for a in A:
        P.append(a)
            
    return P

# 同じものを含む順列
def permutation_with_duplicates(L):

    if L == []:
        return [[]]

    else:
        ret = []

        # set（集合）型で重複を削除、ソート
        S = sorted(set(L))

        for i in S:

            data = L[:]
            data.remove(i)

            for j in permutation_with_duplicates(data):
                ret.append([i] + j)

        return ret

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

# ここから書き始める
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<6:
	print("0")
elif 6<=A<=12:
	print(B//2)

Submission status: Accepted

Solution code:
import math
import sys
input = sys.stdin.readline
a, b = map(int, input().split())
if (a < 6):
    cost = 0
elif (a < 13):
    cost = b // 2
else:
    cost = b
print(cost)

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 sys
input = lambda: sys.stdin.readline().rstrip()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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 > 12:
    print(b)
elif a < 13 and 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(B // 2)
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print((b>>(a<13))*(a>5))

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:
  print(B)
elif 6 <= A <= 12:
  print(int(B*0.5))
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:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
a,b = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict

# import fractions

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)
# lcm = lambda x, y: (x * y) // fractions.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, B = il()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
try:
    age,money=map(int, input().split())
    assert 0<=age<=100 and 2<=money<=1000 and money%2==0
    if age<=5:
        print('0')
    elif 6<=age<=12:
        print(money//2)
    else:
        print(money)
except AssertionError:
    print('')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a , b = map(int, 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:
import sys
sys.setrecursionlimit(10**6)

#a = int(input())
#b = list(map(int, input().split()))
a, b = map(int, input().split())
#s = input()
#s,t = input().split()
#a = [int(input()) for _ in range(n)]
#
#readline = sys.stdin.readline
#n,m = [int(i) for i in readline().split()]
#ab = [[int(i) for i in readline().split()] for _ in range(n)]

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

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

Submission status: Accepted

Solution code:
inp = input().split()

age = int(inp[0])
cost = int(inp[1])

if age >= 13: print(cost)
elif age >= 6: print(int(cost/2))
else: print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 初期入力
import sys
input = sys.stdin.readline
A,B = (int(i) for i in input().split())
if 13 <= A:
    ans =B
elif 6 <= A <=12:
    ans =B//2
elif A <=5:
    ans =0

print(ans)

Submission status: Accepted

Solution code:
inp=input()
list =inp.split()
age, cost=list[0], list[1]
age=int(age)
cost=int(cost)
if age>=13:
  cost=cost
elif age<13 and age>5:
  cost=cost*0.5
else:
  cost=0
print(int(cost))

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:
# 127 A

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

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

A, B = MI()

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(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 < 13:
    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:
age, max_money = map(int, input().split())
if age>= 13:
  print(max_money)
elif age>=6 and age<=12:
  print(max_money//2)
elif age<=5:
  print("0")

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
import sys
a=sys.stdin.readline()
res = [int(i) for i in a.split() if i.isdigit()] 
A,B = [res[i] for i in (0,1)]
if B%2==0 and (B>=2 and B<= 1000) and (A>=0 and A<=100):
	if A>=13:
		print(B)
	elif A>=6 and A<=12:
		print(int(B/2))
	elif A<=5:
		print(0)
else:
	print("Error")

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:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60


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


if __name__ == '__main__':
    main()

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 = input()
s = a.find(' ')
a+= "."
b = a[s+1:-1]
a= a[0:s]
a=int(a)
b=int(b)
c= int(b/2)
if a>12:
  print(b)
elif a<=12 and a>=6:
  print(c)
else:
  print(0)

Submission status: Accepted

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

if (0<=x<=5):
      print(0)
elif (5<x<13):
      print(y//2)
else:
      print(y)

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:
res = [int(i) for i in input().split() if i.isdigit()]
if res[0] >= 6 and res[0] <= 12:
    print(int(res[1]/2))
elif res[0] <= 5:
    print(0)
elif res[0] >= 13:
    print(int(res[1]))

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=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 = 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 13<=A:
    print(B)
elif 6<=A<13:
    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:
age,fee=map(int,input().split())

if age>=13:
    print(fee)
elif age<13 and age>=6:
    print(int(fee/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(B)
elif(12>=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)
  exit()
  
if a >= 6:
  b //= 2
  print(b)
  exit()
  

print(0)

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    a, b = map(int, input().split())
    if a >= 13:
        print(b)
    elif 6 <= a <= 12:
        print(b // 2)
    elif a <= 5:
        print(0)


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

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

Submission status: Accepted

Solution code:
import sys

input = lambda: sys.stdin.readline().rstrip()


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

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


if __name__ == '__main__':
    solve()

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:
import sys
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:
import sys
def input():
    return sys.stdin.readline()[:-1]
def main():
#    N = int(input())
    A, B = map(int,input().split())
#    S = input()
    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 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:
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 6<=A<=12:
    print(int(B/2))
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
def ip():return int(input())
def inp():return map(int,input().split())
def linp():return list(map(int,input().split()))

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

Submission status: Accepted

Solution code:

def s0():return input()
def s1():return input().split()
def s2(n):return [input() for x in range(n)]
def s3(n):return [input().split() for _ in range(n)]
def s4(n):return [[x for x in s] for s in s2(n)]
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
def t3(n):return [tuple(int(x) for x in input().split()) for _ in range(n)]
def p0(b,yes="Yes",no="No"): print(yes if b else no)
# from sys import setrecursionlimit
# setrecursionlimit(1000000)
# from collections import Counter,deque,defaultdict
# import itertools
# import math
# import networkx as nx
# from bisect import bisect_left,bisect_right
# from heapq import heapify,heappush,heappop
a,b=n1()

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

Submission status: Accepted

Solution code:
import sys
from collections import Counter
from collections import deque
import heapq
import math
import fractions
import bisect
import itertools
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

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