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: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Curtain
a, b = map(int, input().split())

result = a - 2 * b

if result <= 0:
    print(0)
else:
    print(result)

Submission status: Accepted

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

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

Submission status: Accepted

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

c=a-b*2

if c<=0:
    print(0)
else:
    print(c)

Submission status: Accepted

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

Submission status: Accepted

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

if ans < 0:
  ans = 0

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

else:
  print(0)

Submission status: Accepted

Solution code:
A,B=raw_input().split()

a = int(A)
b = int(B)

c = a - 2 * b

print 0 if c < 0 else c

Submission status: Accepted

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

Submission status: Accepted

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

print(max(0,all[0]-all[1]*2))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = a - b*2

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

Submission status: Accepted

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

if c>=0:
    print(c)
elif c<0:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

if __name__ == '__main__':
    A, B = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
i = input()
a = int(i.split(' ')[0])
b = int(i.split(' ')[1])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 19,Oct,2019
"""

import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

A, B = map(int, readline().split())
print(max(A-2*B, 0))

Submission status: Accepted

Solution code:
values = list(map(int, input().split()))
a = values[0]
b = values[1]

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

print(sub)

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
AB = input().split()
A = int(AB[0])
B = int(AB[1])
if A >= 2*B:
    print(A-(2*B))
else:
    print("0")

Submission status: Accepted

Solution code:
tmp = list(map(int, input().split()))
a = tmp[0]
b = tmp[1]

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

Submission status: Accepted

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

ans = max(0, a-2*b)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
input_number = [int(n) for n in input().split()]
ret = input_number[0]-(input_number[1]*2)
if ret < 0:
    print("0")
else:
    print(ret)

Submission status: Accepted

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

ans = 0
if B*2 >= A:
    ans = 0
else:
    ans = A - B*2

print(ans)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(int(1e6))

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

ans = A - 2 * B;
print(max(ans, 0))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num =input()
lst = num.split()
curtain = int(lst[1]) * 2
ans = int(lst[0]) - curtain

if(ans <= 0):
 print("0")
else:
 print("{}".format(ans))

Submission status: Accepted

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

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

gap = A - B * 2

if gap <= 0:
    print(0)
else:
    print(gap)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

diff = A - 2 * B

if(diff > 0):
  print(diff)
else:
  print("0")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = [int(x) for x in input().split()]
ans = max(0,A-2*B)
print(ans)

Submission status: Accepted

Solution code:
import sys
from collections import Counter, deque, defaultdict
from math import factorial
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

a, b = MAP()
b *= 2
print(max(a-b,0))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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: Accepted

Solution code:

a, b = (int(i) for i in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
ABInput = str(input())
 
AB = ABInput.split(" ")
 
A = int(AB[0])
B = int(AB[1])
 
TotalCartain = B * 2
 
if TotalCartain > A or TotalCartain == A:
  print (0)
else:
  print (A-TotalCartain)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

# In[1]:


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


# In[3]:


ans = max(0, A - B*2)
print(ans)


# In[ ]:

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    A, B = [int(n) for n in input().split()]
    print(max(A-2 * B, 0))
main()

Submission status: Accepted

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

ans = A - 2 * B

if ans < 0:
  print(0)
else:
  print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if a < b or a < 2*b:
  print 0
else:
  print a - 2*b

Submission status: Accepted

Solution code:
from sys import stdin
A, B = [int(x) for x in stdin.readline().rstrip().split()]
if A > 2*B:
  print(A - 2*B)
elif A <= 2*B:
  print(0)

Submission status: Accepted

Solution code:
def Curtain(A, B):
    rest = A - (B * 2)
    if rest > 0:
        return rest
    else:
        return 0

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

Submission status: Accepted

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

c = a - 2 *b

if c < 0:
    print(0)
else:
    print(c)

Submission status: Accepted

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

a = int(list[0])
b = int(list[1])

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

Submission status: Accepted

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

A = int(IN[0])
B = int(IN[1])
if A-2*B<=0:
    print(0)

else:
    print((A - (2*B)))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n ,m = map(int,input().split())
t = m*2
r = n-t
if r>=0:
  print(r)
else:
  print("0")

Submission status: Accepted

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

ans = 0
nokori = a - 2*b
if  nokori <= 0:
    ans = 0
else:
    ans = nokori

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve_a(a, b):
    res = max(0, a - 2 * b)
    return res


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


def test():
    assert solve_a(12, 4) == 4
    assert solve_a(20, 15) == 0
    assert solve_a(20, 30) == 0


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

Submission status: Accepted

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

    if a < (b * 2):
        print(0)
    else:
        print(a - (b * 2))
        
if __name__ == '__main__':
    answer()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
temp = input().split()
a = int(temp[0])
b = int(temp[1])

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

Solution code:
N = input().split()
a = int(N[0])
b = int(N[1])

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

Submission status: Accepted

Solution code:
import sys

a = list(map(int,input().split()))
b = 0
if a[0] <= 2*a[1]:
    print(b)
else:
    print(a[0]-2*a[1])

Submission status: Accepted

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

Submission status: Accepted

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

ans=a-b*2

if(ans<0):
    ans=0

print(ans)

Submission status: Accepted

Solution code:
import numpy as np

input_str = input()
input_list = input_str.split(" ")

# 長さを
window_length = int(input_list[0])
curtain_length = int(input_list[1])

# カーテンで隠れていない長さを計算する
not_covered_length = None

if window_length < curtain_length*2:
    not_covered_length = 0
else:
    not_covered_length = window_length - curtain_length*2

# 計算結果を出力
print(not_covered_length)

Submission status: Accepted

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


def solve(A: int, B: int):
    ans = max(0, A - (2 * B))
    print(ans)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

r = a-2*b

print(r) if r >=0 else print(0)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
A, B = map(int, input().split())
print('{}'.format(max(A-2*B, 0)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

w = a - (b*2)

if w <= 0:
  print(0)
else:
  print(w)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

# print(A)
# print(B)

result = A - (B * 2)

if result > 0:
    print(result)
else:
    print('0')

Submission status: Accepted

Solution code:
A, B = tuple(input().split(' '))
output = int(A) - (2 * int(B))
if output < 0:
    output = 0

print(output)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#import hoge
##################################################################
Input1 = [input() for i in range(1)]
A,B = list(map(int,Input1[0].split()))
ans = A-2*B
if ans < 0:
    ans = 0
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
a,b=list(map(int,input().split(' ')))
print(np.where(a-2*b>0,a-2*b,0))

Submission status: Accepted

Solution code:
s = input().split()
r= int(s[0]) - int(s[1]) * 2

#print(r)

if r > 0:
    print(r)
else:
    print(0)

Submission status: Accepted

Solution code:
numList = input().split()
windowWidth = int(numList[0])
curtainsWidth = int(numList[1]) * 2
uncovered = windowWidth -  curtainsWidth
# print(windowWidth)
# print(curtainsWidth)

if uncovered <= 0:
    print("0")
else:
    print(uncovered)

Submission status: Accepted

Solution code:
def inpl(): return list(map(int, input().split()))

A, B = inpl()
print(max(0, A-2*B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys

a,b = [ int(x) for x in sys.stdin.readline().strip().split() ]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = [int(_) for _ in input().split()]
print(max(A - 2 * B, 0))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def input(): return sys.stdin.readline().strip()


def main():
    A, B = map(int, input().split())
    ans = max(0, A - 2 * B)
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if l[0]<l[1]*2:
  print(0)
else:
  print(l[0]-l[1]*2)

Submission status: Accepted

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


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

Submission status: Accepted

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

if (int(b[0])-2*int(b[1]) >= 0):
  print(int(b[0])-2*int(b[1]))
else:
  print(0)

Submission status: Accepted

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

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

Submission status: Accepted

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

if c > 0:
  print(c)
else:
  print(0)

Submission status: Accepted

Solution code:

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

c=a-2*b

if c<0:
    c=0

print(c)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if A < answer:
    answer = 0
else:
    answer = A - answer

print(answer)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    width_of_window,width_of_cartain = map(int,input().split())
    print(cover_window(width_of_window,width_of_cartain))

def cover_window(width_of_window,width_of_cartain):
    if width_of_window <= width_of_cartain*2:
        return 0
    else:
        return width_of_window - width_of_cartain*2

main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

r1 = n1 - (n2 * 2)

if r1 < 0:
    r1 = 0

print(r1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A, B = map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

if A <= 2*B:
    ans = 0

else:
    ans = A-2*B

print(ans)

Submission status: Accepted

Solution code:
import math

i = input().split(" ")
# b = input()

a = i[0]
b = i[1]
r = max((int(a) - 2 * int(b)), 0)

print(r)

Submission status: Accepted

Solution code:
A,B = map (int,input().split())
_A = B * 2
ans = A - _A
if ans > 0 :
  print(ans)
elif ans <= 0 :
  print('0')

Submission status: Accepted

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



Blong = i[1]*2
Ans = i[0] - Blong

if Ans >= 0:
    print(Ans)
elif Ans < 0:
    print("0")

Submission status: Accepted

Solution code:
data = input().split(" ")

window = int(data[0])
curtain = int(data[1])

if curtain * 2 >= window:
    print(0)
else:
    print(window - curtain * 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 1行目の入力を空白で分割された数値として扱う
a, b = map(int, input().split())
 
# 数える
res = a - b * 2
if res < 0:
    res = 0
     
# 答えの出力
print(res)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
''' 
------------------------
author : iiou16
------------------------
'''

def main():
    A, B = list(map(int, input().split()))
    if A - 2*B > 0:
        print(A-2*B)
    else:
        print("0")

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def solve(A: int, B: int):
    print(max(0,A-2*B))
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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