ZhenlongDai/ACPR huggingface dataset:
Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
n, q = map(int, input().split())

p = []
time = 0

for i in range(n):
	p.append(input().split())
	p[i][1] = int(p[i][1])

print("{0} {1}".format(p[0][0], time))

while(len(p) > 0):
	if (p[0][1]<= q):
		time += p[0][1]
		print("{0} {1}".format(p[0][0], time))
		p.pop(0)
	else:
		time += q
		p[0][1] -= q
		p.append(p[0])
		p.pop(0)

Failing test case input:
4 101
3p 205
p3 87
3p 200
p4 81
p5 19

Expected output:
p3 188
p4 370
3p 570
3p 573


Actual output:
3p 0
p3 188
p4 370
3p 570
3p 573


Fixed submission (verdict: Accepted):
n, q = map(int, input().split())

p = []
time = 0

for i in range(n):
	p.append(input().split())
	p[i][1] = int(p[i][1])

while(len(p) > 0):
	if (p[0][1]<= q):
		time += p[0][1]
		print("{0} {1}".format(p[0][0], time))
		p.pop(0)
	else:
		time += q
		p[0][1] -= q
		p.append(p[0])
		p.pop(0)

Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
n, q = map(int, input().split())

processes = []

for i in range(int(n)):
    process_name, process_time = input().split()
    processes.append([process_name, int(process_time)])

elapsed_time = 0
while len(processes):
    process = processes.pop(0)
    if process[1] > 100:
        process[1] -= 100
        processes.append(process)
        elapsed_time += 100
    else:
        elapsed_time += process[1]
        print(process[0], elapsed_time)

Failing test case input:
4 101
3p 527
p3 62
3p 284
q4 90
5p 19

Expected output:
p3 163
q4 354
3p 739
3p 963


Actual output:
p3 162
q4 352
3p 736
3p 963


Fixed submission (verdict: Accepted):
n, q = map(int, input().split())

processes = []

for i in range(int(n)):
    process_name, process_time = input().split()
    processes.append([process_name, int(process_time)])

elapsed_time = 0
while len(processes):
    process = processes.pop(0)
    if process[1] > q:
        process[1] -= q
        processes.append(process)
        elapsed_time += q
    else:
        elapsed_time += process[1]
        print(process[0], elapsed_time)
Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
from collections import deque

n,q=[int(i) for i in input().split()]
name=[0 for i in range(n)]
time=[0 for i in range(n)]
answer_name=[]
answer_time=[]
total_time=0

for i in range(n):
    name[i],time[i]=input().split()

d_name = deque(name)
d_time = deque(time)

while len(d_name)>0:

    a=d_name.popleft()
    b=int(d_time.popleft())

    if b>100:
        d_name.append(a)
        d_time.append(b-100)
        total_time=total_time+100

    else:
        total_time=total_time+b
        answer_name.append(a)
        answer_time.append(total_time)

for i in range(len(answer_time)):
    print(answer_name[i], answer_time[i])



Failing test case input:
4 101
3p 527
p3 62
3p 284
q4 90
5p 19

Expected output:
p3 163
q4 354
3p 739
3p 963


Actual output:
p3 162
q4 352
3p 736
3p 963


Fixed submission (verdict: Accepted):
from collections import deque

n,q=[int(i) for i in input().split()]
name=[0 for i in range(n)]
time=[0 for i in range(n)]
answer_name=[]
answer_time=[]
total_time=0

for i in range(n):
    name[i],time[i]=input().split()

d_name = deque(name)
d_time = deque(time)

while len(d_name)>0:

    a=d_name.popleft()
    b=int(d_time.popleft())

    if b>q:
        d_name.append(a)
        d_time.append(b-q)
        total_time=total_time+q

    else:
        total_time=total_time+b
        answer_name.append(a)
        answer_time.append(total_time)

for i in range(len(answer_time)):
    print(answer_name[i], answer_time[i])

Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
N, Q = map(int, input().strip().split())

A = []
D = {}
for l in range(N):
    n, t = input().strip().split()
    D[n] = int(t)
    A.append(n)

print(A)
T = 0
d = 0
while True:
    n = A.pop(0)
    if D[n] > Q:
        D[n] -= Q
        T += Q
        A.append(n)
    else:
        T += D[n]
        print('{0} {1}'.format(n, T))
        d += 1
        if d == N:
            break

Failing test case input:
4 101
3p 205
p3 87
3p 200
p4 81
p5 19

Expected output:
p3 188
p4 370
3p 570
3p 573


Actual output:
['3p', 'p3', '3p', 'p4']
p3 188
3p 287
p4 368
3p 467


Fixed submission (verdict: Accepted):
N, Q = map(int, input().strip().split())

A = []
D = {}
for l in range(N):
    n, t = input().strip().split()
    A.append([n, int(t)])

