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:
#143
a, b = map(int, input().split())
print(max(0, a-2*b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
inputStr = input().split()
A = int(inputStr[0])
B = int(inputStr[1])

if (A-(B * 2)) < 0:
    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:
a,b=map(int,input().split())

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

Submission status: Accepted

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

# Input
i = list(map(int, input().split()))

# Process
X = i[0] - i[1]*2

# Output
if X > 0:
    print(X)
else:
    print(0)

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-



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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#import pysnooper
#import numpy
#import os,re,sys,operator
#from collections import Counter,deque
#from operator import itemgetter
#from itertools import accumulate,combinations,groupby,combinations_with_replacement,permutations
from sys import stdin,setrecursionlimit
#from copy import deepcopy
#import heapq
#import math
#import string

setrecursionlimit(10**6)
input=stdin.readline

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())
ans = A-2*B
if ans > 0:
    print(ans)
else:
    print(0)

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:
entry = list(map(int, input().split()))
if entry[0] <= entry[1] * 2:
  print(0)
else:
  print(entry[0] - entry[1] * 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

else:
  print(0)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

answer = a - 2 * b

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    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, b = input().split()
a, b = int(a), int(b)
x = a - b - b
if (x < 0):
  print(0)
else:
  print(x)

Submission status: Accepted

Solution code:
from sys import stdin

A,B = list(map(int,stdin.readline().strip().split()))

ans = A-B*2

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

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

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

Submission status: Accepted

Solution code:
data = input().rstrip().split()
Win = int(data[0])
Car = int(data[1])

Res = Win - Car*2

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

Submission status: Accepted

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

horizontal_length = b * 2

uncovered_part = a - horizontal_length

if uncovered_part < 0:
  uncovered_part = 0
  
print(str(uncovered_part))

Submission status: Accepted

Solution code:
from sys import stdin


def fin(f):
    return f(input())


def gin(f, n=1):
    for _ in range(n):
        yield list(map(f, stdin.readline().split()))


a, b = next(gin(int))

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

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

Submission status: Accepted

Solution code:
from sys import exit, stdin
A, B = [int(_) for _ in stdin.readline().rstrip().split()]
print(max(0, A-B*2))

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
ans = A - 2*B
if ans >= 0:
  print(ans)
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)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
 
a,b = map(int, input().split())
 
kai = a - (2 * b)

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

Submission status: Accepted

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

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:
values = input()
x = values.split()[0]
y = values.split()[1]

if int(x) <= (2*int(y)):
  print(0)
else:
  print(int(x) - (2*int(y)))

Submission status: Accepted

Solution code:
print(max(0,eval(input().replace(" ","-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:
print(eval('max(0,'+input().replace(' ','-2*')+')'))

Submission status: Accepted

Solution code:
Window, Cartain = map(int, input().split())

if(Window > Cartain * 2):
    print(Window - Cartain * 2)
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:
A,B=map(int,input().split())
C=A-2*B
if C>0:
    uncovered = C
else:
    uncovered = 0
print(uncovered)

Submission status: Accepted

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

r = A-2*B

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

Submission status: Accepted

Solution code:
def solve(a, b):
    return max(0, a - 2*b)
    
a, b = map(int, input().split())
print(solve(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())
if b*2>=a:
  print('0')
else:
  print(a-(b*2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))
print(max(a-b*2,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())
res = max(0, a - b*2)
print(res)

Submission status: Accepted

Solution code:
N,M= (int(i) for i in input().split())
a=N-2*M
print(a if a>0 else 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,m = map(int,input().split())

print(n-2*m if n-2*m>= 0 else 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 b*2 >= a:
    print(0)
else:
    print(a-b*2)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


def solve(A: int, B: int):
    ret = A - B * 2
    ret = max(ret, 0)
    print(ret)
    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 ,raw_input().split())
print max(0,a-2*b)

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:
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 - 2 * B < 0 or A-2*B == 0:
    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())
ans = a-2*b
if ans <= 0:
  print(0)
else:
  print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

if(ans < 0):
		ans=0

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def main():
    A,B = map(int,input().split())
    C = A-(B*2)
    if C < 0:
        C = 0
    print(C)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

window, curtain = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = [int(x) for x 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())
print(A - B * 2 if A - B * 2 > 0 else 0)

Submission status: Accepted

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

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

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:
a, b = [int(x) for x in input().split()]
print(max(0, a - 2 * b))

Submission status: Accepted

Solution code:
# coding: utf-8

def main():
    a, b = input().split()
    a, b = int(a), int(b)

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(0) if c < 0 else 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:
import unittest
from io import StringIO
import sys


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


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


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """12 4"""
        output = """4"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """20 15"""
        output = """0"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """20 30"""
        output = """0"""
        self.assertIO(input, output)


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

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 < B * 2:
    C = 0
else:
	C = A - B * 2
	
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:
x,y = map(int,input().split())	
if x>2*y:
  print(x-2*y)
else:
  print(0)

Submission status: Accepted

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

w = 0

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

else:
    w = a-2*b
    print(w)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
'''A - Curtain
https://atcoder.jp/contests/abc143/tasks/abc143_a

>>> main(12, 4)
4
>>> main(20, 15)
0
>>> main(20, 30)
0

'''


def main(a, b):
    print(max(0, a - b*2))


if __name__ == "__main__":
    a, b = map(int, input().split(' '))
    main(a, b)

Submission status: Accepted

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

Submission status: Accepted

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

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())
C=A-2*B
if C<0:
    print(0)
else:
    print(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:
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())
# a : window width
# b : curtain width

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
#import math
#import time
#import random  # randome is not available at Codeforces
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def StoI():
    return [ord(i)-97 for i in input()]
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
#eps=10**(-10)
#ts=time.time()
#sys.setrecursionlimit(10**6)
input=lambda: sys.stdin.readline().rstrip()

show_flg=False
show_flg=True

a,b=MI()
print(max(0,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:
#abc143a

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

Submission status: Accepted

Solution code:
n, k = map(int, input().split())

k = k*2
ans = n - k
if ans < 0:
    print(0)
else:
    print(ans)

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().split())
print(a -2*b) if a-2*b > 0 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)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    window,cartain=map(int,input().split())
    cartains=cartain*2
    if window-cartains<0:
        ans = 0
    else:
        ans = window-cartains
    print(ans)

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:
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-b-b]))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#n=int(input())
a,b=map(int,input().split())
#n,k=map(int,input().split())
#H=list(map(int,input().split()))
c=a-2*b
print(max(c,0))

Submission status: Accepted

Solution code:
a,b =[int(i) for i in 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())
ans = max(0, a-b*2)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    a,b = LI()

    return max(0,a-b*2)


print(main())

Submission status: Accepted

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

if __name__ == '__main__':
    main()

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

class Solution(object):
    def __init__(self):
        a = sys.stdin.readline().split()
        if len(a) != 2: return
        self.A = int(a[0])
        self.B = int(a[1])

    def get_open_window(self):
        if 2*self.B >= self.A:
            return 0
        return self.A - (2*self.B)

if __name__ == "__main__":
    s = Solution()
    print(s.get_open_window())

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

[a, b] = map(int, input().split())
out = a - 2 * b if a - 2 * b > 0 else 0
print(out)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC143A - Curtain
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 = [int(x) for x in input().split()]
print(max(0, A - B*2))

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:
import sys
from collections import defaultdict, deque
from heapq import *
sys.setrecursionlimit(200000)
input = sys.stdin.readline

N, M, = map(int, input().split())
# N = int(input())
# L = [int(v) for v in input().split()]
# L = [[int(v) for v in input().split()] for _ in range(N)]
# L = [int(input()) for _ in range(N)]
# L = [list(input().strip())  for _ in range(N)]
# S = input().strip()

s = N - M * 2
if s < 0:
    print(0)
else:
    print(s)

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())
print(max(0, a - (2*b)))

Submission status: Accepted

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

Submission status: Accepted

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(max(0, a-(b*2)))

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] = [int(i) for i in input().split()]
print(max(a-2*b,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:
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())

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

Submission status: Accepted

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

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

res = 0
if h < c :
    print(res)
else:
    h-=2*c
    if h>=0 :
        res = h 
    print(res)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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())
if (b*2)<=a:
  print(a-(b*2))
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:
temp = input().split()
an = int(temp[0])-2*int(temp[1])
if an <= 0:
  print(0)
else:
  print(an)

Submission status: Accepted

Solution code:
length = [int(i) for i in input().split()]
if length[0] >= length[1]*2:
  print(length[0]-length[1]*2)
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 = map(int, input().split())


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

Submission status: Accepted

Solution code:
import copy

def j(n):
    if n:print("yes")
    else:print("no")
    exit(0)
rem = 10 ** 9 + 7

"""
def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")
"""

def ip():
    return int(input())
def iprow():
    return [int(i) for i in input().split()]
def ips():
    return (int(i) for i in input().split())
def ipmultiplerow(n):
    a = []
    for i in range(n):
        a.append(ip())
    return a
def printrow(a):
    for i in a:
        print(i)

a,b = ips()

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

Submission status: Accepted

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

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) else a-(2*b))

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(" "))
L = a - 2 * b
if L < 0:
  L = 0
print(L)

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())
ans = A - B * 2
if ans < 0:
  ans = 0
print(ans)