Problem:


Score : 100 points

Problem Statement

The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)

We will close the window so as to minimize the total horizontal length of the uncovered part of the window.
Find the total horizontal length of the uncovered parts of the window then.

Constraints

1 \leq A \leq 100

1 \leq B \leq 100

A and B are integers.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the total horizontal length of the uncovered parts of the window.

Sample Input 1

12 4

Sample Output 1

4

We have a window with a horizontal length of 12, and two curtains, each of length 4, that cover both ends of the window, for example. The uncovered part has a horizontal length of 4.

Sample Input 2

20 15

Sample Output 2

0

If the window is completely covered, print 0.

Sample Input 3

20 30

Sample Output 3

0

Each curtain may be longer than the window.



Sample input:
12 4


Sample output:
4

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())
print(min(0, A-2*B))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
import numpy as np
print(np.abs(a - 2 * b))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(a - (2 * b))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(a - 2 * b)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(a - b * 2)

Submission status: Wrong Answer

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

b = b * 2

print(max(0, b - a))

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())
print(A-(2*B))

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print(a-2*b)

Submission status: Wrong Answer

Solution code:

def main():
    a, b = map(int, input().split())
    if a < b * 2:
        print(a - b * 2)
    else:
        print(0)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
A, B = list(map(int, input().split()))
print(A - B * 2)

Submission status: Wrong Answer

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

X=A-2*B

if X>=1:
    print(B)
    
else:
    print("0")

Submission status: Wrong Answer

Solution code:
a,b=[int(i) for i in input().split()]
c=(b*2)-a
if(c<0):
  c=a
print(a-c)

Submission status: Wrong Answer

Solution code:
a, b = map(int,input().split())
print(min(a-b*2,0))

Submission status: Wrong Answer

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

c=b+b
if(a-c!=0):
    print(a-c)
else:
    print(0)