T = 0
while A:
    l = A.pop(0)
    if l[1] > Q:
        l[1] -= Q
        T += Q
        A.append(l)
    else:
        T += l[1]
        print(l[0], T)
Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
n,q = map(int,input().split())
A = [list(map(str,input().split())) for i in range(n)]
time = 0
flag = 1
while len(A) > 0:
    if int(A[0][1]) <= q: 
        time += int(A[0][1])
        print(A[0][1],time)
        del A[0]
    else: 
        time += q
        A[0][1] = str(int(A[0][1])-q)
        A.append(A[0])
        del A[0]


Failing test case input:
5 100
p1 150
2p 80
3p 200
p4 350
p5 25

Expected output:
2p 180
p5 405
p1 455
3p 555
p4 805


Actual output:
80 180
25 405
50 455
100 555
50 805


Fixed submission (verdict: Accepted):
n,q = map(int,input().split())
A = [list(map(str,input().split())) for i in range(n)]
time = 0
flag = 1
while len(A) > 0:
    if int(A[0][1]) <= q: 
        time += int(A[0][1])
        print(A[0][0],time)
        del A[0]
    else: 
        time += q
        A[0][1] = str(int(A[0][1])-q)
        A.append(A[0])
        del A[0]

Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
import queue
procs = queue.Queue()

n,q = list(map(int,input().split()))

for i in range(n):
    name,time = input().split()
    procs.put((name,int(time)))
time=0
doneprocs = queue.Queue()
while True:
    if procs.empty():
        break
    temp = procs.get()
    if temp[1] < q:
        time += temp[1]
        doneprocs.put((temp[0],time))
    else:
        time+= q
        procs.put((temp[0],temp[1]-q))
for i in range(n):
    temp = doneprocs.get()
    print(temp[0],temp[1])

Failing test case input:
5 100
p1 150
p2 80
p3 200
p4 350
5p 20

Expected output:
p2 180
5p 400
p1 450
p3 550
p4 800


Actual output:
p2 180
5p 400
p1 450
p3 650
p4 800


Fixed submission (verdict: Accepted):
import queue
procs = queue.Queue()

n,q = list(map(int,input().split()))

for i in range(n):
    name,time = input().split()
    procs.put((name,int(time)))
time=0
doneprocs = queue.Queue()
while True:
    if procs.empty():
        break
    temp = procs.get()
    if temp[1] <= q:
        time += temp[1]
        doneprocs.put((temp[0],time))
    else:
        time+= q
        procs.put((temp[0],temp[1]-q))
for i in range(n):
    temp = doneprocs.get()
    print(temp[0],temp[1])
Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
a=input().split()
n=(int)(a[0])
q=(int)(a[1])
b=[0 for i in range(2*n)]
cnt=0
tmp=0
for i in range(n):
    B=input().split()
    k=2*i
    b[k]=B[0]
    b[k+1]=int(B[1])
while len(b)>0:
    tmp=b[1]-100
    if tmp>0:
        b.append(b[0])
        b.append(tmp)
        del b[0]
        del b[0]
        cnt=cnt+100
    else:
        cnt=cnt+b[1]
        print(b[0],cnt)
        del b[0]
        del b[0]



Failing test case input:
5 001
3p 1
2r 446
1p 314
p4 472
6o 25

Expected output:
3p 1
6o 101
1p 967
2r 1231
p4 1258


Actual output:
3p 1
6o 326
1p 1040
2r 1186
p4 1258


Fixed submission (verdict: Accepted):
a=input().split()
n=(int)(a[0])
q=(int)(a[1])
b=[0 for i in range(2*n)]
cnt=0
tmp=0
for i in range(n):
    B=input().split()
    b[2*i]=B[0]
    b[2*i+1]=int(B[1])
while len(b)>0:
    tmp=b[1]-q
    if tmp>0:
        b.append(b[0])
        b.append(tmp)
        del b[0]
        del b[0]
        cnt=cnt+q
    else:
        cnt=cnt+b[1]
        print(b[0],cnt)
        del b[0]
        del b[0]

Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):



def print_array(g):
    ans = str(g[0])
    if len(g) > 1:
        for i in range(1,len(g)):
            ans += ' '+str(g[i]) 
    print(ans)

name=[]
time=[]
current_time = 0

n, q = list(map(int, input().split()))
for i in range(n):
    s = input().split()
    name.append(s[0])
    time.append(int(s[1]))





finished = []
fin_time = []
i=0
remain = n
while True:
    if time[i] <= q:
        current_time += time.pop(i)
        finished.append(name.pop(i))
        fin_time.append(current_time)      
        remain -= 1
        if remain == 0:
            break
        i = (i+1)%remain
    else:
        time[i] -= q
        current_time += q
        i = (i+1)%remain

for i in range(n):
    print("{} {}".format(finished[i], fin_time[i]))
        
    


Failing test case input:
5 100
p1 150
2p 80
p3 200
4p 350
p5 14

Expected output:
2p 180
p5 394
p1 444
p3 544
4p 794


Actual output:
2p 180
p5 294
p1 544
p3 744
4p 794


Fixed submission (verdict: Accepted):



def print_array(g):
    ans = str(g[0])
    if len(g) > 1:
        for i in range(1,len(g)):
            ans += ' '+str(g[i]) 
    print(ans)

name=[]
time=[]
current_time = 0

