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:
from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys
import random
import itertools
import math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt


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


def LF(): return list(map(float, input().split()))


def LI_(): return list(map(lambda x: int(x)-1, input().split()))


def II(): return int(input())


def IF(): return float(input())


def LS(): return list(map(list, input().split()))


def S(): return list(input().rstrip())


def IR(n): return [II() for _ in range(n)]


def LIR(n): return [LI() for _ in range(n)]


def FR(n): return [IF() for _ in range(n)]


def LFR(n): return [LI() for _ in range(n)]


def LIR_(n): return [LI_() for _ in range(n)]


def SR(n): return [S() for _ in range(n)]


def LSR(n): return [LS() for _ in range(n)]


def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x % y)


def my_index_multi(l, x):
    return [i for i, _x in enumerate(l) if _x == x]


def sosu(x):
    for i in range(2, int(sqrt(x)+1)):
        if x % i == 0:
            return False
    return True


mod = 1000000007
inf = float('INF')


def A():
    A, B = LI()
    ans = A-2*B
    if ans > 0:
        print(ans)
    else:
        print(0)
    return

# B


def B():
    n, m, W = LI()
    dp = [[0 for i in range(W+1)] for j in range(n+1)]
    wl = []
    vl = []
    c = [0 for i in range(n+1)]
    for i in range(n):

        w, v = LI()
        wl.append(w)
        vl.append(v)
    for i in range(m):
        a, b = LI()

        wl[a-1] += wl[b-1]
        vl[a-1] += vl[b-1]
        wl[b-1] = wl[a-1]
        vl[b-1] = vl[a-1]
        c[a] += 1
        c[b] += 2
    w = [x for i, x in enumerate(wl) if c[i+1] <= 1]
    v = [x for i, x in enumerate(vl) if c[i+1] <= 1]

    for i in range(len(w)):

        for t in range(W+1):

            if t >= w[i]:
                dp[i+1][t] = max(dp[i][t], dp[i][t-w[i]]+v[i])
            else:
                dp[i+1][t] = dp[i][t]

    print(max(dp[len(w)]))
    return

# C


def C():
    N = II()
    A = LI()
    J = [0] * N
    for i, n in enumerate(A):
        J[n-1] = i+1
    for s in J:
        print(s, end=" ")

    return

# D


def D():
    A, B = map(int, input().split())
    g = gcd(A, B)
    # go = g
    # myset = set([1])
    sq = int(sqrt(g)) + 2
    ans = 1

    for i in range(2, sq):
        if g % i == 0:
            ans += 1
        while g % i == 0:
            g /= i

            # myset.add(i)
        if g == 1:
            break
        if i == sq - 1:
            # myset.add(go)
            ans += 1

    print(ans)

    return

# E


def E():
    N, M = LI()
    bit_max = 1 << N
    dp = [[inf for i in range(bit_max)] for j in range(M+1)]
    dp[0][0] = 0

    for i in range(M):
        a, b = LI()

        c = LI()
        bit = 0

        for d in c:
            bit |= 1 << (d-1)

        for w in range(bit_max):

            t = w | bit
            cost = dp[i][w] + a

            dp[i+1][t] = min(dp[i+1][t], cost)

            dp[i+1][w] = min(dp[i][w], dp[i+1][w])

    print(-1) if dp[-1][-1] == inf else print(dp[-1][-1])

    return

# F


def F():
    N, M = LI()

    value = [0] * M
    power = [0] * M
    for i in range(M):
        a, b = LI()
        value[i] = a
        c = LI()
        L = ['0'] * N
        for k in c:
            L[k - 1] = '1'
        bint = ''.join(L)
        power[i] = int(bint, 2)
    bint = ''.join(list(['1'] * N))
    dp = [inf] * (int(bint, 2)+1)
    t = 0
    cost = 0

    dp[0] = 0
    for s in range(int(bint, 2) + 1):
        for i in range(M):
            t = s | power[i]
            cost = dp[s] + value[i]
            dp[t] = min(dp[t], cost)
    print(-1) if(dp[-1] == inf) else print(dp[-1])

    return

    # you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")


def solution(S):
    # write your code in Python 3.6
    import math

    vowels = "AIUEO"
    count = 0
    consonants = 0
    newC = []
    newV = []

    for i in S[:-1]:
        if i in vowels:
            count += 1
            newV.append(i)
        else:
            consonants += 1
            newC.append(i)

    if consonants < count or consonants - 2 > count:
        return 0

    a = math.factorial(len(set(newC))) * math.factorial(len(set(newV)))
    return a

    pass


# Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

s = a-b*2

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main():
	import sys
	input = sys.stdin.readline
	
	a, b = map(int, input().split())
	print(max(0, a - 2 * b))
	
	return 0

main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

flag=A-2*B

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
AB = list(map(int,input().split()))
A = AB[0]
B = AB[1]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = 0
w = a - (b*2)

if w > 0:
  ans = w 

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    a()

Submission status: Accepted

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

temp_res = A - B * 2

if temp_res < 0:
    res = 0
else:
    res = temp_res

print(res)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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



if a<2*b:
  ret = 0
else:
  ret = a-2*b


print(ret)

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
from collections import deque
def getN():
    return int(input())
def getList():
    return list(map(int, input().split()))
import math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

A, B = [int(n) for n in sys.stdin.readline().strip().split()]
print(max(A-2*B, 0))

Submission status: Accepted

Solution code:
tmp = input()