#print(type(c))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
print(min(A-B-B,0))

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print(max(0,b-a*2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(a-2*b)

Submission status: Wrong Answer

Solution code:
a1=input()
a2=[i for i in a1.split()]
a3,a4=[a2[i] for i in (0,1)]
A,B=float(a3),float(a4)
v,v1=A.is_integer(),B.is_integer()
if 1<=(A and B)<=100 and A>2*B and v==v1==True:
    A,B=int(A),int(B)
    print(A-(2*B))
elif 1<=(A and B)<=100 and A<2*B and v==v1==True:
    A,B=int(A),int(B)
    print('0')

Submission status: Wrong Answer

Solution code:
a1=input()
a2=[i for i in a1.split()]
a3,a4=[a2[i] for i in (0,1)]
A,B=int(a3),int(a4)
if 1<=(A and B)<=100 and A>2*B:
    print(A-(2*B))
elif 1<=(A and B)<=100 and A<2*B:
    print('0')

Submission status: Wrong Answer

Solution code:
a1=input()
a2=[i for i in a1.split()]
a3,a4=[a2[i] for i in (0,1)]
A,B=int(a3),int(a4)
if A>2*B:
    print(A-(2*B))
elif A<2*B:
    print('0')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(min(0, A-B*2))

Submission status: Wrong Answer

Solution code:
# coding: utf-8
a, b = map(int, input().split())
ans = a - b * 2
if ans < 0:
    ams = 0
print(ans)

Submission status: Wrong Answer

Solution code:
a,b = map(int, raw_input().split(' '))
print max(0,b - (a << 1))

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())
print(A-B*2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if b >= a:
    print(0)
else:
    print(int((a-b)/2))

Submission status: Wrong Answer

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

print(min(0,a-(b*2)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(A - B * 2)

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())
print(max(b-2*a, 0))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(a - (b * 2))

Submission status: Wrong Answer

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

print(min(0,a-2*b))

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print(a - 2 * b)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(max(0,2*b-a))

Submission status: Wrong Answer

Solution code:
A,B = map(int, input().split())
print(A - 2*B)

Submission status: Wrong Answer

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

ans = A - B*2

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a < (b * 2):
    print(0)
elif a > (b*2):
    print(a-(b*2))

Submission status: Wrong Answer

Solution code:
# N=int(input())
A,B=[int(x) for x in input().rstrip().split()]

if A<=B*2:
  print(0)
else:
  print(B*2-A)

Submission status: Wrong Answer

Solution code:
w,c = map(int,input().split())

res = w-c+c
if res < 0:
  res =0
print(res)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if 1<= a <=9 or 1<= b <=9:
    print(b)
else:
    print(0)

Submission status: Wrong Answer

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

if a >= b:
  print(a - b * 2)
else:
  print(0)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(int,input().split())
print(a-b*2)

Submission status: Wrong Answer

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

if (a-b*2)>0:
  print(int(b*2-a))
else:
  print(0)

Submission status: Wrong Answer

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

if (b*2-a)>0:
  print(int(b*2-a))
else:
  print(0)

Submission status: Wrong Answer

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

print(int(b*2-a))

Submission status: Wrong Answer

Solution code:
base = input().split()
a = int(base[0])
b = int(base[1])
if a>b*2:
    print(a-b*2)
else:
    print(a)

Submission status: Wrong Answer

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  a, b = map(int, readline().split())
  print(a-b*2)
  
  
if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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

if 2*b-a<0:
  print(0)
else:
  print(2*b-a)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
B=b*2
if a<B:
  print(a-B)
else:
  print('0')

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
num = (b*2)-a
if num < 0:
  num = 0
print(num)

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())
ans = a - b + b
if ans <= 0:
  print(0)
else:
  print(ans)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(a-2*b)

Submission status: Wrong Answer

Solution code:

def pin(type=int):
    return map(type,input().rstrip().split())
A,B=pin()
ans=0 if A-B*2<0 else A-B*2
print(A-B*2)

Submission status: Wrong Answer

Solution code:
a,b = input().split()
a = int(a)
b = int(b)
print(a - (b * 2))

Submission status: Wrong Answer

Solution code:
a, b = input().split()
print(max(0, int(b) - 2*int(a)))

Submission status: Wrong Answer

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

print(min(a-2*b,0))

Submission status: Wrong Answer

Solution code:
a,b=(map(int,input().split()))
c=0
if a<b:
  print(0)
elif a>b:
  c=a-b*2
  if c>0:
    print(c)
  elif c<=0:
    print(0)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(int(a - 2 * b))

Submission status: Wrong Answer

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

if a > 2 *b:
    print(0)
else:
    print(a-2*b)

Submission status: Wrong Answer

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

if a > 2 *b:
    print(0)
else:
    print(2*b-a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(str(2*b-a))

Submission status: Wrong Answer

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

if 2 * B < A:
  answer = 2 * B - A
  print(answer)
else:
  print(0)

Submission status: Wrong Answer

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

if A < B*2:
    print(0)

elif A > B*2:
    print(A-B*2)

Submission status: Wrong Answer

Solution code:
def run_length(s) -> list:
    res = [[s[0], 1]]
    for i in range(1, len(s)):
        if res[-1][0] == s[i]:
            res[-1][1] += 1
        else:
            res.append([s[i], 1])
    return res

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())
print(A-2*B)

Submission status: Wrong Answer

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

if A > 2*B:
  print(B)
else:
  print(0)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(a-(2*b))

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(a-2*b)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(2*a-b)

Submission status: Wrong Answer

Solution code:
# ランレングス圧縮
def run_length(s) -> list:
  res = [[s[0], 1]]
  for i in range(1, len(s)):
    if res[-1][0] == s[i]:
      res[-1][1] += 1
    else:
      res.append([s[i], 1])
  return res

# 文字列
# RL = run_length("11222211334")
# print(RL)
# 出力: [['1', 2], ['2', 4], ['1', 2], ['3', 2], ['4', 1]]

# 配列
# RL = run_length([1, 1, 2, 2, 2, 2, 1, 1, 3, 3, 4])
# print(RL)
# 出力: [[1, 2], [2, 4], [1, 2], [3, 2], [4, 1]]

Submission status: Wrong Answer

Solution code:
# ランレングス圧縮
def run_length(s) -> list:
  res = [[s[0], 1]]
  for i in range(1, len(s)):
    if res[-1][0] == s[i]:
      res[-1][1] += 1
    else:
      res.append([s[i], 1])
  return res

# RL = run_length("aabbbbaaca")
# print(RL)
# 出力: [['a', 2], ['b', 4], ['a', 2], ['c', 1], ['a', 1]]

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# ランレングス圧縮
def run_length(s) -> list:
  res = [[s[0], 1]]
  for i in range(1, len(s)):
    if res[-1][0] == s[i]:
      res[-1][1] += 1
    else:
      res.append([s[i], 1])
  return res

# print(run_length("aabbbbaaca"))
# 出力: [['a', 2], ['b', 4], ['a', 2], ['c', 1], ['a', 1]]

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = map (int, input().split())
print(A-2*B)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print(a-b*2)

Submission status: Wrong Answer

Solution code:
def LI():
  return [int(s) for s in input().split()]
 
A,B = LI()
 
print(int(A-2*B)) if A < 2*B else print(0)

Submission status: Wrong Answer

Solution code:
def LI():
  return [int(s) for s in input().split()]
 
A,B = LI()
 
print(int(A-2*B)) if A < 2*B else 0

Submission status: Wrong Answer

Solution code:
def LI():
  return [int(s) for s in input().split()]
 
A,B = LI()
 
print(int(A-2*B)) if A > 2*B else 0

Submission status: Wrong Answer

Solution code:
def LI():
  return [int(s) for s in input().split()]

A,B = LI()

print(A-2*B) if A > 2*B else 0

Submission status: Wrong Answer

Solution code:
ns = input().split(" ")
a = int(ns[0])
b = int(ns[1])
if a - 2 * b >> 0:
  print(a - 2 * b)
else:
  print(0)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(a-2*b)

Submission status: Wrong Answer

Solution code:
A,B = map(int, input().split())
print(A-2*B if (A-2*B) < 0 else 0)

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
print(A-2*B)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a>9 or b>9:
    print(-1)
else:
    print(a*b)

Submission status: Wrong Answer

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

print(A-2*B)

Submission status: Wrong Answer

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

print(a-2*b)

Submission status: Wrong Answer

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from functools import reduce
import numpy as np

INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007

#入力こっちの方が10倍早い
#import sys
input = sys.stdin.readline

# mainをかく
A,B=LI()
if A<B:
    print(0)
    exit()
if A-B*2>0:
    print(A-B*2)
elif A-B*2<0:
    print(0)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
print(A-B*2)

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())
C=A-B*2
print(C)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(min([0,a-2*b]))

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(max(0,2*a-b))

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())
print(A-2*B)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a<=b*2:
  print(0)