n, q = list(map(int, input().split()))
for i in range(n):
    s = input().split()
    name.append(s[0])
    time.append(int(s[1]))





finished = []
fin_time = []
i=0
remain = n
while True:
    if time[i] <= q:
        current_time += time.pop(i)
        finished.append(name.pop(i))
        fin_time.append(current_time)      
        remain -= 1
        if remain == 0:
            break
        i = i%remain
    else:
        time[i] -= q
        current_time += q
        i = (i+1)%remain

for i in range(n):
    print("{} {}".format(finished[i], fin_time[i]))
Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
from collections import deque

if __name__ == "__main__":
    n, q = input().split()
    n, q = int(n), int(q)
    s = 0
    a = deque([list(map(str,input().split())) for _ in range(n)])

    while len(a):
        x = a.popleft()
        if int(x[1]) < q:
            s += int(x[1])
            print(x[0],s)
        else:
            x[1] = str(int(x[1]) - q)
            s += q
            a.append(x)



Failing test case input:
5 100
p1 294
p2 216
o3 200
p4 548
q5 32

Expected output:
q5 432
o3 732
p1 926
p2 942
p4 1290


Actual output:
q5 432
p1 926
p2 942
o3 942
p4 1290


Fixed submission (verdict: Accepted):
from collections import deque

if __name__ == "__main__":
    n, q = input().split()
    n, q = int(n), int(q)
    s = 0
    a = deque([list(map(str,input().split())) for _ in range(n)])

    while len(a):
        x = a.popleft()
        if int(x[1]) - q <= 0:
            s += int(x[1])
            print(x[0], s)
        else:
            x[1] = str(int(x[1]) - q)
            s += q
            a.append(x)

Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):



def print_array(g):
    ans = str(g[0])
    if len(g) > 1:
        for i in range(1,len(g)):
            ans += ' '+str(g[i]) 
    print(ans)

name=[]
time=[]
n, q = list(map(int, input().split()))
for i in range(n):
    s = input().split()
    name.append(s[0])
    time.append(int(s[1]))





finished = []
i=0
remain = n
while True:
    if time[i] == 0:
        i += 1
        if i == n:
            i = 0
        continue
    if time[i] <= q:
        finished.append(name[i])
        time[i] = 0
        remain -= 1
        if remain == 0:
            break
    else:
        time[i] -= q
        i += 1
        if i == n:
            i = 0

print_array(finished)
        


Failing test case input:
5 100
p1 150
p2 80
p3 200
p4 350
p5 20

Expected output:
p2 180
p5 400
p1 450
p3 550
p4 800

Actual output:
p2 p5 p1 p3 p4


Fixed submission (verdict: Accepted):



def print_array(g):
    ans = str(g[0])
    if len(g) > 1:
        for i in range(1,len(g)):
            ans += ' '+str(g[i]) 
    print(ans)

name=[]
time=[]
current_time = 0

n, q = list(map(int, input().split()))
for i in range(n):
    s = input().split()
    name.append(s[0])
    time.append(int(s[1]))





finished = []
fin_time = []
i=0
remain = n
while True:
    if time[i] <= q:
        current_time += time.pop(i)
        finished.append(name.pop(i))
        fin_time.append(current_time)      
        remain -= 1
        if remain == 0:
            break
        i = i%remain
    else:
        time[i] -= q
        current_time += q
        i = (i+1)%remain

for i in range(n):
    print("{} {}".format(finished[i], fin_time[i]))
Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
import queue
q = queue.Queue()
exetime = 0

n, quantum = map(int, input().split())
for i in range(n):
    q.put(tuple(input().split())) 

while not q.empty():
    process = q.get()
    
    time = int(process[1])
    if time > 100:
        exetime += 100
        q.put((process[0], time - 100))
    else:
        exetime += time
        print(process[0], exetime)


Failing test case input:
3 110
p2 293
p3 80
p3 200
4p 663
p5 14

Expected output:
p3 190
p3 500
p2 573


Actual output:
p3 180
p3 480
p2 573


Fixed submission (verdict: Accepted):
import queue
q = queue.Queue()
exetime = 0

n, quantum = map(int, input().split())
for i in range(n):
    q.put(tuple(input().split())) 

while not q.empty():
    process = q.get()
    
    time = int(process[1])
    if time > quantum:
        exetime += quantum
        q.put((process[0], time - quantum))
    else:
        exetime += time
        print(process[0], exetime)

Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
a=input().split()
n=int(a[0])
q=int(a[1])
b=[0 for i in range(2*n)]
cnt=0
for i in range(n):
    B=input().split()
    b[2*i]=B[0]
    b[2*i+1]=int(B[1])
while len(b)>0:
    tmp=b[1]-100
    if tmp>0:
        b.append(b[0])
        b.append(tmp)
        del b[0]
        del b[0]
        cnt=cnt+100
    else:
        cnt=cnt+b[1]
        print(b[0],cnt)
        del b[0]
        del b[0]


Failing test case input:
3 001
3p 25
2q 446
1p 314
p4 472
5o 25

Expected output:
3p 73
1p 653
2q 785


Actual output:
3p 25
1p 739
2q 785


