ZhenlongDai/ACPR huggingface dataset:
Problem: p02385
Buggy submission (Python3, verdict: Wrong Answer):
dice_1 = input().split()
dice_2 = input().split()

rolls = {' ':[0, 1, 2, 3, 4, 5], 
         'W':[2, 1, 5, 0, 4, 3], 
         'N':[1, 5, 2, 3, 0, 4], 
         'E':[3, 1, 0, 5, 4, 2], 
         'S':[4, 0, 2, 3, 5, 1]
        }
orders = [' ', 'N', 'W', 'E', 'S', 'SS']
tf = 0
for order in orders:
    for d in order:
        roll = rolls[d]
        copy_2 = [dice_2[i] for i in roll]
    
    l = [1, 2, 4, 3]
    a0 = copy_2[0] == dice_1[0]
    a1 = copy_2[5] == dice_1[5]
    a2 = ' '.join([copy_2[s]for s in l]) in ' '.join([dice_1[s]for s in l] * 2)
    if  a0 and a1 and a2:
        tf += 1
    else:
        print(order)
        print(dice_1)
        print(copy_2)

if tf>0:
    print('Yes')
else:
    print('No')


Failing test case input:
2 1 0 1 50 -1
5 0 0 0 9 4

Expected output:
No


Actual output:
 
['2', '1', '0', '1', '50', '-1']
['5', '0', '0', '0', '9', '4']
N
['2', '1', '0', '1', '50', '-1']
['0', '4', '0', '0', '5', '9']
W
['2', '1', '0', '1', '50', '-1']
['0', '0', '4', '5', '9', '0']
E
['2', '1', '0', '1', '50', '-1']
['0', '0', '5', '4', '9', '0']
S
['2', '1', '0', '1', '50', '-1']
['9', '5', '0', '0', '4', '0']
SS
['2', '1', '0', '1', '50', '-1']
['9', '5', '0', '0', '4', '0']
No


Fixed submission (verdict: Accepted):
dice_1 = input().split()
dice_2 = input().split()

rolls = {' ':[0, 1, 2, 3, 4, 5], 
         'W':[2, 1, 5, 0, 4, 3], 
         'N':[1, 5, 2, 3, 0, 4], 
         'E':[3, 1, 0, 5, 4, 2], 
         'S':[4, 0, 2, 3, 5, 1]
        }
orders = [' ', 'N', 'W', 'E', 'S', 'NN']
tf = 0
for order in orders:
    copy_2 = dice_2
    for d in order:
        roll = rolls[d]
        copy_2 = [copy_2[i] for i in roll]
    
    l = [1, 2, 4, 3]
    a0 = copy_2[0] == dice_1[0]
    a1 = copy_2[5] == dice_1[5]
    a2 = ' '.join([copy_2[s]for s in l]) in ' '.join([dice_1[s]for s in l] * 2)
    if  a0 and a1 and a2:
        tf += 1






if tf>0:
    print('Yes')
else:
    print('No')
Problem: p02385
Buggy submission (Python3, verdict: Wrong Answer):
def N():
    num=Dice[0]
    Dice[0]=Dice[1]
    Dice[1]=Dice[5]
    Dice[5]=Dice[4]
    Dice[4]=num
def E():
    num=Dice[0]
    Dice[0]=Dice[3]
    Dice[3]=Dice[5]
    Dice[5]=Dice[2]
    Dice[2]=num
def W():
    num=Dice[0]
    Dice[0]=Dice[2]
    Dice[2]=Dice[5]
    Dice[5]=Dice[3]
    Dice[3]=num
def S():
    num=Dice[0]
    Dice[0]=Dice[4]
    Dice[4]=Dice[5]
    Dice[5]=Dice[1]
    Dice[1]=num
Dice=[int(i) for i in input().split()]
Dice2=[int(i) for i in input().split()]
if (Dice[0] in Dice2)==False:
    print('No')
else:
    count=0
    for j in range(6):
        if count%2==0:
            N()
        else:
            W()
        count+=1
        for i in range(4):
            N()
            W()
            S()
            if Dice==Dice2:
                break
    if Dice==Dice2:
        print('Yes')
    else:
        print('No')

Failing test case input:
1 2 3 4 5 6
6 2 4 3 5 1

Expected output:
Yes

Actual output:
No


Fixed submission (verdict: Accepted):
def N():
    num=Dice[0]
    Dice[0]=Dice[1]
    Dice[1]=Dice[5]
    Dice[5]=Dice[4]
    Dice[4]=num
def E():
    num=Dice[0]
    Dice[0]=Dice[3]
    Dice[3]=Dice[5]
    Dice[5]=Dice[2]
    Dice[2]=num
def W():
    num=Dice[0]
    Dice[0]=Dice[2]
    Dice[2]=Dice[5]
    Dice[5]=Dice[3]
    Dice[3]=num
def S():
    num=Dice[0]
    Dice[0]=Dice[4]
    Dice[4]=Dice[5]
    Dice[5]=Dice[1]
    Dice[1]=num
Dice=[int(i) for i in input().split()]
Dice2=[int(i) for i in input().split()]
if (Dice[0] in Dice2)==False:
    print('No')
else:
    for j in range(6):
        if j%2==0:
            N()
        else:
            W()
        for i in range(4):
            N()
            W()
            S()
            if Dice==Dice2:
                break
        if Dice==Dice2:
            break 
    if Dice==Dice2:
        print('Yes')
    else:
        print('No')
Problem: p02385
Buggy submission (Python3, verdict: Wrong Answer):
dice_1 = input().split()
dice_2 = input().split()

rolls = {' ':[0, 1, 2, 3, 4, 5], 
         'W':[2, 1, 5, 0, 4, 3], 
         'N':[1, 5, 2, 3, 0, 4], 
         'E':[3, 1, 0, 5, 4, 2], 
         'S':[4, 0, 2, 3, 5, 1]
        }
