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:
A, B = map(int, input().split(' '))
C = A - 2 * B
D = max([C, 0])
print(D)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if result <= 0:
  result = 0

print(result)

Submission status: Accepted

Solution code:
A, B = (int(i) for i in input().split())
if A<=B*2:
	print(0)
else:
	print(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:
win,wid = map(int,input().split())
if win <= wid*2:
  print(0)
else:
  print(win-wid*2)

Submission status: Accepted

Solution code:
_a, _b = map(int, input().split())

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


hoge(_a, _b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.readline
# readlines = sys.stdin.readlines
A, B = map(int,readline().split())

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

Submission status: Accepted

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

if (curtain_width * 2) > total_width:
    print(0)
else:
    print(total_width - curtain_width * 2)

Submission status: Accepted

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

Submission status: Accepted

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

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

# solve & output
print(max(0, A - B * 2))

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
c = a-b*2
if c<0:
    c = 0
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:
from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac
import bisect
import sys
input = sys.stdin.readline

setrecursionlimit(1000000)

dp = defaultdict(lambda x:-1)

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

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(l):
	x = l.pop()
	y = l.pop()
	while(x%y!=0):
		z = x%y
		x = y
		y = z
	l.append(min(x,y))
	return gcd(l) if len(l) > 1 else l[0]

class Queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class Stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

main()

Submission status: Accepted

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

print(max(0,ans))

Submission status: Accepted

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

Submission status: Accepted

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

x = A - 2 * B
print(max(x , 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:
# coding: utf-8


def solve(*args: str) -> str:
    a, b = map(int, args[0].split())
    return str(max(a-(2*b), 0))


if __name__ == "__main__":
    print(solve(*[input() for _ in range(1)]))

Submission status: Accepted

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


if a <= b:
    print(0)
elif a <= 2*b:
    print(0)
else:
    print(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())
ans = max (0, a - b*2)
print(ans)

Submission status: Accepted

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

s = B * 2
i = A - B * 2

if s < A:
  print(i)
else:
  print(0)

Submission status: Accepted

Solution code:
N=input()
N=N.split()
N=[int(item) for item in N]
A=N[0]
B=N[1]
ans=A-B*2
if ans<0:
    ans=0
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


k = AB[0] - AB[1]*2

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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 -*-

import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        # for line in sys.stdin:
        #     lines.append(line)
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    (a, b) = [int(e) for e in lines[0].split(" ")]

    return (a, b)


def solve(a, b):

    return max(a - 2 * b, 0)


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Submission status: Accepted

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

length = int(A) - int(B)*2
if length < 0:
  length = 0

print(length)

Submission status: Accepted

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

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

Submission status: Accepted

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

len=A-B*2

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

Submission status: Accepted

Solution code:
import sys
n = list(map(int, input().split()))
result = n[0] - n[1] * 2
if result < 0:
  print(0)
  quit()

print(result)

Submission status: Accepted

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

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

b = b*2

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if A < 2*B:
    print(0)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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())
L=A-2*B
if L<0:
  L=0
print(L)

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, raw_input().split())
res = A - 2*B
if res <= 0:
        res = 0
print(res)

Submission status: Accepted

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

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

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

ans = 0
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(0)
else:
  print(C)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
A, B = map(int, input().split())
C = A - 2*B
# 出力
if(C >= 0):
    print("{}".format(C))
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 = 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())
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:
	c=a-2*b
	print(c)
else:
	print(0)

Submission status: Accepted

Solution code:
ABlow = input().split()
#print(type(int(ABlow[1])))
A = int(ABlow[0])
B = int(ABlow[1])

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

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

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

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

Submission status: Accepted

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

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())
def curtain(a,b):
    l = a - 2 * b
    if l > 0:
        return l
    else:
        return 0