Fixed submission (verdict: Accepted):
a=input().split()
n=(int)(a[0])
q=(int)(a[1])
b=[0 for i in range(2*n)]
cnt=0
tmp=0
for i in range(n):
    B=input().split()
    b[2*i]=B[0]
    b[2*i+1]=int(B[1])
while len(b)>0:
    tmp=b[1]-q
    if tmp>0:
        b.append(b[0])
        b.append(tmp)
        del b[0]
        del b[0]
        cnt=cnt+q
    else:
        cnt=cnt+b[1]
        print(b[0],cnt)
        del b[0]
        del b[0]

Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
n,q = map(int,input().split())
name = []
time = []
endtime =[]
endname = []
for i in range(n):
    a = input().split()
    name.append(a[0])
    time.append(int(a[1]))
s = 0
while True:
    if time[0]> 100:
        time[0] -= 100
        time.append(time.pop(0))
        name.append(name.pop(0))
        s += 100
    else:
        s += time[0] 
        time.pop(0)
        print(name.pop(0),s)      
    
    if len(name) == 0:
        break
    

Failing test case input:
4 110
2p 205
p3 80
3p 200
4p 81
p5 19

Expected output:
p3 190
4p 381
2p 476
3p 566


Actual output:
p3 180
4p 361
3p 561
2p 566


Fixed submission (verdict: Accepted):
n,q = map(int,input().split())
name = []
time = []
endtime =[]
endname = []
for i in range(n):
    a = input().split()
    name.append(a[0])
    time.append(int(a[1]))
s = 0
while True:
    if time[0]> q:
        time[0] -= q
        time.append(time.pop(0))
        name.append(name.pop(0))
        s += q
    else:
        s += time[0] 
        time.pop(0)
        print(name.pop(0),s)      
    
    if len(name) == 0:
        break
Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
pnum,mtime = map(int,input().split(" "))

total = [list(input().split(" ")) for _ in range(pnum)]

print(total)

cnt=0
tcnt=0
while len(total) > 0:
	ztime = int(total[0][1]) - mtime
	if ztime <= 0:
		tcnt += int(total[0][1])
		print(total[0][0],int(tcnt))
		total.pop(0)
	else:
		total.append([total[0][0],ztime])
		total.pop(0)
		tcnt += mtime
	cnt += 1



Failing test case input:
5 001
3p 1
2r 446
1p 314
p4 472
6o 25

Expected output:
3p 1
6o 101
1p 967
2r 1231
p4 1258


Actual output:
[['3p', '1'], ['2r', '446'], ['1p', '314'], ['p4', '472'], ['6o', '25']]
3p 1
6o 101
1p 967
2r 1231
p4 1258


Fixed submission (verdict: Accepted):

pnum,mtime = map(int,input().split(" "))

total = [list(input().split(" ")) for _ in range(pnum)]

cnt=0
tcnt=0
while len(total) > 0:
	ztime = int(total[0][1]) - mtime
	if ztime <= 0:
		tcnt += int(total[0][1])
		print(total[0][0],int(tcnt))
		total.pop(0)
	else:
		total.append([total[0][0],ztime])
		total.pop(0)
		tcnt += mtime
	cnt += 1

Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
n, q = map(int, input().split())
l = [list(input().split()) for i in range(n)]
from collections import deque
que = deque([[l[i][0], int(l[i][1])] for i in range(n)])
a = []
time = 0
while que != deque([]):
    a = que.popleft()
    if a[1] <= 100:
        time += a[1]
        print("{} {}".format(a[0], str(time)))
    else:
        time += 100
        a[0], a[1] = a[0], a[1] - 100
        que.append(a)

Failing test case input:
4 110
2p 293
p3 80
3p 200
4p 81
p5 19

Expected output:
p3 190
4p 381
3p 581
2p 654


Actual output:
p3 180
4p 361
3p 561
2p 654


Fixed submission (verdict: Accepted):
n, q = map(int, input().split())
l = [list(input().split()) for i in range(n)]
from collections import deque
que = deque([[l[i][0], int(l[i][1])] for i in range(n)])
a = []
time = 0
while que != deque([]):
    a = que.popleft()
    if a[1] <= q:
        time += a[1]
        print("{} {}".format(a[0], str(time)))
    else:
        time += q
        a[0], a[1] = a[0], a[1] - q
        que.append(a)

Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
n,q = map(int,input().split())

tmp =  [input().split() for i in range(n)]
a = [[name,int(time)] for name,time in tmp]

total_time = 0

count = 0
while(a):
    current = a.pop()
    if(current[1] > q):
        current[1] -= q
        a.append(current)
        total_time += q
    else:
        total_time += current[1]
        print(current[0],total_time,sep = " ")


Failing test case input:
5 100
p1 294
p2 216
o3 200
p4 548
q5 32

Expected output:
q5 432
o3 732
p1 926
p2 942
p4 1290


Actual output:
q5 32
p4 580
o3 780
p2 996
p1 1290


Fixed submission (verdict: Accepted):
n,q = map(int,input().split())

tmp =  [input().split() for i in range(n)]
a = [[name,int(time)] for name,time in tmp]