orders = [' ', 'N', 'W', 'E', 'S', 'SS']
tf = 0
for order in orders:
    for d in order:
        roll = rolls[d]
        copy_2 = [dice_2[i] for i in roll]
    
    l = [1, 2, 4, 3]
    a0 = copy_2[0] == dice_1[0]
    a1 = copy_2[5] == dice_1[5]
    a2 = ' '.join([copy_2[s]for s in l]) in ' '.join([dice_1[s]for s in l] * 2)
    if  a0 and a1 and a2:
        tf += 1





if tf>0:
    print('Yes')
else:
    print('No')


Failing test case input:
1 2 3 4 5 6
6 2 4 3 5 1

Expected output:
Yes

Actual output:
No


Fixed submission (verdict: Accepted):
dice_1 = input().split()
dice_2 = input().split()

rolls = {' ':[0, 1, 2, 3, 4, 5], 
         'W':[2, 1, 5, 0, 4, 3], 
         'N':[1, 5, 2, 3, 0, 4], 
         'E':[3, 1, 0, 5, 4, 2], 
         'S':[4, 0, 2, 3, 5, 1]
        }
orders = [' ', 'N', 'W', 'E', 'S', 'NN']
tf = 0
for order in orders:
    copy_2 = dice_2
    for d in order:
        roll = rolls[d]
        copy_2 = [copy_2[i] for i in roll]
    
    l = [1, 2, 4, 3]
    a0 = copy_2[0] == dice_1[0]
    a1 = copy_2[5] == dice_1[5]
    a2 = ' '.join([copy_2[s]for s in l]) in ' '.join([dice_1[s]for s in l] * 2)
    if  a0 and a1 and a2:
        tf += 1






if tf>0:
    print('Yes')
else:
    print('No')
Problem: p02385
Buggy submission (Python3, verdict: Wrong Answer):



class Dice:
    def __init__(self, ary):
        self.top, self.south, self.east, self.west, self.north, self.bottom = ary

    def roll_n(self):
        self.top, self.north, self.bottom, self.south = self.south, self.top, self.north, self.bottom

    def roll_e(self):
        self.top, self.east, self.bottom, self.west = self.west, self.top, self.east, self.bottom

    def twist(self):
        self.north, self.east, self.south, self.west = self.west, self.north, self.east, self.south

    def isEqual(self, dice):
        if self.top == dice.top and self.south == dice.south and self.east == dice.east and self.west == dice.west and self.north == dice.north and self.bottom == dice.bottom:
            return True
        else:
            return False

dice1 = Dice(map(int,input().split()))
dice2 = Dice(map(int,input().split()))

flag = False

for i in range(6):
    if i%2 == 0:
        dice1.roll_n()
    else:
        dice1.roll_e()

    for j in range(4):
        if dice1.isEqual(dice2):
            flag = True
        else:
            dice1.twist

    if flag:
        break

if flag:
    print('Yes')
else:
    print('No')

Failing test case input:
1 2 3 4 5 6
6 2 4 3 5 1

Expected output:
Yes

Actual output:
No


Fixed submission (verdict: Accepted):



class Dice:
    def __init__(self, ary):
        self.top, self.south, self.east, self.west, self.north, self.bottom = ary

    def roll_n(self):
        self.top, self.north, self.bottom, self.south = self.south, self.top, self.north, self.bottom

    def roll_e(self):
        self.top, self.east, self.bottom, self.west = self.west, self.top, self.east, self.bottom

    def twist(self):
        self.north, self.east, self.south, self.west = self.west, self.north, self.east, self.south

    def isEqual(self, dice):
        if self.top == dice.top and self.south == dice.south and self.east == dice.east and self.west == dice.west and self.north == dice.north and self.bottom == dice.bottom:
            return True
        else:
            return False

dice1 = Dice(map(int,input().split()))
dice2 = Dice(map(int,input().split()))

flag = False

for i in range(6):
    if i % 2 == 0:
        dice1.roll_n()
    else:
        dice1.roll_e()

    for j in range(4):
        if dice1.isEqual(dice2):
            flag = True
            break
        else:
            dice1.twist()

    if flag:
        break

if flag:
    print('Yes')
else:
    print('No')
Problem: p02385
Buggy submission (Python3, verdict: Wrong Answer):
class Dice():

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

    def north(self):
        self.change([2, 6, 3, 4, 1, 5])

    def west(self):
        self.change([3, 2, 6, 1, 5, 4])

    def east(self):
        self.change([4, 2, 1, 6, 5, 3])

    def south(self):
        self.change([5, 1, 3, 4, 6, 2])

    def change(self, convert):
        num = []
        for i in range(6):
            num.append(self.label[convert[i] - 1])
        self.label = num


def main():
    f = [int(x) for x in input().split()]
    s = [int(x) for x in input().split()]
    dice = Dice(f)
    labels = []
    for i in range(4):
        dice.north()
        labels.append(dice.label)
    for i in range(3):
        dice.west()
        if i != 1:
            labels.append(dice.label)
    if s in labels:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Failing test case input:
1 2 3 4 5 6
6 2 4 3 5 1

Expected output:
Yes

Actual output:
No


Fixed submission (verdict: Accepted):
class Dice():

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

    def north(self):
        self.change([2, 6, 3, 4, 1, 5])

    def west(self):
        self.change([3, 2, 6, 1, 5, 4])

    def east(self):
        self.change([4, 2, 1, 6, 5, 3])

    def south(self):
        self.change([5, 1, 3, 4, 6, 2])

    def change(self, convert):
        num = []
        for i in range(6):
            num.append(self.label[convert[i] - 1])
        self.label = num


def main():
    f = [int(x) for x in input().split()]
    s = [int(x) for x in input().split()]
    dice = Dice(f)
    labels = []
    for i in range(6):
        if i < 4:
            dice.north()
        elif i == 4:
            dice.east()
            dice.south()
        elif i == 5:
            dice.south()
            dice.south()
        for j in range(4):
            dice.west()
            labels.append(dice.label)
    if s in labels:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()
Problem: p02385
Buggy submission (Python3, verdict: Wrong Answer):