tmp_s = [int(x.strip()) for x in tmp.split(' ')]
A = tmp_s[0] #A  
B = tmp_s[1] #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/2 - b) <= 0:
    print(0)
else:
    print(a - b*2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
def main():
    a, b = list(map(int, input().split()))
    if a - 2 * b > 0:
        print(a - 2 * b)
    else:
        print(0)
    pass
if __name__ == '__main__':
    main()

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

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

Submission status: Accepted

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

num = A - (2 * B)

if num < 0:
    num = 0

print(num)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    A, B = list(map(int, input().split()))
    print(max(A-B*2, 0))


if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# n = int(input())
# w = input()
a, b = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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


def solve():
    if A < B * 2:
        return 0

    return A - B * 2


print(solve())

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:
#coding: utf-8
# n,k = int(input())
# list = list(map(int,input().split()))
# strings = list(map(str, [input() for i in range(amount)]))

a,b = map(int,input().split())
l = a-b*2

if l < 0:
    l = 0

print(l)

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

Submission status: Accepted

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

x = A - (B * 2)

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

Submission status: Accepted

Solution code:
# coding: utf-8
# ABC143 A

# a:家の窓 b:カーテン
a, b = map(int, input().split())

res = a - b * 2
if res < 0:
    res = 0

print(res)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#
import sys
import math
import numpy as np
import itertools

# いくつか入力
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())

r = A - (2*B)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

AB=np.array(input().split(),dtype=np.int32)

A=AB[0]
B=AB[1]

res=A-2*B

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

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

import logging
logging.basicConfig(level=logging.DEBUG)

import sys
input = sys.stdin.readline().rstrip

setrecursionlimit(1000000)

MOD = 10**9+7
INF = float('inf')

def main():
    A,B=[int(x) for x in input().split()]
    ans = A - B*2
    print(ans if ans > 0 else 0)

main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

#print(A, B)

C = A - 2 * B
if C < 0:
    C = 0

print(C)

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

c = a - 2*b
ans = c if c>0 else 0

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if A < B * 2:
	res = 0
else:
	res = A - B * 2

print(res)

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(x) for x in input().split())
if A > 2 * B:
    print(A - 2 * B)
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import glob


# 問題ごとのディレクトリのトップからの相対パス
REL_PATH = 'ABC\\143\\A'

# テスト用ファイル置き場のトップ
TOP_PATH = 'C:\\AtCoder'

class Common:

    problem = []
    index = 0

    def __init__(self, rel_path):
        self.rel_path = rel_path

    def initialize(self, path):
        file = open(path)
        self.problem = file.readlines()
        self.index = 0
        return

    def input_data(self):
        try:
            IS_TEST
            self.index += 1
            return self.problem[self.index-1]

        except NameError:
            return input()

    def resolve(self):
        pass

    def exec_resolve(self):
        try:
            IS_TEST
            for path in glob.glob(TOP_PATH + '\\' + self.rel_path + '/*.txt'):
                print("Test: " + path)
                self.initialize(path)
                self.resolve()
                print("\n\n")
        except NameError:
            self.resolve()


class A(Common):

    def resolve(self):

        q = [int(i) for i in self.input_data().split()]
        a = q[0] - q[1]*2
        if a < 0:
            print("0")
        else:
            print(str(a))


solver = A(REL_PATH)
solver.exec_resolve()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

ans=a-2*b

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(ans if ans > 0 else 0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_list = input().split()
window = int(input_list[0])
cartain = int(input_list[1])
if window < cartain * 2:
  print("0")
else:
  print(window - cartain * 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys


input = sys.stdin.readline


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b = list(map(int,input().strip().split()))
z = b * 2
x = a - z
if a >= z:
    print(x)
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:
import sys

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

if __name__ == '__main__':
    a, b = map(int, sys.stdin.readline().strip().split(" "))
    solve(a, b)

Submission status: Accepted

Solution code:

def A():
    r = input().split(" ")
    a = int(r[0])
    b = int(r[1])
    if a > 2*b:
        print(a-2*b)
    else:
        print(0)

if __name__ == '__main__':
    A()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
x = a - 2 * b
if x > 0:
    print(x)
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:
#!/usr/bin/env python3
import sys
args = sys.argv
if len(args) == 2:
  from IPython import embed
  em = True
else:
  em = False
input = sys.stdin.readline
A, B = map(int, input().split())
if A <= 2*B:
  print(0)
else:
  print(A - 2*B)
if em: sys.stdin = open('/dev/tty')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
import sys
import heapq
import math

# input = sys.stdin.readline

sys.setrecursionlimit(1000000000)

MIN = -10 ** 9
MOD = 10 ** 9 + 7


def main():
    # N = int(input())
    A,B = [int(a) for a in input().split()]
    # H = [int(a) for a in input().split()]
    # xy = [
    #     [int(a) for a in input().split()]
    #     for _ in range(N)
    # ]
    print(max(0,A-2*B))



if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
a, b = map(int, sys.stdin.readline().split())

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

Submission status: Accepted

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

sukima = A - 2*B

if sukima >= 0:
	print(sukima)
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:
import sys

input = sys.stdin.readline


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


# Run main
if __name__ == '__main__':
    AtCoder().main()

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

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())
ans = 0

if a>=b*2:
    ans=a-b*2
else:
    ans=0

print(ans)

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

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

def pa(v):
	if isTest:
		print(v)

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

res = A - B * 2

if res < 0:
    res = 0

print(res)

Submission status: Accepted

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

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

Submission status: Accepted

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

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