else:
  print((a-b*2)*0.5)

Submission status: Wrong Answer

Solution code:
A, B = map( int, input().split() )
print( A - 2 * B )

Submission status: Wrong Answer

Solution code:
A = list(map(int, input().split()))
ans = A[0]-A[1]*2
print(ans)

Submission status: Wrong Answer

Solution code:
a, b = map(int,input().split())
if a >= b:
  print(a - (b * 2))

elif  a <= b * 2:
  print("0")

else:
  print("0")

Submission status: Wrong Answer

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

ans=a-b-b

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=list(map(int, input().split()))
if a>=(2*b):
  print(0)
else:
  print(a-(2*b))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
s = a - b
if s >= 0:
  print(s)
else:
  print("0")

Submission status: Wrong Answer

Solution code:
A,B=map(int, input().split())
print(0 if B<A*2 else B-A*2)

Submission status: Wrong Answer

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

print(a - 2 * b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

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

    if(A<=2*B):
        print('0')

    else:
        print(A-B*B)

main()

Submission status: Wrong Answer

Solution code:
import sys

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

    if(A<=B*B):
        print('0')

    else:
        print(A-B*B)

main()

Submission status: Wrong Answer

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

print(int(a) - int(b) * 2)

Submission status: Wrong Answer

Solution code:
s = input()
checks = s[0]
ans = 1
for c in list(s):
  if c != checks:
    checks = c
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
A,B=input().split()
print(int(A)-int(B)*2)

Submission status: Wrong Answer

Solution code:
input_list = list(map(int, input().split()))
a = input_list[0]
b = input_list[1]
if a >= b*2:
    print(a-b*2)
else:
    print(9)

Submission status: Wrong Answer

Solution code:
A,B = map(int, input().split())
print(min(0, A - B * 2))

Submission status: Wrong Answer

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

if a <= b:
  print(0)
else:
  print(a-2*b)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a<b:
    a,b=b,a
c=max(0,a-2*b)
print(c)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a>b:
    a,b=b,a
c=max(0,a-2*b)
print(c)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split(" "))
length = A - B * 2
print(length)