total_time = 0

count = 0
while(a):
    current = a.pop(0)
    if(current[1] > q):
        current[1] -= q
        a.append(current)
        total_time += q
    else:
        total_time += current[1]
        print(current[0],total_time,sep = " ")
Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):

n,q = [int(x) for x in input().split()]
Q=[]
for i in range(n):
    Q.append(input().split())
t=0
res=[]
while Q!=[]:
    if int(Q[0][1])<q:
        res.append([Q[0][0],int(Q[0][1])+t])
        t+=int(Q[0][1])
    else:
        Q.append([Q[0][0],int(Q[0][1])-q])
        t+=q
    del Q[0]
for i in res:
    print(i[0]+" "+str(i[1]))

Failing test case input:
5 100
p1 150
p2 80
p3 200
p4 350
p5 14

Expected output:
p2 180
p5 394
p1 444
p3 544
p4 794


Actual output:
p2 180
p5 394
p1 444
p3 644
p4 794


Fixed submission (verdict: Accepted):

n,q = [int(x) for x in input().split()]
Q=[]
for i in range(n):
    Q.append(input().split())
t=0
res=[]
while Q!=[]:
    if int(Q[0][1])<=q:
        res.append([Q[0][0],int(Q[0][1])+t])
        t+=int(Q[0][1])
    else:
        Q.append([Q[0][0],int(Q[0][1])-q])
        t+=q
    del Q[0]
for i in res:
    print(i[0]+" "+str(i[1]))

Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
a=input().split()
n=(int)(a[0])
q=(int)(a[1])
b=[0 for i in range(2*n)]
cnt=0
tmp=0
for i in range(n):
    B=input().split()
    b[2*i]=B[0]
    b[2*i+1]=int(B[1])
while len(b)>0:
    tmp=b[1]-100
    if tmp>0:
        b.append(b[0])
        b.append(tmp)
        del b[0]
        del b[0]
        cnt=cnt+100
    else:
        cnt=cnt+b[1]
        print(b[0],cnt)
        del b[0]
        del b[0]



Failing test case input:
4 101
1p 150
o3 80
p3 240
p4 628
p4 8

Expected output:
o3 181
1p 432
p3 672
p4 1098


Actual output:
o3 180
1p 430
p3 670
p4 1098


Fixed submission (verdict: Accepted):
a=input().split()
n=(int)(a[0])
q=(int)(a[1])
b=[0 for i in range(2*n)]
cnt=0
tmp=0
for i in range(n):
    B=input().split()
    b[2*i]=B[0]
    b[2*i+1]=int(B[1])
while len(b)>0:
    tmp=b[1]-q
    if tmp>0:
        b.append(b[0])
        b.append(tmp)
        del b[0]
        del b[0]
        cnt=cnt+q
    else:
        cnt=cnt+b[1]
        print(b[0],cnt)
        del b[0]
        del b[0]

Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
n, q = [ int( val ) for val in input( ).split( " " ) ]
ps = [0]*n
t = [0]*n
for i in range( n ):
	ps[i], t[i] = input( ).split( " " )


output = []
qsum = 0
while t:
	psi = ps.pop( 0 )
	ti = int( t.pop( 0 ) )
	if ti <= q:
		qsum += ti	
		output.append( psi+" "+str( qsum ) )
	else:
		t.append( ti - q )
		ps.append( psi )
		qsum += q

Failing test case input:
5 100
p1 294
p2 216
o3 200
p4 548
q5 20

Expected output:
q5 420
o3 720
p1 914
p2 930
p4 1278


Actual output:

Fixed submission (verdict: Accepted):
n, q = [ int( val ) for val in input( ).split( " " ) ]
ps = [0]*n
t = [0]*n
for i in range( n ):
	ps[i], t[i] = input( ).split( " " )


output = []
qsum = 0
while t:
	psi = ps.pop( 0 )
	ti = int( t.pop( 0 ) )
	if ti <= q:
		qsum += ti	
		output.append( psi+" "+str( qsum ) )
	else:
		t.append( ti - q )
		ps.append( psi )
		qsum += q

print( "\n".join( output ) )
Problem: p02264
Buggy submission (Python3, verdict: Wrong Answer):
a = list(map(int, input().split()))
queuekey = []
queuetime = []

for i in range(0, a[0]):
    tmp = list(input().split())
    queuekey.append(tmp[0])
    queuetime.append(int(tmp[1]))

spentTime = 0
while len(queuetime) > 0:
    if queuetime[0] < a[1]:
        spentTime += queuetime[0]
        print(queuekey[0], end="")
        print(' ', end="")
        print(spentTime)
        queuekey.pop(0)
        queuetime.pop(0)
    else:
        spentTime += a[1]
        queuetime[0] -= a[1]
        queuetime.append(queuetime[0])
        queuekey.append(queuekey[0])
        queuetime.pop(0)
        queuekey.pop(0)

        
    

Failing test case input:
5 001
3p 1
2r 446
1p 314
p4 472
6o 25

Expected output:
3p 1
6o 101
1p 967
2r 1231
p4 1258