def r(D,s):
    if s==0:
        t=D[0]
        D[0]=D[1]
        D[1]=D[5]
        D[5]=D[4]
        D[4]=t
    elif s==2:
        t=D[0]
        D[0]=D[4]
        D[4]=D[5]
        D[5]=D[1]
        D[1]=t        
    elif s==3:
        t=D[0]
        D[0]=D[3]
        D[3]=D[5]
        D[5]=D[2]
        D[2]=t        
    elif s==1:
        t=D[0]
        D[0]=D[2]
        D[2]=D[5]
        D[5]=D[3]
        D[3]=t
    elif s==4:
        D=r(r(D,1),1)
    return D
def ch(C,D):
    k=0
    while k<6 and C[k]==D[k]:
        k+=1
    if k==6:
        return 1
    else:
        return 0
C=[int(i) for i in input().split()]
D=[int(i) for i in input().split()]
nd=0
if ch(C,D)==1:
    nd=1
i=0
while i<4 and nd==0:
    D=r(D,i)
    j=i+1
    j%=4
    k=0
    while k<3 and nd==0:
        D=r(D,j)
        if ch(C,D)==1:
            nd=1
        k+=1
    D=r(D,j)
    m=i+2
    m
    D=r(D,m)
    i+=1
i=0
while nd==0 and i<4:
    D=r(r(D,i),i)
    if ch(C,D)==1:
        nd=1
    D=r(r(D,i),i)
    i+=1
if nd==1:
    p="Yes"
else:
    p="No"
print(p)

Failing test case input:
1 2 3 4 5 6
6 2 4 3 5 1

Expected output:
Yes

Actual output:
No


Fixed submission (verdict: Accepted):

def r(D,s):
    if s==0:
        t=D[0]
        D[0]=D[1]
        D[1]=D[5]
        D[5]=D[4]
        D[4]=t
    elif s==2:
        t=D[0]
        D[0]=D[4]
        D[4]=D[5]
        D[5]=D[1]
        D[1]=t        
    elif s==3:
        t=D[0]
        D[0]=D[3]
        D[3]=D[5]
        D[5]=D[2]
        D[2]=t        
    elif s==1:
        t=D[0]
        D[0]=D[2]
        D[2]=D[5]
        D[5]=D[3]
        D[3]=t
    elif s==4:
        D=r(r(D,1),1)
    return D
def ch(C,D):
    k=0
    while k<6 and C[k]==D[k]:
        k+=1
    if k==6:
        return 1
    else:
        return 0
C=[int(i) for i in input().split()]
D=[int(i) for i in input().split()]
nd=0
if ch(C,D)==1:
    nd=1
i=0
while i<4 and nd==0:
    D=r(D,i)
    j=i+1
    j%=4
    k=0
    if ch(C,D)==1:
        nd=1
 
    
    while k<3 and nd==0:
        D=r(D,j)
        if ch(C,D)==1:
            nd=1
        k+=1
  
        
    D=r(D,j)
 
   
    m=i+2
    m%=4
 
    
    D=r(D,m)
 
 
    i+=1
i=0
while nd==0 and i<4:
    D=r(D,0)
    D=r(D,1)
    D=r(D,0)
    if ch(C,D)==1:
        nd=1
    D=r(r(D,0),0)
    if ch(C,D)==1:
        nd=1
    i+=1
if nd==1:
    p="Yes"
else:
    p="No"
print(p)
Problem: p02385
Buggy submission (Python3, verdict: Wrong Answer):



class Dice:
    def __init__(self, n):
        self.upper    = n[0]
        self.backward = n[1]
        self.right    = n[2]
        self.left     = n[3]
        self.ahead    = n[4]
        self.bottom   = n[5]

    def roll_north(self):
        self.upper, self.ahead, self.bottom, self.backward = self.backward, self.upper, self.ahead, self.bottom

    def roll_south(self):
        self.upper, self.ahead, self.bottom, self.backward = self.ahead, self.bottom, self.backward, self.upper

    def roll_east(self):
        self.upper, self.right, self.bottom, self.left = self.left, self.upper, self.right, self.bottom

    def roll_west(self):
        self.upper, self.right, self.bottom, self.left = self.right, self.bottom, self.left, self.upper

    def roll_side(self):
        self.ahead, self.right, self.backward, self.left = self.left, self.ahead, self.right, self.backward


def match_dice(dice1, dice2):
    for i in range(4):
        dice1.roll_north()

        for j in range(4):
            dice1.roll_east()

            for k in range(4):
                dice1.roll_side()

                if dice1 is dice2:
                    return 0
    return 1


dice1 = Dice(list(map(int, input().split())))
dice2 = Dice(list(map(int, input().split())))
result = match_dice(dice1, dice2)

if result is 0:
    print('Yes')
else:
    print('No')
    


Failing test case input:
1 2 3 4 5 6
6 2 4 3 5 1

Expected output:
Yes

Actual output:
No


Fixed submission (verdict: Accepted):



class Dice:
    def __init__(self, n):
        self.upper    = n[0]
        self.backward = n[1]
        self.right    = n[2]
        self.left     = n[3]
        self.ahead    = n[4]
        self.bottom   = n[5]

    def __eq__(self, other):
        return self.upper == other.upper and self.backward == other.backward and self.right == other.right and self.left == other.left and self.ahead == other.ahead and self.bottom == other.bottom

    def roll_north(self):
        self.upper, self.ahead, self.bottom, self.backward = self.backward, self.upper, self.ahead, self.bottom

    def roll_south(self):
        self.upper, self.ahead, self.bottom, self.backward = self.ahead, self.bottom, self.backward, self.upper

    def roll_east(self):
        self.upper, self.right, self.bottom, self.left = self.left, self.upper, self.right, self.bottom

    def roll_west(self):
        self.upper, self.right, self.bottom, self.left = self.right, self.bottom, self.left, self.upper

    def roll_side(self):
        self.ahead, self.right, self.backward, self.left = self.left, self.ahead, self.right, self.backward


def match_dice(dice1, dice2):
    for i in range(4):
        dice1.roll_north()

        for j in range(4):
            dice1.roll_east()

            for k in range(4):
                dice1.roll_side()

                if dice2 == dice1:
                    return 0
    return 1


