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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def ri(): return int(input())
def rli(): return list(map(int, input().split()))
def rls(): return list(map(str, input().split()))
def pl(a): print(" ".join(list(map(str, a))))
def ma():return map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:

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

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

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

Submission status: Accepted

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

max_curtain = B * 2

print(max(0, A - max_curtain))

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

Submission status: Accepted

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

Submission status: Accepted

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

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

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

Submission status: Accepted

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

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

print(remain)

Submission status: Accepted

Solution code:
base = input().split()
a = int(base[0])
b = int(base[1])
if a>b*2:
    print(a-b*2)
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(abs(a-b*2)) if a>2*b 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:
import sys
input = sys.stdin.readline
from itertools import *
from collections import *

INF = float('inf')


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

ans = a - b *2
if(ans < 0):
  print(0)
  exit()
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:
x = input().split()
A = int(x[0])
B = int(x[1])

n = A -2*B

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

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

ans=A - B*2

print(ans) if(ans > 0) else print(0)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# ABC 143: A – Curtain
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())

num = a - b * 2

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

Submission status: Accepted

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

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

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

ans = a - b - b

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

a, b = map(int, sys.stdin.readline().split())

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

if __name__ ==  '__main__':
    main()

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 - 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(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(" "))
print(max(A - 2 * B, 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>2*b: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-2*b)

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

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

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A, B = lr()
answer = max(0, A - (B + B))
print(answer)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

cur = a - 2 * b

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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


print(a - b * 2)

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

Submission status: Accepted

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

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:
import sys
input = sys.stdin.readline

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

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

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 = input().split()
B = int(A[0]) - 2 * int(A[1])
print(0 if B < 0 else B)

Submission status: Accepted

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

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

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

input = sys.stdin.readline

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# import bisect
# import heapq
# from copy import deepcopy
# from collections import deque
# from collections import Counter
# from itertools import accumulate
# from itertools import permutations
# import numpy as np
import math
# mod = 10**9 + 7

# n = int(input())
# a = list(map(int, input().split()))
# n = int(input())z
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())
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:
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

def main():
    a, b = input_nums()
    if b*2 >= a:
        print(0)
    else:
        print(a-b*2)

if __name__ == '__main__':
    main()

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(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:
# coding: utf-8
# Your code here!

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

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())
print(max([0, A-2*B]))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
# coding: utf-8
import sys
sys.setrecursionlimit(10000000)

#const
# my functions here!
def pin(type=int):
    return map(type,input().rstrip().split())

def resolve():
    A,B=pin()
    ans=0 if (A<B*2) else A-B*2
    print(ans)
"""
#printデバッグ消した？
#前の問題の結果見てないのに次の問題に行くの？
"""
"""
お前カッコ閉じるの忘れてるだろ
"""
import sys
from io import StringIO
import unittest

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 = input().split()
a = int(a)
b = int(b)
ret = a - (b * 2)
if ret < 0:
    ret = 0
print(ret)

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

Submission status: Accepted

Solution code:
def solve():
    N, M = map(int, input().split())
    return N - M*2 if N //2 >= M else 0

print(solve())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:
# Problem A - Curtain

# input process
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())
print(a-b*2 if a-b*2>= 0 else 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())

s = a-2*b

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

Submission status: Accepted

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

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

nokori = A - B*2

if nokori>=0:
    print(nokori)

else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
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 = max(a-b*2,0)

print(ans)

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

    result = A - B * 2

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_line = input()
inputs = input_line.split(' ')
inputs = [int(input) for input in inputs]

A = inputs[0]
B = inputs[1]

dual_B = 2 * B

res = 0
if A > dual_B:
    res = A - dual_B
else:
    res = 0

print(res)

Submission status: Accepted

Solution code:
def main():
    # n=int(input())
    n,k= map(int, input().split())
    p=n-2*k
    print(p) if p>0 else print(0)
    return
main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

else:
    print(0)

Submission status: Accepted

Solution code:
input_l = input().rstrip().split(' ')
input_l = list(map(int,input_l))

if(input_l[0] > input_l[1] * 2):
    print(input_l[0]-input_l[1]*2)
else:
    print(0)

Submission status: Accepted

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

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

Submission status: Accepted

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

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