Actual output:
3p 5
6o 104
1p 969
2r 1232
p4 1258


Fixed submission (verdict: Accepted):
a = list(map(int, input().split()))
queuekey = []
queuetime = []

for i in range(0, a[0]):
    tmp = list(input().split())
    queuekey.append(tmp[0])
    queuetime.append(int(tmp[1]))

spentTime = 0
while len(queuetime) > 0:
    if queuetime[0] <= a[1]:
        spentTime += queuetime[0]
        print(queuekey[0], end="")
        print(' ', end="")
        print(spentTime)
        queuekey.pop(0)
        queuetime.pop(0)
    else:
        spentTime += a[1]
        queuetime[0] -= a[1]
        queuetime.append(queuetime[0])
        queuekey.append(queuekey[0])
        queuetime.pop(0)
        queuekey.pop(0)
Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A = list(map(int, input().split()))
print(min(0, A[0]-A[1]))

Failing test case input:
111 6

Expected output:
105


Actual output:
0


Fixed submission (verdict: Accepted):
A = list(map(int, input().split()))
print(max(0, A[0]-A[1]))

Problem: p03609
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
X, t = map(int, input().split())
print(X-t)


Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
X, t = map(int, input().split())
print(max(X-t, 0))

Problem: p03609
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,b = map(int,input().split())
print((a-b,0)[a>b])

Failing test case input:
1001010010 1000010011

Expected output:
999999


Actual output:
0


Fixed submission (verdict: Accepted):
a,b = map(int,input().split())
print((a-b,0)[a<b])

Problem: p03609
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
X,t=map(int,input().split())
print(X-t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):

X,t=map(int,input().split())
print(max(X-t,0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys
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)]

x, t = na()

print(abs(x - t))

Failing test case input:
000 17

Expected output:
0


Actual output:
17


Fixed submission (verdict: Accepted):
import sys
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)]

x, t = na()