dice1 = Dice(list(map(int, input().split())))
dice2 = Dice(list(map(int, input().split())))
result = match_dice(dice1, dice2)

if result is 0:
    print('Yes')
else:
    print('No')
Problem: p02385
Buggy submission (Python3, verdict: Wrong Answer):


import random


class Dice() :

    mask = {'N':(1,5,2,3,0,4), 'E':(3,1,0,5,4,2),
            'W':(2,1,5,0,4,3), 'S':(4,0,2,3,5,1)}
    way = ("N","E","W","S")

    def __init__(self, data):
        self.label = data

    def move(self, data):
        self.label = [self.label[idx] for idx in self.mask[data]]

    def get_up(self):
        return self.label[0]

    def compare(self, dice2):
        ok = False
        for i in range(1000):
            check = True
            for i2 in range(6):
                if self.label[i2] == dice2.label[i2] :
                    continue
                else:
                    check = False
                    break

            if check :
                ok = True
                break
            else:
                self.move(self.way[random.randint(0,3)])
        return ok

dice1 = Dice(input().split())
dice2 = Dice(input().split())

if dice1.compare(dice2) :
    print ("OK")
else:
    print ("NG")


Failing test case input:
1 2 0 0 85 -1
5 0 1 1 16 4

Expected output:
No


Actual output:
NG


Fixed submission (verdict: Accepted):


import random


class Dice() :

    mask = {'N':(1,5,2,3,0,4), 'E':(3,1,0,5,4,2),
            'W':(2,1,5,0,4,3), 'S':(4,0,2,3,5,1)}
    way = ("N","E","W","S")

    def __init__(self, data):
        self.label = data

    def move(self, data):
        self.label = [self.label[idx] for idx in self.mask[data]]

    def get_up(self):
        return self.label[0]

    def compare(self, dice2):
        ok = False
        for i in range(1000):
            check = True
            for i2 in range(6):
                if self.label[i2] == dice2.label[i2] :
                    continue
                else:
                    check = False
                    break

            if check :
                ok = True
                break
            else:
                self.move(self.way[random.randint(0,3)])
        return ok

dice1 = Dice(input().split())
dice2 = Dice(input().split())

if dice1.compare(dice2) :
    print ("Yes")
else:
    print ("No")
Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x,y=map(int,input().split())
for i in range(100):
    if i*2+(x-i)*4==y:
        print("Yes")
        break
else:
    print("No")

Failing test case input:
25 -2

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
x,y=map(int,input().split())
for i in range(x+1):
    if i*2+(x-i)*4==y:
        print("Yes")
        break
else:
    print("No")

Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import sys

def I(): return int(sys.stdin.readline().rstrip())
def LI():return list(map(int,sys.stdin.readline().rstrip().split()))
def LS():return list(sys.stdin.readline().rstrip().split())

def main():
  X,Y = LI()[:]
  

  if ((Y-2*X) % 2) == 0:
    a = (Y-2*X) / 2
    if a<=X:
      print('Yes')
      exit()
  
  print('No')

if __name__ == '__main__':
	main()


Failing test case input:
51 -2

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
import sys

def I(): return int(sys.stdin.readline().rstrip())
def LI():return list(map(int,sys.stdin.readline().rstrip().split()))
def LS():return list(sys.stdin.readline().rstrip().split())

def main():
  X,Y = LI()[:]
  

  if ((Y-2*X) % 2) == 0:
    a = (Y-2*X) / 2
    if a<=X and a>=0:
      print('Yes')
      exit()
  
  print('No')

if __name__ == '__main__':
	main()

Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
X, Y = map(int, input().split())

crane = (4 * X - Y) / 2


def is_integer_num(n):
    if isinstance(n, int):
        return True
    if isinstance(n, float):
        return n.is_integer()
    return False


if is_integer_num(crane) and crane > 0:
    print("Yes")
else:
    print("No")


Failing test case input:
16 -4

Expected output:
No


Actual output:
Yes


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

crane = (4 * X - Y) / 2
turtle = (Y - 2 * X) / 2


def is_integer_num(n):
    if isinstance(n, int):
        return True
    if isinstance(n, float):
        return n.is_integer()
    return False


if is_integer_num(crane) and crane >= 0 and is_integer_num(turtle) and turtle >= 0:
    print("Yes")

else:
    print("No")

Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x,y = map(int,input().split())
if x==1 and y==2 and y==4:
  print("Yes")
else:
  if y%2==1:
    print("No")
  else:
    if y<=x*4:
      print("Yes")
    else:
      print("No")

Failing test case input:
16 -4

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
x,y = map(int,input().split())
if x==1 and ( y==2 or y==4):
  print("Yes")
else:
  if y%2==1:
    print("No")
  else:
    if y<=x*4 and (y>=(x*2)):
      print("Yes")
    else:
      print("No")
Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x,y = list(map(int,input().split()))

if ((4 * x) - y) % 2 == 0 and y >= 2 * x and  y >= 4 * x:
  print('Yes')
else:
  print('No')

Failing test case input:
5 110

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
x,y = list(map(int,input().split()))

if ((4 * x) - y) % 2 == 0 and y >= 2 * x and  y <= 4 * x:
  print('Yes')
else:
  print('No')

Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x, y = map(int, input().split())

if (y/2 - x) > x:
  print('No')
else:
  print('Yes')


Failing test case input:
84 -1

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
x, y = map(int, input().split())

if 2*x <= y <= 4*x and y % 2 ==0 :
  print('Yes')
else:
  print('No')

Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x,y = list(map(int, input("").split()))

if 4 * x < y:
    print("No")
else:
    if y % 2 == 0:
        print("Yes")
    else:
        print("No")

Failing test case input:
32 -4

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
x,y = list(map(int, input("").split()))

if 4 * x < y:
    print("No")
else:
    if 2 * x <= y:
        if y % 2 == 0:
            print("Yes")
        else:
            print("No")
    else:
        print("No")

Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x, y = map(int, input().split())