Submission status: Wrong Answer

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

#隠される範囲
B_2 = B*2

if A - B_2 == 0:
    print(0)
else:
    print(A - B_2)

Submission status: Wrong Answer

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

#隠される範囲
B_2 = B*2

print(A-B_2)

Submission status: Wrong Answer

Solution code:
a,b =(int(x) for x in input().split())
c=2*a-b
if c>=0:
  print(c)
else:
  print(0)

Submission status: Wrong Answer

Solution code:
a,b =(int(i) for i in input().split())
print(a - (b*2))

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())
if A<=2*B:
  print(0)
else:
  print(2*B-A)

Submission status: Wrong Answer

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

if a>=2*b:
  print(0)
else:
  print(a-2*b)

Submission status: Wrong Answer

Solution code:
def main():
    A, B = list(map(int, input().split()))
    print(min(A - 2 * B, 0))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N = 7
L = [218, 786, 704, 233, 645, 728, 389]

from itertools import combinations

cb = list(combinations(L, 3))

my_lambda = lambda x : x[0] + x[1] > x[2] and x[1] + x[2] > x[0] and x[0] + x[2] > x[1]

print(sum(
        list(
            map(my_lambda, cb)
        )
    )
)

Submission status: Wrong Answer

Solution code:
### A - Curtain ###
A, B = map(int, input().split())
A-B*2 if A-B*2 < 0 else 0
print(A-B*2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(a - b * 2)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(min(0, a-b*2))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(min(0, a-2*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a <= 2 * b:
	print('O')
else:
	c = a - 2 * b
	print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
print(A - B*2)

Submission status: Wrong Answer

Solution code:
A,B=input().split()
a=int(A)
b=int(B)
c=a*b
if a>c:
  x=a-c
else:
  x=0
print(x)

Submission status: Wrong Answer

Solution code:
A, B = list(map(int,input().split()))
print(str(max(0,B - A * 2)))

Submission status: Wrong Answer

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

if b*2 >= a:
    print(0)
else:
    print(b*2 - a)

Submission status: Wrong Answer

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

if b*2 > a:
    print(0)
else:
    print(b*2 - a)

Submission status: Wrong Answer

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

if b*2 > a:
    print(0)
else:
    print(b*2 - a)

Submission status: Wrong Answer

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

if a<b:
    print(a-b)
elif a > b:
    print(0)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())
 
if a<b:
    print(a-b)
elif a > b:
    print(0)

Submission status: Wrong Answer

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

C = int(A) - int(B) * 2

if C < 0:
    print(0)
elif C > 100:
    print(100)
else:
    print(C)

Submission status: Wrong Answer

Solution code:
n,m = list(map(int,input().split()))
if 0 < n < 10 and 0 < m < 10 :
  print(n*m)
else :
  print(-1)

Submission status: Wrong Answer

Solution code:
a, b = input().split()
print(min(0, int(a) - int(b) * 2))

Submission status: Wrong Answer

Solution code:
x,y = map(int,input().split())	
  
print(x-(y*2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(a-b if a-b>0 else 0)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
if a - (b*2) > 0:
  print(a - (b*2))
print(0)

Submission status: Wrong Answer

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

if(A>B*2):
  aaa=A*B
  print(aaa)
else:
  print(0)

Submission status: Wrong Answer

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

x = A - 2 * B

print(x)

Submission status: Wrong Answer

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

print(A-2*B)

Submission status: Wrong Answer

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

if A-B<0:
    print(0)
else:
    print(A - 2*B)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
print(abs(A - 2*B))

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a*b % 2 == 0:
  print('Even')
else:
  print('Odd')

Submission status: Wrong Answer

Solution code:
a, b=map(int, input().split())
print(a-2*b)

Submission status: Wrong Answer

Solution code:
a=input().rstrip().split()
print(a)

Submission status: Wrong Answer

Solution code:
def resolve():
    n = int(input())

    targets = input()
    ans = 1

    for i in range(len(targets)-1):
        if targets[i] == targets[i+1]:
            pass
        else:
            ans += 1

    print(ans)
#resolve()

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
result = a - (b*2)
if a > 0:
    print(result)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split(" "))
if b * 2 >= a:
  print(0)
else:
  print(b*2 - a)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print(max(0,(a-2)))

Submission status: Wrong Answer

Solution code:
A,B= map(int,input().split(" "))
result = A - 2*B
print(result)

Submission status: Wrong Answer

Solution code:
def main():
    a, b = map(int, input().split())
    ans = min(a - 2 * b, 0)
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
c = b*2 - a
if c > 0:
    print(0)
else:
    print(c)

Submission status: Wrong Answer

Solution code:
A,B = map(int, input().split())
print(min(0, A-2*B))

Submission status: Wrong Answer

Solution code:
import fileinput

def process(A, B):
    print(A, B)
    if A <= B*2:
        return 0
    else:
        return A - B*2

for line in fileinput.input():
    print(line.split())
    print(process(*map(int, line.split())))

Submission status: Wrong Answer

Solution code:
print(eval('min('+input().replace(' ','-2*')+',0)'))

Submission status: Wrong Answer

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

if A <= 2 * B:
  print(0)
  
else:
  print(2*B - A)

Submission status: Wrong Answer

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

if a - b > 0:
    print(a - b)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
a,b=map(lambda x:int(x),input().split())
x=max(b-a*2,0)
print(x)

Submission status: Wrong Answer

Solution code:
a,b=map(lambda x:int(x),input().split())
x=max(a*2-b,0)
print(x)

Submission status: Wrong Answer

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

print(A-2*B)

Submission status: Wrong Answer

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

print(a-b*2)

Submission status: Wrong Answer

Solution code:
def cartain(a,b):
  if 2*b >= a:
    return 0
  elif a > 2*b:
    return a-2*b

Submission status: Wrong Answer

Solution code:
# print(input().split(" "))
a,b=map(int, input().split())
# print("a:", a, "b:", b)
answer=a-2*b
# print(answer)
if(answer < 0):
    print(0)
else:answer

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
c = b * 2 - a
ans = 0 if c < 0 else min(c, 0)
print(ans)

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())
C=A-2*B
if C>0:
    uncovered = C
else:
    uncovered = 0
print('the lenth of unvocered =',uncovered)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
res = max(0, a - b*2)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a - a*b >= 0:
  print(a-2*b)
else:
  print("0")

Submission status: Wrong Answer

Solution code:
a, b = [int(x) for x in input().split()]
ans = a - 2*b

if(ans < 0):
		ans=99

print(ans)

Submission status: Wrong Answer

Solution code:
0

Submission status: Wrong Answer

Solution code:
A, B = map(int,input().split())
max(A - B * 2 , 0)

Submission status: Wrong Answer

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

print(a - b*2 if a-2*b < 0 else 0)

Submission status: Wrong Answer

Solution code:
from sys import stdin
input = stdin.readline
lmi = lambda: list(map(int, input().split()))
mi = lambda: map(int, input().split())

a, b = mi()
print(a-b*2)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
ans = 0
tmp = 0
if A > (2 * B):
    tmp = A - (2 * B)
else:
    tmp = B - A

if 0 < tmp:
    ans = tmp
print(ans)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
ans = 0
tmp = 0
if A > B:
    tmp = A - (2 * B)
else:
    tmp = B - (2 * A)

if 0 < tmp:
    ans = tmp
print(ans)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if (b*2)>a:
  print(a-(b*2))
else:
  print("0")

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if (b*2)>=a:
  print(a-(b*2))
else:
  print("0")

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())
print(max(0, 2*b-a))

Submission status: Wrong Answer

Solution code:
s=list(map(int,input().split()))
a=int(s[1])
b=0
if a*a>=s[0]:
  print(0)
else:
  print(s[0]-a*a)

Submission status: Wrong Answer

Solution code:
n,k=map(int, input().split())
if n==k:
	print(k)
elif k<=1:
	print(k)
else:
	a=(n-k)//(k-1)
	b=0
	for c in range(0,a+1):
		b+=n-k-(k-1)*c+1
	print(b)

Submission status: Wrong Answer

Solution code:
wsize,csize=[int(x) for x in input().split()]
widthconsumed=csize*2
result=wsize-widthconsumed
if result>csize:
    print(result)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
a,b=input().split()
a=int(a)
b=int(b)
c=b-2*a
if c<=0:
    print(0)
else:
    print(c)

Submission status: Wrong Answer

Solution code:
a, b= map(int, input().split())
if a<=2*b:
	print('0')
else:
	print('a-2*b')

Submission status: Wrong Answer

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

if b >= a:
  print(0)
else:
  print(a-b)

Submission status: Wrong Answer

Solution code:
total,l=map(int,input().split(' '))
print(total-2*l)

Submission status: Wrong Answer

Solution code:
import sys
a, b = map(int, input().split())
bb = b * 2

if a < b:
	print(0)
elif a > b and a < bb:
	print(0)
else:
	print(a - bb)

Submission status: Wrong Answer

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

r = a[0] - a[1]
if r <= 0:
  print(0)
r = r - a[1]
if r <= 0:
  print(0)
else:
  print(r)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split(" "))
