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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

ans = 0 if a <= 5 else b//2 if a <= 12 else b

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

Submission status: Accepted

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

Submission status: Accepted

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

    if (A >= 13):
        print(B)
        return
    
    if (6 <= A <= 12):
        print(B // 2)
        return

    print(0)


resolve()

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>=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 5 < 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('{}'.format(b//2))
else:
  print("{}".format(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:
def main():
  num = list(map(int,input().split()))
  if num[0]<=5:
    print(0)
  elif num[0]>=13:
    print(num[1])
  else :
    print(int(num[1]/2))

main()

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:
#!/usr/bin/env python3

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

Submission status: Accepted

Solution code:
from sys import stdin
def LI(): return list(map(int,stdin.readline().rstrip().split()))
tmp = LI()
a,b = [tmp.pop(0) for _ in range(2)]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
from collections import deque, defaultdict
from itertools import combinations, combinations_with_replacement
import bisect
from math import factorial, sqrt, log, ceil, floor

def main():
    #N, M = map(int, input().split())
    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:
def main() -> None:
    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 A>=6 and A<=12:
  print(int(B/2))
elif A<=5:
  print(0)

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
a, b = M()
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 6 <= A <=12 else 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 > 12:
    print(b)
elif a > 5:
    print(b // 2)
else:
    print(0)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

# check
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) & (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 = [int(x) for x in input().split()]
print(
  0 if a <= 5 else
  b // 2 if a <= 12 else
  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:
import math
a,b = map(int,input().split())
m = 0
if a >= 13:
    m = b
elif a >= 6 and a <=12:
    m = b / 2
print(math.floor(m))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)

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

Submission status: Accepted

Solution code:
from collections import Counter 
from collections import defaultdict
from collections import deque
import math
import itertools
import heapq
import sys
sys.setrecursionlimit(10**6)

#n=int(input())
#n,m=list(map(int,input().split()))
#a=list(map(int,input().split()))
input_list = lambda : list(map(int,input().split()))

a,b=input_list()
ans=0
if a>12:
    ans=b
if 13>a and a>5:
    ans=b//2

print(ans)

Submission status: Accepted

Solution code:
A, B = list(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:
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())
print(b//(13//min(a+1, 14)+1)*min(1, a//6))

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

Submission status: Accepted

Solution code:
import itertools
import math
import fractions
import functools
import copy
a, b = map(int, input().split())
if a >= 13:
    print(b)
elif 6 <= a and 12 >= a:
    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 <= 5:
    print(0)
elif A >= 13:
    print(B)
else:
    print(int(B/2))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    inp=list(map(lambda x:int(x),input().split()))
    A=inp[0]
    B=inp[1]

    res=B
    if A>=6 and A<=12:
        res=res//2
    elif A<=5:
        res=0

    print(res)

if __name__=="__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))
# x = list(map(int, input().split()))
# abc = [int(input()) for i in range(5)]
# n = int(input())
# n, m = list(map(int, input().split()))
if a < 6:
    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:
    ans = b
elif a>5:
    ans = b//2
else:
    ans = 0
print(ans)

Submission status: Accepted

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    a, b = map(int, input().split())
    if a <= 5:
        ans = 0
    elif a <= 12:
        ans = b // 2
    else:
        ans = b
    print(ans)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

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

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
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

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

A,B  = inputIL()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


a, b = Is()

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

Submission status: Accepted

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


if __name__ == '__main__':

    ABC_127_A()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# A - Ferris Wheel

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def ferris_wheel(a, b):

    return b if 13<=a else int(b/2) if 6<= a<=12 else 0
def main():
    a, b = map(int, input().split())
    print(ferris_wheel(a, b))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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<=5:
    print(0)
else:
    print(B//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = 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:
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:
#!/usr/bin/env python3
# N = int(input())
# S = input()
A, B = map(int, input().split())
# A = 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 >= 13:
    print(b)
elif 5 < a < 13:
    print(b // 2)
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC127A

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

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
print( b if a >= 13 else int(b/2) if a < 13 and 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:
# coding: utf-8
# Your code here!
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 6<=a<13:
  print(b//2)
else:
  print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))

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

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