tmp = 4 * x - y
f = 0
if tmp % 2 == 0 and tmp >= 0:
    crane = tmp % 2
    turtle = x - crane
    if x >= 0:
        f = 1
    else:
        pass
else:
    pass

if f == 1:
    print('Yes')
else: 
    print('No')

Failing test case input:
25 -2

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
x, y = map(int, input().split())

tmp = 4 * x - y
f = 0
if tmp % 2 == 0 and tmp >= 0:
    crane = tmp / 2
    turtle = x - crane
    if turtle >= 0:
        f = 1
    else:
        pass
else:
    pass

if f == 1:
    print('Yes')
else: 
    print('No')

Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x,y = map(int, input().split())
ans=0
for i in range(x):
  if (y-i*2)/2<=x:
    ans=1
if ans:
  print('Yes')
else:
  print('No')

Failing test case input:
84 -1

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
x,y = map(int, input().split())
ans=0
for i in range(x+1):
  if (y-4*i)
    ans=1
print('Yes' if ans else 'No')
Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,b = map(int,input(). split ())
if not a % 2 == 0 and not b % 2 == 0:
    print('NO')
elif a > 100 or b > 100:
    print('NO')
elif not isinstance(a, int) or not isinstance(b, int):
    print('NO')
elif 2 * a <= b <= 4 * a:
    print('YES')
else:
    print('NO')

Failing test case input:
84 -1

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
a,b = map(int,input(). split ())
if not b % 2 == 0:
    print('No')
elif a > 100:
    print('No')
elif b > 100:
    print('No')
elif a < 1:
    print('No')
elif b < 1:
    print('No')
elif not isinstance(a, int):
    print('No')
elif not isinstance(b, int):
    print('No')
elif 2 * a <= b <= 4 * a:
    print('Yes')
else:
    print('No')

Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n, m = map(int,input().split())
if m <= 2**n and m%2 == 0 and m != 0:
    print("Yes")
else:
    print("No")

Failing test case input:
32 -4

Expected output:
No


Actual output:
Yes


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

if m <= 4*n and m >= 2*n and m%2 == 0 and n <= 50 and n < m:
    print("Yes")
else:
    print("No")

Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
X,Y = map(int, input().split())
if Y%2==1:
    print("NO")
else:
    kame=Y
    Y-=(kame*4)
    turu=Y
    if (turu+kame)==X:
        print("Yes")
    else:
        print('No')


Failing test case input:
5 101

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
X,Y = map(int, input().split())
if Y%2==1:
    print('No')
else:
    if X*2<=Y and Y<=X*4:
        print('Yes')
    else:
        print('No')

Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x, y = map(int, input().split())

if (4*x >= y and y%2 == 0):
    print("Yes")
else:
    print("No")

Failing test case input:
32 -4

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
x, y = map(int, input().split())

if (4*x >= y >= 2*x and y % 2 == 0):
    print("Yes")
else:
    print("No")

Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x, y = map(int, input().split())
if y%2 == 1:
  print("NO")
else:
  if y >= 2*x and y <= 4*x:
    print("Yes")
  else:
    print("No")

Failing test case input:
126 -1

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
x, y = map(int, input().split())
if y%2 == 1:
  print("No")
else:
  if y >= 2*x and y <= 4*x:
    print("Yes")
  else:
    print("No")
Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,b = map(int,input().split())

turu = 2
kame = 4
flag =0

for x in range(a + 1):
    for y in range(a + 1):
        if kame * x + turu * y == b or x + y <= a:
            flag += 1

if flag == 0:
    print("No")
else:
    print("Yes")

Failing test case input:
51 -2

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):

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

turu = 2
kame = 4
flag = False
for i in range(0, X + 1): 
    
    turu_num = X - i
    
    leg_total = kame * i + turu_num * turu
    
    if(leg_total == Y):
      flag = True
      break




if flag:
    print("Yes")
else:
    print("No")

Problem: p02640
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
x, y = map(int, input().split())
ans = 'no'
for a in range(x + 1):
    b = x - a
    if 2*a + 4*b == y:
        ans = 'yes'
print(ans)

Failing test case input:
51 -2

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
x, y = map(int, input().split())
ans = 'No'
for a in range(x + 1):
    b = x - a
    if 2*a + 4*b == y:
        ans = 'Yes'
print(ans)

Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def animal(x,y):
    if x*4 >= y:
        return "Yes"
    return "No"

if __name__ == "__main__":
    x,y = map(int,input().split())
    print(animal(x,y))

Failing test case input:
126 -1

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
def animal(x,y):
    if x*4==y or x*2==y:
        return "Yes"
    for i in range(1,x+1):
        if ((x-i)*4 + i*2) == y:
            return "Yes"
    return "No"

if __name__ == "__main__":
    x,y = map(int,input().split())
    print(animal(x,y))

Problem: p02640
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
import sys
input = sys.stdin.readline
X, Y = map(int, input().split())
for i in range(101):
  j = X - i
  if i * 2 + j * 4 == Y:
    print("Yes")
    exit(0)
print("No")

Failing test case input:
32 -4

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
import sys
input = sys.stdin.readline
X, Y = map(int, input().split())
for i in range(X + 1):
  j = X - i
  if i * 2 + j * 4 == Y:
    print("Yes")
    exit(0)
print("No")

Problem: p02640
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
x, y = map(int, input().split())
ret = 'No'
for i in range(x):
    rem = y - 2*i
    if rem%4 == 0:
        ret = 'Yes'
        break
print(ret)

Failing test case input:
16 -4

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
x, y = map(int, input().split())
ret = 'No'
for i in range(x+1):
    rem = y - 2*i
    if 4*(x - i) == rem:
        ret = 'Yes'
        break
print(ret)
Problem: p02640
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
lst = s.split()

ex1 = int(lst[0])
ex2 = int(lst[1])
ret = "no"

for i in range(ex1+1):
    if 4 * (ex1 - i) + 2 * i == ex2:
        ret= "yes"

print(ret)


Failing test case input:
5 110

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
s = input()
lst = s.split()

ex1 = int(lst[0])
ex2 = int(lst[1])
ret = "No"

for i in range(ex1+1):
    if 4 * (ex1 - i) + 2 * i == ex2:
        ret= "Yes"

