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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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-B]))

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

#S = input()
A,B = list(map(int, input().split()))
#S = [input() for _ in range(H)]
#T = [list(map(int,input().split())) for _ in range(N)]
#sys.exit()
ans = A - 2*B
if(ans <= 0) :
    print(0)
else :
    print(ans)

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def solve():
    a, b = read()
    result = think(a, b)
    write(result)


def read():
    return read_int(2)

def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(a, b):
    if a < 2 * b:
        return 0
    return a - 2 * b


def write(result):
    print(result)


if __name__ == '__main__':
    # import doctest
    # doctest.testmod()
    # import sys
    # sys.setrecursionlimit(10000)
    solve()

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

Submission status: Accepted

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

Submission status: Accepted

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

sum = A - 2*B

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

x = A-B-B
if x < 0:
    x = 0
print(x)

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

Submission status: Accepted

Solution code:
def input():
    import sys
    return sys.stdin.readline().rstrip()


def main():
    import math
    import collections
    import itertools

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



if __name__ == '__main__':
    main()

Submission status: Accepted

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

c = a - (2*b)

print(max(0, c))

Submission status: Accepted

Solution code:
#設定
import sys
input = sys.stdin.buffer.readline

#ライブラリインポート
from collections import defaultdict

#入力受け取り
def getlist():
	return list(map(int, input().split()))

#処理内容
def main():
	A, B = getlist()
	if B * 2 >= A:
		print(0)
	else:
		print(A - 2 * B)
	


if __name__ == '__main__':
	main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())


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

Submission status: Accepted

Solution code:
from sys import stdin

a,b= [int(x) for x in stdin.readline().rstrip().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())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, Counter, deque
from itertools import accumulate, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right, bisect
from heapq import heappop, heappush
from fractions import gcd
from math import ceil, floor, sqrt, cos, sin, pi
from copy import deepcopy

# If you use recursive call, uncomment this code
#sys.setrecursionlimit(10**6)

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

if __name__ == '__main__':
    main()

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

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

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    A, B = map(int, input().split())
    print(max(0, A-2*B))
    #n, m = map(int, input().split())

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

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

Submission status: Accepted

Solution code:
def main():
    a,b = map(int,input().split())
    print(max([0,a-b*2]))    
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# a = int(input())
# n, *a = map(int, open(0))
A,B = map(int, input().split())
# A = list(map(int, input().split()))
# S = input()
cnt = 0
if A-B*2 < 0:
    print(0)
else:
    print(A-B*2)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline


def read_int():
    return int(input())


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


def read_float():
    return float(input())


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


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(A, B):
    return max(0, A - 2*B)


def main():
    A, B = read_int_n()
    print(slv(A, B))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import math
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]


a, b = na()

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

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

#Solve
if __name__ == "__main__":
    solve()

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

Submission status: Accepted

Solution code:
def MAP(): return list(map(int,input().split()))
def INT(): return int(input())
def FLOAT(): return float(input())
MOD = 10**9+7

a,b = MAP()

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

Submission status: Accepted

Solution code:
#coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]

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



if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = A - 2*B

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

#
# s = input()

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

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
a,b=map(int,input().split())
if a-b*2<0:
    print(0)
else:
    print(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(" "))
out = max(a - 2*b, 0)
print(out)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import queue

"""
N = int(input())
#S = input()
# (N,M) = (int(i) for i in input().split(" "))
# A = [int(i) for i in input().split()]
A = []
for i in range(N):
	A.append(int(input()))

print(A)

"""
(N,M) = (int(i) for i in input().split(" "))
print(max(N-M*2, 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 = max(A - B*2, 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:
n, k = map(int, input().split())
print(max(0, n-2*k))

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:
from sys import stdin
A,B = [int(x) for x in stdin.readline().rstrip().split()]
ans = max(0,A-B*2)
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())


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

Submission status: Accepted

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

Submission status: Accepted

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

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:
import sys
def input():
    return sys.stdin.readline()[:-1]
N,M = map(int,input().split(' '))
if N<=M*2:
    print(0)
else:
    print(N-M*2)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
import sys
from itertools import accumulate
input = sys.stdin.readline
def inputs():return [int(x) for x in input().split()]
N,M = inputs()
print(max(N-2*M,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:
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(0)
else:
    print(a - 2 * b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
from bisect import bisect_left, bisect_right
import random
from itertools import permutations, accumulate, combinations
import sys
import string



INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7


a, b = LI()
print(max(a - b * 2, 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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B = MAP()

if A < B*2:
	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:
def main():
    A, B = (int(i) for i in input().split())
    print(max(0, A - 2*B))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#import sys
#input = sys.stdin.readline
def main():
    A, B = map( int, input().split())
    print( max( 0, A - B*2))
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

if B >= A:
    print(0)

else:
    print(A-B)

Submission status: Accepted

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

rest = a - b - b
if rest < 0:
    rest = 0

print(rest)

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

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
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())
ans = max(0,A-2*B)
print(ans)

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


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

Submission status: Accepted

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


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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

res = A - 2 * B

if res < 0:
        res = 0

print(res)

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

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

Submission status: Accepted

Solution code:
#ABC 143
#A
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=max(0,a-2*b)
print(ans)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

if __name__ == '__main__':
        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:
##n = int(input())
a,b = [int(i) for i in input().split()]

print(a-min(a,2*b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())

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



main()

Submission status: Accepted

Solution code:
import sys

def input(): return sys.stdin.readline()[:-1]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def MATINT(h): return [list(map(int, input().split())) for _ in range(h)]
def MATSTR(h): return [input() for _ in range(h)]
sys.setrecursionlimit(10 ** 9)
inf = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

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

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a,b = LI()
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-2*B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# from collections import defaultdict
# from heapq import heappush, heappop, heapify
# from bisect import bisect_left, insort_left
# from itertools import groupby


class Solution:
    def main(self):
        # N = int(input())
        A, B = list(map(int, input().split()))

        res = 0

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


if __name__ == '__main__':
    Solution().main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7



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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf = 10**20


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))


a, b = nm()

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