if a > 2*b :
    print(a-2*b)
print(0)

Submission status: Wrong Answer

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

ans=2*B-A
if ans<0:
    print(0)
else:
    print(ans)

Submission status: Wrong Answer

Solution code:
wsize,csize=[int(x) for x in input().split()]
widthconsumed=csize*2
result=wsize-widthconsumed
if result>=csize:
    print(result)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
num_a = 12
num_b = 4
dif = num_a - num_b*2
if dif >= 0:
  print(dif)
else:
  print(0)

Submission status: Wrong Answer

Solution code:
inpl = lambda: list(map(int,input().split()))
A, B = inpl()
if B*2 >= A:
    print(0)
else:
    print(B*2-A)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
if A -B*2 < -1:
    print(0)
else:
    print(A-B*2)

Submission status: Wrong Answer

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

if A >= B*2:
    print(0)
else:
    print(A-B*2)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
                                
A =a                            
B =b    
        
C = A - B*2
print(C)

Submission status: Wrong Answer

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

c=a-2*b

print(c)

Submission status: Wrong Answer

Solution code:
wsize,csize=[int(x) for x in input().split()]
widthconsumed=csize*2
result=wsize-widthconsumed
if result>=csize:
    print(result)
else:
    print(0)

Submission status: Wrong Answer

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

if A-B*2 >= B*2:
    print(A-B*2)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
c = b * 2 - a
print(c if 0 <= c else 0)

Submission status: Wrong Answer

Solution code:
i = input()
ar = i.split()
print(max(int(ar[0])-int(2*ar[1]), 0))