print(ret)
Problem: p02633
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
def gcd(a,b):
  if b == 0:return a
  return gcd(b,a%b)

a = int(input())
print(360/gcd(360,a))

Failing test case input:
578

Expected output:
180


Actual output:
180.0


Fixed submission (verdict: Accepted):
def gcd(a,b):
  if b == 0:return a
  return gcd(b,a%b)
 
a = int(input())
print(360

Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n=int(input())
for i in range(360):
  if (i*n+n)%360==0:
    print(i)
    break

Failing test case input:
537

Expected output:
120


Actual output:
119


Fixed submission (verdict: Accepted):
n=int(input())
for i in range(360):
  if (i*n+n)%360==0:
    print(i+1)
    break

Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):







def main():
    x = int(input())
    ans = 360 
    print(ans)
    return

if __name__ == "__main__":
    main()

Failing test case input:
350

Expected output:
36


Actual output:
360


Fixed submission (verdict: Accepted):







def main():
    x = int(input())
    k = 1
    while ( x * k ) % 360:
        k += 1
    print(k)
    return

if __name__ == "__main__":
    main()

Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
X = int(input())

K = 1
dire = X
while True:
  if (dire % 180) == 0:
    break
  K+=1
  dire+=X

  
print(K)

Failing test case input:
2579

Expected output:
360


Actual output:
180


Fixed submission (verdict: Accepted):
X = int(input())

K = 1
dire = X
while True:
  if (dire % 360) == 0:
    break
  K+=1
  dire+=X

  
print(K)

Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
X= int(input())

if 360 % X != 0:
  print(360)
else:
  print(int(360/X))

Failing test case input:
1162

Expected output:
180


Actual output:
360


Fixed submission (verdict: Accepted):
import math

X= int(input())
g = math.gcd(360,X)

if 360 % g != 0:
  print(360)
else:
  print(int(360/g))

Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = int(input())
b = 0
for i in range(1,361):
    i += 1
    ans = i * a
    if ans == 360:
        print(int(i))


Failing test case input:
1874

Expected output:
180


Actual output:
no output


Fixed submission (verdict: Accepted):
a = int(input())
for i in range(1,361):
    if i * a % 360 == 0:
        print(int(i))
        break

Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a=int(input())
x = 0
i = 1
while(1):
  x += a
  i += 1
  x %= 360
  if x:
    continue
  else:
    print(i)
    quit()

Failing test case input:
1369

Expected output:
360


Actual output:
361


Fixed submission (verdict: Accepted):
a=int(input())
x = 0
i = 0
while(1):
  x += a
  i += 1
  x %= 360
  if x:
    continue
  else:
    print(i)
    quit()

Problem: p02633
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
from math import gcd
x=int(input())
g=gcd(360,x)
print(360/g)
  

Failing test case input:
536

Expected output:
45


Actual output:
45.0