print(curtain(A,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())
ans=a-b*2
if ans>0:
	print(ans)
else:
	print('0')

Submission status: Accepted

Solution code:
from sys import stdin
 
lines = stdin.readlines()
 
A,B = map(int, lines[0].split())

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def solve(a, b):
    ans = a - 2 * b
    if ans < 0:
        return 0

    return ans


if __name__ == "__main__":
    raw = input()
    a, b = raw.split(' ')
    a, b = int(a), int(b)
    print(solve(a, b))

Submission status: Accepted

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

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

an = a - b*2

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

c = a - b * 2
if c < 0:
    c = 0;

print(c)

Submission status: Accepted

Solution code:
def A():
    temp = [int(i) for i in input().split()]
    print(max(0, temp[0]-2*temp[1]))

A()

Submission status: Accepted

Solution code:
import sys


def main():
    a, b = [int(s) for s in sys.stdin.readline().strip().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:
import sys

def main():

	args = sys.argv
	A,B = (int(i) for i in input().split())
	
	if A > B*2 :
		print(A-B*2)
	else:
		print(0)
	

if __name__ == "__main__":
    main()

Submission status: Accepted

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

x = m * 2
y = n - x

if (y < 0):
    y = 0

print(y)

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:
XXX = input()

A = int(XXX.split(" ")[0])
B = int(XXX.split(" ")[1])

out = max(0, A - B * 2)

print(out)

Submission status: Accepted

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

ans = a-2*b
if ans<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 = list(map(int,input().split()))
k = max(0,a-2*b)
print(k)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
inputs = sys.stdin.readlines()
A, B = map(int, inputs[0].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:
        ans = A-2*B
else:
        ans = 0
print(str(ans))

Submission status: Accepted

Solution code:
a,b = list(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 > 0:
  print(A-2*B)
else:
  print(0)

Submission status: Accepted

Solution code:
# coding:utf-8

A, B = input().split(" ")

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

    return max(0, A - 2 * B)

if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3

import array
import math
import os
import sys


def main():
    A, B = read_ints()
    print(max(0, A - 2 * B))


DEBUG = 'DEBUG' in os.environ


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


def read_int():
    return int(inp())


def read_ints():
    return [int(e) for e in inp().split()]


def dprint(*value, sep=' ', end='\n'):
    if DEBUG:
        print(*value, sep=sep, end=end)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from enum import Enum
from queue import Queue
import collections

import sys
import math

BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001

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

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

Submission status: Accepted

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

Submission status: Accepted

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

out = A - B * 2

if out < 0:
    out = 0

print(out)

Submission status: Accepted

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

Submission status: Accepted

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

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

C = B * 2

if A<C:
  print(0)
else:
  D = A - C
  print(D)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#input
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 = [int(i) for i in input().split()]
if 2*b>=a:
    print(0)
else:
    print(a-2*b)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# 入力が10**5とかになったときに100ms程度早い
import sys
read = sys.stdin.readline


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_matrix(H):
    '''
    H is number of rows
    '''
    return [list(map(int, read().split())) for _ in range(H)]


def read_map(H):
    '''
    H is number of rows
    文字列で与えられた盤面を読み取る用
    '''
    return [read()[:-1] for _ in range(H)]


def read_col(H, n_cols):
    '''
    H is number of rows
    n_cols is number of cols

    A列、B列が与えられるようなとき
    '''
    ret = [[] for _ in range(n_cols)]
    for _ in range(H):
        tmp = list(map(int, read().split()))
        for col in range(n_cols):
            ret[col].append(tmp[col])

    return ret


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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


def solve(A: int, B: int):
    if A <= 2 * B:
        print(0)
    else:
        print(A - 2 * B)
    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:
# -*- coding: utf-8 -*-
#ABC143A
import sys
import math
import collections
#sys.setrecursionlimit(100000)


#n=int(input())

tmp = input().split()
a,b = list(map(lambda a: int(a), tmp))



sum = a
sum -=b
sum -=b
if (sum<0):
	sum=0


print(sum)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
A, B = map(int, input().split())
if A <= 2 * B:
  print(0)
else:
  print(A - 2*B)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools

import queue
from collections import deque



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






if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

result=A-B*2

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

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:
N,M = map(int,input().split())
print(max(0,N-2*M))

Submission status: Accepted

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

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