print((x - t) if x > t else 0)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X, t = map(int, input().split())
print(X - t)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
X, t = map(int, input().split())
print(max(X - t, 0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x, t = map(int, input().split())
print(x - t)


Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
x, t = map(int, input().split())
print(x - t if x >= t else 0)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X, t = map(int, input().split())
print(X-t)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
X, t = map(int, input().split())
print(max(X-t, 0))
Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def examA():
    X, t = LI()
    ans = X-t
    print(ans)


import sys
import copy
import bisect
import heapq
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
def examA():
    X, t = LI()
    ans = max(X-t,0)
    print(ans)


import sys
import copy
import bisect
import heapq
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Problem: p03609
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
x, t = (int(i) for i in input().split())
print(min(x-t,0))

Failing test case input:
111 3

Expected output:
108


Actual output:
0


Fixed submission (verdict: Accepted):
x, t = (int(i) for i in input().split())
print(max(x-t,0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

x, t = map(int, input().split())
print(min(x-t, 0))

Failing test case input:
1100001101 0111000100

Expected output:
989001001


Actual output:
0


Fixed submission (verdict: Accepted):

x, t = map(int, input().split())
print(max(x-t, 0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X,t = map(int,input().split())
print(X-t)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
X,t = map(int,input().split())
print(max(0,X-t))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X,t=map(int,input().split())
print(X-t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
X,t=map(int,input().split())
print(max(X-t,0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

x,t=map(int,input().split())
print(max(t-x,0))

Failing test case input:
7 -6

Expected output:
13


Actual output:
0


Fixed submission (verdict: Accepted):

x,t=map(int,input().split())
print(max(x-t,0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X, t = map(int, input().split())
print(min(0, X-t))

Failing test case input:
101 12

Expected output:
89


Actual output:
0


Fixed submission (verdict: Accepted):
X, t = map(int, input().split())
print(max(0, X-t))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b=map(int,input().split())
print(a-b)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
a,b=map(int,input().split())
print(0 if a-b < 0 else a-b)
Problem: p03609
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
a,b = map(int,input().split())
print(min(a-b,0))

Failing test case input:
100 4

Expected output:
96


Actual output:
0


Fixed submission (verdict: Accepted):
a,b = map(int,input().split())
print(max(a-b,0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x, t = map(int, input().split())
print(x - t)


Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
x, t = map(int, input().split())
print(max(x - t, 0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b=map(int,input().split())
print(max(0,b-a))

Failing test case input:
1001000010 1000010011

Expected output:
989999


Actual output:
0


Fixed submission (verdict: Accepted):
a,b=map(int,input().split())
print(max(0,a-b))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X, t = map(int, input().split())
if X > t:
    print('X - t')
else:
    print('0')

Failing test case input:
1001000010 1000010000

Expected output:
990010


Actual output:
X - t


Fixed submission (verdict: Accepted):
X, t = map(int, input().split())
if X > t:
    print(X - t)
else:
    print('0')

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

X, t = map(int, input().split(' '))
ans = X - t
print(ans)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
X, t = map(int, input().split(' '))
ans = X - t
if ans < 0:
    ans = 0
print(ans)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x, t = (int(i) for i in input().split())

print(min(x-t, 0))

Failing test case input:
1101110011 1101011000

Expected output:
99011


Actual output:
0


Fixed submission (verdict: Accepted):
x, t = (int(i) for i in input().split())

print(max(x-t, 0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x, t = map(int, input().split())
print(x - t)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
x, t = map(int, input().split())
print(x - t if x - t >= 0 else 0)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X, t=[int(i) for i in input().split()]
if(X-t < 0):
    print('No sands to drop')
else:
    print(X-t)

Failing test case input:
000 17

Expected output:
0


Actual output:
No sands to drop


Fixed submission (verdict: Accepted):
X, t=[int(i) for i in input().split()]
if(X-t < 0):
    print(0)
else:
    print(X-t)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

x, t = map(int, input().split())
print(x-t)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):

x, t = map(int, input().split())
print(max(0,x-t))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X, t = map(int, input().split())
print(X - t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
X, t = map(int, input().split())
print(0 if X < t else X - t)
Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b = map(int, input().split())
print(max(0, b-a))

Failing test case input:
1100101101 0110000100

Expected output:
990101001


Actual output:
0


Fixed submission (verdict: Accepted):
a, b = map(int, input().split())
print(max(0, a-b))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

X , t = map(int,input().split())

time = X - t
print(time)


Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):

X , t = map(int,input().split())


if X > t:
    time = X - t

else:
    time = 0
print(time)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x, t = map(int, input().split())
print(x - t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
x, t = map(int, input().split())
print(max(x - t, 0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X, t = map(int, input().split())

if X >= t:
    print(t)
else:
    print(X)
    


Failing test case input:
1100101101 0110010100

Expected output:
990091001


Actual output:
110010100


Fixed submission (verdict: Accepted):
X, t = map(int, input().split())

if X >= t:
    print(X - t)
else:
    print(0)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b=map(int,input().split())
print(min(a-b,0))

Failing test case input:
1001011001 1001010111

Expected output:
890


Actual output:
0


Fixed submission (verdict: Accepted):
a,b=map(int, input().split())
print(max(a-b,0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

x,t =iim()
print(min(0,x-t))

Failing test case input:
1101100111 1011111001

Expected output:
89989110


Actual output:
0


Fixed submission (verdict: Accepted):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

x,t =iim()
print(max(0,x-t))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
inputArr = input().split(" ")
X =  inputArr[0]
t =  inputArr[1]
remain_sand = int(X) - int(t)
if remain_sand > 0 :
  print(remain_sand)
else :
  0

Failing test case input:
000 17

Expected output:
0


Actual output:

Fixed submission (verdict: Accepted):
inputArr = input().split(" ")
X =  inputArr[0]
t =  inputArr[1]
remain_sand = int(X) - int(t)
if remain_sand > 0 :
  print(remain_sand)
else :
  print(0)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x,t=map(int,input().split())
print(x-t)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
x,t=map(int,input().split())
print(max(x-t,0))
Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys
MOD = 10 ** 9+7
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())



X, t = mi()
print(X-t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
import sys
MOD = 10 ** 9+7
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())



X, t = mi()
print(max(X-t,0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x,t = map(int,input().split())
print(x-t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
x,t = map(int,input().split())
print(x-t if x>=t else '0')

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x, t = map(int, input().split())
print(x - t if x - t < 0 else 0)

Failing test case input:
1111100111 1011111001

Expected output:
99989110


Actual output:
0


Fixed submission (verdict: Accepted):
x, t = map(int, input().split())
print(x - t if x - t >= 0 else 0)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X, t = map(int , input().split())
if t < X:
  r = 0
else:
  r = X-t

print(int(r))

Failing test case input:
1100001110 0110011100

Expected output:
989990010


Actual output:
0


Fixed submission (verdict: Accepted):
X, t = map(int , input().split())
if t > X:
  r = 0
else:
  r = X-t
 
print(int(r))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X, t = map(int, input().split())
print(X - t)


Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
X, t = map(int, input().split())
print(max(X - t, 0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x, t = map(int, input().split())
print(x-t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
x, t = map(int, input().split())
print(x-t if x-t >0 else 0)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x,t=map(int,input().split())
print(min(0,x-t))

Failing test case input:
1111100101 1011111001

Expected output:
99989100


Actual output:
0


Fixed submission (verdict: Accepted):
x,t=map(int,input().split())
print(max(0,x-t))

Problem: p03609
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x,t = map(int, input().split())
print(x-t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
x,t = map(int, input().split())
print(max(x-t,0))
Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b=map(int, input().split())
if b-a<0:print(0)
else:print(b-a)

Failing test case input:
100 24

Expected output:
76


Actual output:
0


Fixed submission (verdict: Accepted):
a,b=map(int, input().split())
if a-b<0:print(0)
else:print(a-b)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


x, t = list(map(int, input().split()))
print(x - t)


Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):


x, t = list(map(int, input().split()))
print(x - t) if x - t >= 0 else print(0)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X,t = map(int,input().split())
if t >= X:
  print(0)
else:
  print(t - X)

Failing test case input:
48 39

Expected output:
9


Actual output:
-9


Fixed submission (verdict: Accepted):
X,t = map(int,input().split())
if t >= X:
  print(0)
else:
  print(X - t)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X,t = map(int,input().split())
print(min(0,X-t))

Failing test case input:
101 0

Expected output:
101


Actual output:
0


Fixed submission (verdict: Accepted):
X,t = map(int,input().split())
print(max(0,X-t))

Problem: p03609
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
x, t = (int(i) for i in input().split())
print(x-t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
x, t = (int(i) for i in input().split())
print(max(x-t,0))

Problem: p03609
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
X,t = map(int,input().split())
print(X-t)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
X,t = map(int,input().split())
print(max(X-t,0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

x, t = list(map(int, input().rstrip().split()))
print(x - t)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):

x, t = list(map(int, input().rstrip().split()))
print(x - t if x > t else 0)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b = map(int, input().split())
print(max(0, abs(a-b)))

Failing test case input:
48 58

Expected output:
0

Actual output:
10


Fixed submission (verdict: Accepted):
a, b = map(int, input().split())
print(max(0, a-b))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X, t = map(int, input().split())
print(min(X-t, 0))


Failing test case input:
111 -2

Expected output:
113


Actual output:
0


Fixed submission (verdict: Accepted):
X, t = map(int, input().split())
print(max(X-t, 0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x,t=map(int,input().split())
print(x-t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
a,b=map(int,input().split())
print(max(a-b,0))
Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x,t=map(int,input().split())
print(x-t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
x,t=map(int,input().split())
print(x-t if x >= t else 0)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X, t = map(int, input().split())
if X < t:
    print('X - t')
else:
    print('0')

Failing test case input:
1101110011 1101011000

Expected output:
99011


Actual output:
0


Fixed submission (verdict: Accepted):
X, t = map(int, input().split())
if X > t:
    print(X - t)
else:
    print('0')

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def abc072_a():
    x, t = map(int, input().split())
    print(x - t)


abc072_a()

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
def abc072_a():
    x, t = map(int, input().split())
    print(max(x - t, 0))


abc072_a()

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x, t = map(int, input().split())
print(x-t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
x, t = map(int, input().split())
print(max(0, x-t))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x, t = map(int, input().split())
print(min(0, x-t))

Failing test case input:
1101010111 1010111001

Expected output:
90899110


Actual output:
0


Fixed submission (verdict: Accepted):
x, t = map(int, input().split())
print(max(0, x-t))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x, t = map(int, input().split())
if x-t == 0:
    print("0")
else:
    
    print(x-t)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
x, t = map(int, input().split())
if x-t <= 0:
    print("0")
else:
    
    print(x-t)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x, t = map(int, input().split())
print(x-t)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
x, t = map(int, input().split())
print(max(x-t,0))

Problem: p03609
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x, t = map(int, input().split())
print(min(0, x - t))

Failing test case input:
1000100111 0101010100

Expected output:
899090011


Actual output:
0


Fixed submission (verdict: Accepted):
x, t = map(int, input().split())
print(max(0, x - t))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X, t = [ int(i) for i in input().split()]
print(X-t)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
X, t = [ int(i) for i in input().split()]
print(X-t if X-t>0 else 0)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x,t = map(int,input().split())
print(x-t)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
x,t = map(int,input().split())
print(max(x-t,0))
Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b = map(int, input().split())
if b-a > 0:
    print(b-a)
else:
    print(0)


Failing test case input:
1100001101 0111000100

Expected output:
989001001


Actual output:
0


Fixed submission (verdict: Accepted):
a, b = map(int, input().split())
if a-b > 0:
    print(a-b)
else:
    print(0)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x,t = map(int, input().split())
print(x-t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
x,t = map(int, input().split())
print(max(0,x-t))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X, t = map(int, input().split())

print(X-t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
X, t = map(int, input().split())

print(X-t if X >= t else 0)

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X,t = map(int, input().split())
print(X-t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
X,t = map(int, input().split())
print(X-t if X>t else 0)

Problem: p03609
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
x,t=[int(x) for x in input().split()]
print(x-t)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
x,t=[int(x) for x in input().split()]
print(max(0,x-t))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X, t = map(int, input().split())
print(X-t)


Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
X, t = map(int, input().split())
print(max(0, X-t))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b=map(int,input().split())
print(a-b)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
a,b=map(int,input().split())
print(max(0,a-b))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x,t = map(int,input().split());print(x-t)

Failing test case input:
48 58

Expected output:
0

Actual output:
-10


Fixed submission (verdict: Accepted):
x,t = map(int,input().split());print([0,x-t][x-t>0])

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X,t = map(int,input().split(' '))
print(min(X-t,0))

Failing test case input:
1110001100 0010111100

Expected output:
1099890000


Actual output:
0


Fixed submission (verdict: Accepted):
X,t = map(int,input().split(' '))
print(max(X-t,0))

Problem: p03609
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
X,t = map(int,input().split())
print(X-t)

Failing test case input:
000 17

Expected output:
0


Actual output:
-17


Fixed submission (verdict: Accepted):
X,t = map(int,input().split())
print(max(X-t,0))