Fixed submission (verdict: Accepted):
import math
x=int(input())
g=math.gcd(360,x)
print(360
Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
X=int(input())
Y =360
while 1:
	if Y % X == 0:
		print(Y/X)
		break
	else:
		Y += 360

Failing test case input:
690

Expected output:
12


Actual output:
12.0


Fixed submission (verdict: Accepted):
X=int(input())
Y =360
while 1:
	if Y % X == 0:
		print(Y
		break
	else:
		Y += 360

Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = int(input())

x = a
i = 1

while x % 180 != 0:
    x += a
    i += 1

print(i*2)

Failing test case input:
1168

Expected output:
45


Actual output:
90


Fixed submission (verdict: Accepted):
a = int(input())

x = a
i = 1

while x % 360 != 0:
    x += a
    i += 1

print(i)

Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
from math import ceil
x = int(input())
print(ceil(360/x))


Failing test case input:
2383

Expected output:
360


Actual output:
1


Fixed submission (verdict: Accepted):
from math import ceil
x = int(input())
n = 360
while(n%x):
	n+=360

print(n

Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x = int(input())

for n in range(1, 10000):
    k, y = divmod(360*n, (180-x))
    if y == 0:
        print(k)
        break


Failing test case input:
1527

Expected output:
120


Actual output:
-120


Fixed submission (verdict: Accepted):
x = int(input())

for k in range(1, 10000):
    if x*k % 360 == 0:
        print(k)
        break

Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x=int(input(""))
import math
a=math.gcd(360,x)
print(int(360*x/a/a))

Failing test case input:
408

Expected output:
15


Actual output:
255


Fixed submission (verdict: Accepted):
x=int(input(""))
import math
a=math.gcd(360,x)
print(int(360/a))

Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
X=int(input())
K=0
a=0
while True:
  a+=X
  K+=1
  if K%360==0:
    break
print(K)

Failing test case input:
690

Expected output:
12


Actual output:
360


Fixed submission (verdict: Accepted):
X=int(input())
K=0
a=0
while True:
  a+=X
  K+=1
  if a%360==0:
    break
print(K)

Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):


X = int(input())

index = 1
while True:
    if X * index % 180 == 0:
        print(index*2)
        break
    index += 1


Failing test case input:
536

Expected output:
45


Actual output:
90


Fixed submission (verdict: Accepted):


X = int(input())

index = 1
while True:
    if X * index % 360 == 0:
        print(index)
        break
    index += 1

Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x = int(input())
for i in range(1, 360):
    if (x*i)%360 == 0:
        print(i)
        exit()
        

Failing test case input:
791

Expected output:
360


Actual output:
no output


Fixed submission (verdict: Accepted):
x = int(input())
for i in range(1, 360+1):
    if (x*i)%360 == 0:
        print(i)
        exit()
Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
X = int(input())

for k in range(1, 361):
    if ((180 - X) * k) % 360 == 0:
        print(k)
        break

Failing test case input:
1780

Expected output:
18


Actual output:
9


Fixed submission (verdict: Accepted):
X = int(input())

for k in range(1, 361):
    if (X * k) % 360 == 0:
        print(k)
        break

Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):

import math
 
def Strider():
 
    NumA = int(input())
 
    count = 360/NumA
    
    NumB = 1
    
    while (count == 0):
        NumB = NumB + 1
        count = 360*NumB/NumA
    
    print(int(count))
 
if __name__ == '__main__':
    Strider()

Failing test case input:
1158

Expected output:
60


Actual output:
0


Fixed submission (verdict: Accepted):

import math
 
def Strider():
 
    NumA = int(input())
 
    count = 360/NumA
    
    NumB = 1
    
    while ((360*NumB % NumA) != 0):
        NumB = NumB + 1
        count = 360*NumB/NumA
    
    print(int(count))
 
if __name__ == '__main__':
    Strider()

Problem: p02633
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
X=int(input())
i=1
while True:
  X=X*i
  if X%360==0:
    print(i)
    break
  i+=1

Failing test case input:
1780

Expected output:
18


Actual output:
6


Fixed submission (verdict: Accepted):
X=int(input())
i=1
a=0
while True:
  a=a+X
  if a%360==0:
    print(i)
    break
  i+=1

Problem: p02633
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
import math
x=int(input())
ct=0
for i in range(1000):
  ct+=(180-x)
  if ct%360==0:
    print(i+1)
    exit()

Failing test case input:
1780

Expected output:
18


Actual output:
9


Fixed submission (verdict: Accepted):
import math
x=int(input())
ct=0
for i in range(1000):
  ct+=x
  if ct%360==0:
    print(i+1)
    exit()
Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
l = []
l= list(map(int,input().split()))
ls = sorted(l)
a = ls[0]
b = ls[1]
c = ls[2]

if a + b < c:
	print("Yes")
else:
  	print("No")

Failing test case input:
-2 0 -2

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
l = []
l= list(map(int,input().split()))
a = l[0]
b = l[1]
c = l[2]

if a == b and a == c:
	print("Yes")
else:
  	print("No")

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, C = map(int, input().split())
if A == B and B == C:
    print('YES')
else:
    print('NO')


Failing test case input:
8 -1 2

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
A, B, C = map(int, input().split())
if A == B and B == C:
    print('Yes')
else:
    print('No')

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A ,B ,C =map(int,input().split())
if A==B and B==C:
     print('YES')
else :
     print('NO')


Failing test case input:
8 -1 2

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
A,B,C=map(int,input().split())
if A==B and B==C:
     print('Yes')
else :
     print('No')

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, C = map(int, input().split(' '))

if A**2 + B**2 == C**2:
    print('Yes')
else:
    print('No')


Failing test case input:
-2 0 -2

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
A, B, C = map(int, input().split(' '))

if A == B and B == C:
    print('Yes')
else:
    print('No')

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
inpl = lambda: list(map(int,input().split()))

A, B, C = inpl()
if A==B==C:
    print('YES')
else:
    print('NO')

Failing test case input:
-3 10 -1

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
inpl = lambda: list(map(int,input().split()))

A, B, C = inpl()
if A==B==C:
    print('Yes')
else:
    print('No')

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
i = input().split()
if (float(i[0]) ==float(i[1])) and (float(i[0]) ==float(i[2])):
  print('YES')
else:
  print('NO')

Failing test case input:
-2 -1 -2

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
i = input().split()
if (float(i[0]) ==float(i[1])) and (float(i[0]) ==float(i[2])):
  print('Yes')
else:
  print('No')

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, C = map(int, input().split())
print('YES' if A == B == C else 'NO')

Failing test case input:
1 7 2

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
A, B, C = map(int, input().split())
print('Yes' if A == B == C else 'No')
Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
lst = input().split()

cor_lst = sorted(lst)



if int(cor_lst[0])+int(cor_lst[1]) > int(cor_lst[2]):
  print("Yes")
else:
  print("No")

Failing test case input:
1 15 3

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
lst = input().split()

cor_lst = sorted(lst)



if int(cor_lst[0]) == int(cor_lst[1]) and int(cor_lst[0]) == int(cor_lst[2]):
  print("Yes")
else:
  print("No")

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def regtri(a, b, c):
    if a == b and b == c:
        return 'Yes'
    else:
        return 'No'
 
a, b, c = (int(i) for i in input().split())
regtri(a, b, c)

Failing test case input:
-3 0 -1

Expected output:
No


Actual output:
no output


Fixed submission (verdict: Accepted):
def regtri(a, b, c):
    if a == b and b == c:
        return 'Yes'
    else:
        return  'No'
 
a, b, c = (int(i) for i in input().split())
print(regtri(a, b, c))

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
ABC = list(map(int, input().split()))
if ABC[0] + ABC[1] < ABC[2] or ABC[1] + ABC[2] < ABC[0] or ABC[0] + ABC[2] < ABC[1]:
  print("Yes")
else:
  print("No")

Failing test case input:
-5 1 -1

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
ABC = list(map(int, input().split()))
if ABC[0] == ABC[1] and ABC[1]==ABC[2] and ABC[2]==ABC[0]:
  print("Yes")
else:
  print("No")

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, c = input().split()

if(a+b > c and a+c > b and b+c > a):
    print('yes')
else:
    print('no')


Failing test case input:
-9 -2 0

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
a, b, c = input().split()

if(a == b and b == c):
    print('Yes')
else:
    print('No')

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A = list(map(int,input().split()))
if A[0] + A[1] > A[2]:
    print("Yes")
else:
    print("No")

Failing test case input:
1 13 3

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
A = list(map(int,input().split()))
if A[0] == A[1] == A[2]:
    print("Yes")
else:
    print("No")

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
i = input().split()
if (int(i[0]) ==int(i[1])) and (int(i[0]) ==int(i[2])):
  print('YES')
else:
  print('NO')

Failing test case input:
-2 1 -2

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
i = input().split()
if (float(i[0]) ==float(i[1])) and (float(i[0]) ==float(i[2])):
  print('Yes')
else:
  print('No')

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys

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

if A == B:
    if A == C:
        print('YES')
        sys.exit()

print('NO')


Failing test case input:
1 13 3

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
import sys

A, B, C = input().split()
a = int(A)
b = int(B)
c = int(C)

if a == b:
    if a == c:
        print('Yes')
        sys.exit()

print('No')
Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
i = input().split()
if int (int(i[0]) ==int(i[1])) and (int(i[0]) ==int(i[2])):
  print('YES')
else:
  print('NO')

Failing test case input:
-2 10 3

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
i = input().split()
if (float(i[0]) ==float(i[1])) and (float(i[0]) ==float(i[2])):
  print('Yes')
else:
  print('No')

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys

A, B, C = input().split()
a = int(A)
b = int(B)
c = int(C)

if a == b:
    if a == c:
        print('YES')
        sys.exit()
        
print('NO')


Failing test case input:
-1 1 -1

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
import sys

A, B, C = input().split()
a = int(A)
b = int(B)
c = int(C)

if a == b:
    if a == c:
        print('Yes')
        sys.exit()

print('No')

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
arr=list(map(int,input().split()))
if(arr.count(arr[0])==3):
    print('yes')
else:
    print('no')
    

Failing test case input:
0 6 3

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
arr=list(map(int,input().split()))
if(arr.count(arr[0])==3):
    print('Yes')
else:
    print('No')

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
from sys import stdin

def ria(sep = ''):
    if sep == '' :
        return list(map(int, input().split())) 
    else: return list(map(int, input().split(sep)))
def rsa(sep = ''):
    if sep == '' :
        return input().split() 
    else: return input().split(sep)
def ri(): return int(input())
def rd(): return float(input())
def rs(): return input()



A, B, C = map(int, input().split())
print("Yes" if (A == B and B == C) else "NO")



Failing test case input:
-3 10 -1

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
from sys import stdin

def ria(sep = ''):
    if sep == '' :
        return list(map(int, input().split())) 
    else: return list(map(int, input().split(sep)))
def rsa(sep = ''):
    if sep == '' :
        return input().split() 
    else: return input().split(sep)
def ri(): return int(input())
def rd(): return float(input())
def rs(): return input()



A, B, C = map(int, input().split())
print("Yes" if (A == B and B == C) else "No")

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = list(map(int,input().split()))
a.sort()
if a[0]>a[1]+a[2]:
    print("Yes")
else:
    print("No")


Failing test case input:
-1 -2 -2

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
a,b,c = map(int,input().split())
if a==b==c:
    print("Yes")
else:
    print("No")

Problem: p03079
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,B,C = map(int, input().split())

print(A,B,C)

if A == B and B == C:
  print('Yes')
else:
  print('No')

Failing test case input:
-2 0 -2

Expected output:
No


Actual output:
-2 0 -2
No


Fixed submission (verdict: Accepted):
A,B,C = map(int, input().split())

if A == B and B == C:
  print('Yes')
else:
  print('No')
Problem: p03475
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
l = []
for i in range(N-1):
  c, s, f = map(int, input().split())
  l.append([c, s, f])
  
for i in range(N-1):
  time = l[i][1] + l[i][0]
  for j in range(i+1, N-1):
    if time-l[j][1] >= 0:
      wait = (time-l[j][1]) % l[j][2]
    else:
      wait = l[j][1]
      time = 0
    time += wait + l[j][0]
  print(time)
print(0)

Failing test case input:
4
19 24 3
32 16 4
99 2 2

Expected output:
175
147
101
0


Actual output:
177
147
101
0


Fixed submission (verdict: Accepted):
N = int(input())
l = []
for i in range(N-1):
  c, s, f = map(int, input().split())
  l.append([c, s, f])
  
for i in range(N-1):
  time = l[i][1] + l[i][0]
  for j in range(i+1, N-1):
    if time-l[j][1] >= 0:
      wait = time % l[j][2]
      if wait == 0:
        time += l[j][0]
      else:
        time += l[j][2] - wait + l[j][0]
    else:
      time = l[j][1] + l[j][0]
  print(time)
print(0)

Problem: p03475
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
C = []
S = []
F = []
for i in range(N-1):
    c, s, f = map(int, input().split())
    C.append(c)
    S.append(s)
    F.append(f)

for i in range(0, N-1):
    t = S[i]
    for j in range(i, N-1):
        if t <= S[j]:
            t = S[j]
        else:
            t += F[j] - t%F[j]
        t += C[j]
    print(t)
print(0)

Failing test case input:
3
12 26 2
4 10 2

Expected output:
42
14
0


Actual output:
44
14
0


Fixed submission (verdict: Accepted):
N = int(input())
C = []
S = []
F = []
for i in range(N-1):
    c, s, f = map(int, input().split())
    C.append(c)
    S.append(s)
    F.append(f)

for i in range(0, N-1):
    t = 0
    for j in range(i, N-1):
        if t <= S[j]:
            t = S[j]
        elif t%F[j] != 0:
            t += F[j] - t%F[j]
        t += C[j]
    print(t)
print(0)

Problem: p03475
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
lines = []

for i in range(N-1):
    lines.append(input())

C = []
S = []
F = []

for line in lines:
	c, s, f = line.split()
	C.append(int(c))
	S.append(int(s))
	F.append(int(f))

A = []

for i in range(N-1):
	a = C[i] + S[i]
	for j in range(i + 1, N - 1):
		
		n = S[j] - a if a <= S[j] else a % F[j]
		a = a + C[j] + n
	A.append(a)

for a in A:
	print(a)
print(0)


Failing test case input:
4
19 24 3
32 16 4
99 2 2

Expected output:
175
147
101
0


Actual output:
177
147
101
0


Fixed submission (verdict: Accepted):
N = int(input())
lines = []

for i in range(N-1):
    lines.append(input())

C = []
S = []
F = []

for line in lines:
	c, s, f = line.split()
	C.append(int(c))
	S.append(int(s))
	F.append(int(f))

A = []

for i in range(N-1):
	a = C[i] + S[i]
	for j in range(i + 1, N - 1):
		n = S[j] - a if a <= S[j] else (a - S[j]) % F[j]
		n = F[j] - n if a > S[j] and n != 0 else n
		
		a = a + C[j] + n
	A.append(a)

for a in A:
	print(a)
print(0)