TnT/CodeNet4Repair huggingface dataset:
Problem:
Iroha loves _Haiku_. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.  To create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.

Incorrect submission (verdict: Wrong Answer):
def solve(xs):                                                                    
  if xs.count(5) == 2 and xs.count(7) == 1:
    print('YES')
  else:                                                                         
    print('NO')

solve([ _ for _ in input().split() ])


Fixed, accepted submission:
def solve(xs):
  if xs.count(5) == 2 and xs.count(7) == 1:
    print('YES')
  else:
    print('NO')

solve([ int(_) for _ in input().split() ])
Problem:
We will buy a product for N yen (the currency of Japan) at a shop.  If we use only 1000-yen bills to pay the price, how much change will we receive?  Assume we use the minimum number of bills required.

Incorrect submission (verdict: Wrong Answer):
def Qa():
    n = int(input())
    print(n % 1000)

if __name__ == '__main__':
    Qa()


Fixed, accepted submission:
def Qa():
    n = int(input())
    c = n % 1000
    if c != 0:
        c = 1000 - c
    print(c)


if __name__ == '__main__':
    Qa()
Problem:
Write a program which computes the digit number of sum of two integers a and b.

Incorrect submission (verdict: Wrong Answer):
import sys
a = []
for i in sys.stdin:
    a = list(map(int, input().split()))
    b = a[0] + a[1]
    c = str(b)
    print(len(c))
 

Fixed, accepted submission:
import sys

for s in sys.stdin:
    a, b = map(int, s.split())
    print(len(str(a + b)))
Problem:
Takahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.  The problem has N test cases.  For each test case i (1\leq i \leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is `AC`, `WA`, `TLE`, and `RE`, respectively.  See the Output section for the output format.

Incorrect submission (verdict: Wrong Answer):
import sys
N = int(input())

dict = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}

for _ in range(N):
    S = input()
    if S in dict:
        i = dict.get(S)
        i += 1
        dict[S] = i

for key in dict.keys():
    print(key, '×', dict.get(key))

Fixed, accepted submission:
import sys
N = int(input())

dict = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}

for _ in range(N):
    S = input()
    if S in dict:
        i = dict.get(S)
        i += 1
        dict[S] = i

for key in dict.keys():
    print(key, 'x', dict.get(key))
Problem:
You are given two integers A and B. Find the largest value among A+B, A-B and A \times B.

Incorrect submission (verdict: Wrong Answer):
a,b = map(int,input().split())
max(a+b,a-b,a*b)

Fixed, accepted submission:
a,b = map(int,input().split())
print(max(a+b,a-b,a*b))
Problem:
Find the largest square number not exceeding N. Here, a _square number_ is an integer that can be represented as the square of an integer.

Incorrect submission (verdict: Wrong Answer):
n = int(input())
print(int(n ** 0.5) ** int(n ** 0.5))

Fixed, accepted submission:
n = int(input())
print(int(n ** 0.5) ** 2)
Problem:
Joisino the magical girl has decided to turn every single digit that exists on this world into 1.  Rewriting a digit i with j (0≤i,j≤9) costs c_{i,j} MP (Magic Points).  She is now standing before a wall. The wall is divided into HW squares in H rows and W columns, and at least one square contains a digit between 0 and 9 (inclusive).  You are given A_{i,j} that describes the square at the i-th row from the top and j-th column from the left, as follows:    * If A_{i,j}≠-1, the square contains a digit A_{i,j}.   * If A_{i,j}=-1, the square does not contain a digit.  Find the minimum total amount of MP required to turn every digit on this wall into 1 in the end.

Incorrect submission (verdict: Wrong Answer):
from scipy.sparse.csgraph import floyd_warshall
h,w=map(int,input().split())
table=[[0]*10 for i in range(10)]
for i in range(10):
  C=[int(i) for i in input().split()]
  for j in range(10):
    table[i][j]=C[j]
d=floyd_warshall(csgraph=table, directed=True, return_predecessors=False)
print(d)
ans=0
for i in range(h):
  A=[int(i) for i in input().split()]
  for a in A:
    if a!=-1:
      ans+=int(d[a][1])
print(ans)

Fixed, accepted submission:
import sys
input=lambda: sys.stdin.readline().rstrip()

from scipy.sparse.csgraph import floyd_warshall
h,w=map(int,input().split())
table=[]
for i in range(10):
  table.append([int(i) for i in input().split()])
d=floyd_warshall(csgraph=table, directed=True, return_predecessors=False)

ans=0
for i in range(h):
  A=[int(i) for i in input().split()]
  for a in A:
    if a==-1:
      continue
    else:
      ans+=d[a][1]
print(int(ans))
Problem:
An English booklet has been created for publicizing Aizu to the world. When you read it carefully, you found a misnomer (an error in writing) on the last name of Masayuki Hoshina, the lord of the Aizu domain. The booklet says "Hoshino" not "Hoshina".  Your task is to write a program which replace all the words "Hoshino" with "Hoshina". You can assume that the number of characters in a text is less than or equal to 1000.

Incorrect submission (verdict: Wrong Answer):
n=int(input())
for i in range(n):
    print(input().replace("Hoshino","hoshina"))

Fixed, accepted submission:
n=int(input())
for i in range(n):
    print(input().replace("Hoshino","Hoshina"))
Problem:
On some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in `yyyy/mm/dd` format. For example, January 23, 2018 should be written as `2018/01/23`.  After finishing the document, she noticed that she had mistakenly wrote `2017` at the beginning of the date column. Write a program that, when the string that Takaki wrote in the date column, S, is given as input, modifies the first four characters in S to `2018` and prints it.

Incorrect submission (verdict: Wrong Answer):
s = input()
print(s[3].replace("7", "8"))

Fixed, accepted submission:
s = input()
print("2018" + s[4:])
Problem:
Snuke has N sticks. The length of the i-th stick is l_i.  Snuke is making a snake toy by joining K of the sticks together.  The length of the toy is represented by the sum of the individual sticks that compose it. Find the maximum possible length of the toy.

Incorrect submission (verdict: Wrong Answer):
N, K = map(int,input().split())
l = list(map(int,input().split()))
sum_raw = []
ans_raw = []
sum = 0

for i in range(0, N):
	sum += l[i]
	sum_raw.append(sum)

ans_raw.append(sum_raw[K - 1])

for i in range(0, N - K + 1):
	ans = sum_raw[i + K -1] - sum_raw[i - 1]
	ans_raw.append(ans)

print(ans_raw)


print(sum_raw)

Fixed, accepted submission:
N, K = map(int,input().split())
l = list(map(int,input().split()))
ans_raw = []
sum = 0

l_new = sorted(l, reverse = True)

for i in range(0, K):
	sum += l_new[i]

print(str(sum))
Problem:
AtCoDeer the deer and his friend TopCoDeer is playing a game. The game consists of N turns. In each turn, each player plays one of the two _gestures_ , _Rock_ and _Paper_ , as in Rock-paper-scissors, under the following condition:  (※) After each turn, (the number of times the player has played Paper)≦(the number of times the player has played Rock).  Each player's score is calculated by (the number of turns where the player wins) - (the number of turns where the player loses), where the outcome of each turn is determined by the rules of Rock-paper-scissors.  _(For those who are not familiar with Rock-paper-scissors: If one player plays Rock and the other plays Paper, the latter player will win and the former player will lose. If both players play the same gesture, the round is a tie and neither player will win nor lose.)_  With his supernatural power, AtCoDeer was able to foresee the gesture that TopCoDeer will play in each of the N turns, before the game starts. Plan AtCoDeer's gesture in each turn to maximize AtCoDeer's score.  The gesture that TopCoDeer will play in each turn is given by a string s. If the i-th (1≦i≦N) character in s is `g`, TopCoDeer will play Rock in the i-th turn. Similarly, if the i-th (1≦i≦N) character of s in `p`, TopCoDeer will play Paper in the i-th turn.

Incorrect submission (verdict: Wrong Answer):
def abc046_d():
    s = str(input())
    n = len(s)
    if n == 1: return 0
    gc = [0] * n
    pc = [0] * n
    for i, c in enumerate(s):
        gc[i] = gc[i-1] + c.count('g')
        pc[i] = pc[i-1] + c.count('p')
    print(gc)
    print(pc)
    ans = (gc[-1] - pc[-1]) // 2
    return ans

if __name__ == '__main__':
    print(abc046_d())

Fixed, accepted submission:
def abc046_d():
    s = str(input())
    n = len(s)
    if n == 1: return 0
    gc = [0] * n
    pc = [0] * n
    for i, c in enumerate(s):
        gc[i] = gc[i-1] + c.count('g')
        pc[i] = pc[i-1] + c.count('p')
    ans = (gc[-1] - pc[-1]) // 2
    return ans

if __name__ == '__main__':
    print(abc046_d())
Problem:
Takahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.  The problem has N test cases.  For each test case i (1\leq i \leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is `AC`, `WA`, `TLE`, and `RE`, respectively.  See the Output section for the output format.

Incorrect submission (verdict: Wrong Answer):
import collections
N = int(input())
S = []
for _ in range(N):
  S.append(input())

counter = collections.Counter(S)
AC = counter['AC']
WA = counter['WA']
TLE = counter['TLE']
RE = counter['RE']

print("AC × {}".format(AC))
print("WA × {}".format(WA))
print("TLE × {}".format(TLE))
print("RE × {}".format(RE))

Fixed, accepted submission:
import collections
N = int(input())
S = []
for _ in range(N):
  S.append(input())

counter = collections.Counter(S)
AC = counter['AC']
WA = counter['WA']
TLE = counter['TLE']
RE = counter['RE']

print("AC x {}".format(AC))
print("WA x {}".format(WA))
print("TLE x {}".format(TLE))
print("RE x {}".format(RE))
Problem:
You are given an integer sequence of length n, a_1, ..., a_n. Let us consider performing the following n operations on an empty sequence b.  The i-th operation is as follows:    1. Append a_i to the end of b.   2. Reverse the order of the elements in b.  Find the sequence b obtained after these n operations.

Incorrect submission (verdict: Wrong Answer):
n = int(input())
a = input().split()
ans = []
isf = True
for i in range(n):
    if isf:
        ans.append(a[i])
        isf = False
    else:
        ans = [a[i]] + ans
        isf = True

if n % 2 == 1:
    ans.reverse()
print(''.join(ans))

Fixed, accepted submission:
n = int(input())
a = input().split()
ans1 = a[1::2]
ans2 = a[0::2]
ans1.reverse()
ans = ans1 + ans2
if n % 2 == 1:
    ans.reverse()

print(' '.join(ans))
Problem:
You are given an integer N. Build an undirected graph with N vertices with indices 1 to N that satisfies the following two conditions:    * The graph is simple and connected.   * There exists an integer S such that, for every vertex, the sum of the indices of the vertices adjacent to that vertex is S.  It can be proved that at least one such graph exists under the constraints of this problem.

Incorrect submission (verdict: Wrong Answer):
n = int(input())
l = []
if n%2==1:
    for i in range((n-1)//2):
        l.append([i+1,n-1-i])
    l.append([n,n])
else:
    for i in range(n//2):
        l.append([i+1,n-i])
ans = []
for i in range(len(l)):
    for j in range(len(l)):
        if i==j:
            continue
        ret1 = [l[i][0],l[j][0]]
        ret2 = [l[i][0],l[j][1]]
        ret3 = [l[i][1],l[j][0]]
        ret4 = [l[i][1],l[j][1]]
        ret1.sort()
        ret2.sort()
        ret3.sort()
        ret4.sort()
        ret = [ret1,ret2,ret3,ret4]
        for ret_ in ret:
            if not ret_ in ans:
                ans.append(ret_)
for ans_ in ans:
    print(ans_[0],ans_[1])

Fixed, accepted submission:
n = int(input())
l = []
if n%2==1:
    for i in range((n-1)//2):
        l.append([i+1,n-1-i])
    l.append([n,n])
else:
    for i in range(n//2):
        l.append([i+1,n-i])
ans = []
for i in range(len(l)):
    for j in range(len(l)):
        if i==j:
            continue
        ret1 = [l[i][0],l[j][0]]
        ret2 = [l[i][0],l[j][1]]
        ret3 = [l[i][1],l[j][0]]
        ret4 = [l[i][1],l[j][1]]
        ret1.sort()
        ret2.sort()
        ret3.sort()
        ret4.sort()
        ret = [ret1,ret2,ret3,ret4]
        for ret_ in ret:
            if not ret_ in ans:
                ans.append(ret_)
print(len(ans))
for ans_ in ans:
    print(ans_[0],ans_[1])
Problem:
A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.  Write a program which reads a list of _N_ integers and prints the number of prime numbers in the list.

Incorrect submission (verdict: Wrong Answer):
import math
def isprime(x):
    if x ==2:
        return True
    if x<2 or x%2 ==0:
        return False
    else:
        sx = int(math.sqrt(x))
        a = 0
        for i in range(3,sx+1,2):
            if x%i ==0:
                return False
            
        return True


Fixed, accepted submission:
import math
def isprime(x):
    if x ==2:
        return True
    if x<2 or x%2 ==0:
        return False
    else:
        sx = int(math.sqrt(x))
        for i in range(3,sx+1,2):
            if x%i ==0:
                return False
            
        return True
a = 0
n = int(input())
for i in range(n):
    a+= isprime(int(input()))
print(a)
Problem:
AtCoDeer the deer found two rectangles lying on the table, each with height 1 and width W. If we consider the surface of the desk as a two-dimensional plane, the first rectangle covers the vertical range of   AtCoDeer will move the second rectangle horizontally so that it connects with the first rectangle. Find the minimum distance it needs to be moved.

Incorrect submission (verdict: Wrong Answer):
w,a,b = map(int,input().split())
print(abs(a-b))

Fixed, accepted submission:
w, a, b = map(int, input().split())
c = max(a, b) - min(a, b) - w
print(c if c > 0 else 0)
Problem:
As a token of his gratitude, Takahashi has decided to give his mother an integer sequence. The sequence A needs to satisfy the conditions below:    * A consists of integers between X and Y (inclusive).   * For each 1\leq i \leq |A|-1, A_{i+1} is a multiple of A_i and strictly greater than A_i.  Find the maximum possible length of the sequence.

Incorrect submission (verdict: Wrong Answer):
a,b = map(int,input().split())
print(b//a)

Fixed, accepted submission:
a,b = map(int,input().split())
ans = 0
for i in range(10**18+1):
  if a*(2**i) <= b:
    ans += 1
  else:
    break
print(ans)
Problem:
Takahashi loves numbers divisible by 2.  You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.  Here, the number of times an integer can be divisible by 2, is how many times the integer can be divided by 2 without remainder.  For example,    * 6 can be divided by 2 once: 6 -> 3.   * 8 can be divided by 2 three times: 8 -> 4 -> 2 -> 1.   * 3 can be divided by 2 zero times.

Incorrect submission (verdict: Wrong Answer):
n=int(input())

for i in range(n):
    if 2**i<=n:
        print(2**i)


Fixed, accepted submission:
n = int(input())
ans = 0
out = 1
for i in range(1, n + 1):
    cnt = 0
    while i % 2 == 0:
        i //= 2
        cnt += 1
    if cnt > ans:
        ans = cnt
        out = i * 2 ** ans
print(out)
Problem:
There are N positive integers written on a blackboard: A_1, ..., A_N.  Snuke can perform the following operation when all integers on the blackboard are even:    * Replace each integer X on the blackboard by X divided by 2.  Find the maximum possible number of operations that Snuke can perform.

Incorrect submission (verdict: Wrong Answer):
N=int(input())
l=list(map(int, input().split()))

n=0
def power(figure):
    if figure%2==0:
        return True
    else:
        return False

while len(list(filter(power,l)))==N:
    k=map(lambda x: x/2,l)
    l=list(k)
    n=+1
print(n)

Fixed, accepted submission:
n=int(input())
l=list(map(int, input().split()))
a=[]
for i in range(n):
    a.append(0)
for i in range(n):
    while l[i]%2==0:
        l[i] /= 2
        a[i] +=1
print(min(a))
Problem:
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.

Incorrect submission (verdict: Wrong Answer):
a, b = map(int, input().split())

if (a | b) & 0:
  print("Even")
else:
  print("Odd")

Fixed, accepted submission:
a, b = map(int, input().split())

if (a & 1) and (b & 1):
  print("Odd")
else:
  print("Even")
Problem:
The postal code in Atcoder Kingdom is A+B+1 characters long, its (A+1)-th character is a hyphen `-`, and the other characters are digits from `0` through `9`.  You are given a string S. Determine whether it follows the postal code format in Atcoder Kingdom.

Incorrect submission (verdict: Wrong Answer):
a,b = map(int, input().split())
s = input()

ok = True
ok = ok and  s[0:a].isdecimal()
ok = ok and s[a] == '-'
ok = ok and s[a+1:-1].isdecimal()

if ok:
    print("yes")
else:
    print("no")


Fixed, accepted submission:
a,b = map(int, input().split())
s = input()

ok = True
ok = ok and  s[0:a].isdecimal()
ok = ok and s[a] == '-'
ok = ok and s[a+1:].isdecimal()

if ok:
    print("Yes")
else:
    print("No")
Problem:
We will buy a product for N yen (the currency of Japan) at a shop.  If we use only 1000-yen bills to pay the price, how much change will we receive?  Assume we use the minimum number of bills required.

Incorrect submission (verdict: Wrong Answer):
n = int(input())
a = n / 1000
if int(a) == a:
	print('0')
else:
	a = int(a) + 1
	a = a * 1000


Fixed, accepted submission:
n = int(input())
a = n / 1000
if int(a) == a:
	print('0')
else:
	a = int(a) + 1
	a = a * 1000
	print(a-n)
Problem:
Find the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).

Incorrect submission (verdict: Wrong Answer):
n, a, b = map(int, input().split())
t = 0
for i in range(1, n+1):
  s = 0
  for j in str(i):
    s += int(j)
    if a <= s <= b:
      t += s
print(t)

Fixed, accepted submission:
n, a, b = map(int, input().split())
t = 0
for i in range(1, n+1):
  s = 0
  for j in str(i):
    s += int(j)
  if a <= s <= b:
    t += i
print(t)
Problem:
AtCoDeer has three cards, one red, one green and one blue.   An integer between 1 and 9 (inclusive) is written on each card: r on the red card, g on the green card and b on the blue card.   We will arrange the cards in the order red, green and blue from left to right, and read them as a three-digit integer.   Is this integer a multiple of 4?

Incorrect submission (verdict: Wrong Answer):
li = list(map(int,input().split()))

print('Yes' if (li[0] * 100 + li[1] * 10 + li[2]) % 4 == 0 else 'No')


Fixed, accepted submission:
li = list(map(int,input().split()))

print('YES' if (li[0] * 100 + li[1] * 10 + li[2]) % 4 == 0 else 'NO')
Problem:
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.

Incorrect submission (verdict: Wrong Answer):
a, b = map(int, input().split())

if (a % 2 == 1) and (b % 2 == 1):
    print('odd')
else:
    print('even')


Fixed, accepted submission:
a, b = map(int, input().split())

if (a % 2 == 1) and (b % 2 == 1):
    print('Odd')
else:
    print('Even')
Problem:
Write a program which calculates the area and perimeter of a given rectangle.

Incorrect submission (verdict: Wrong Answer):
a, b = map(int, input(). split())
x = a+a+b+b
y = a*b
print('長さ=', x,'面積=', y)


Fixed, accepted submission:
a, b = map(int, input(). split())
x = a*b
y = a*2+b+b
print(x, y)
Problem:
Three poles stand evenly spaced along a line. Their heights are a, b and c meters, from left to right. We will call the arrangement of the poles _beautiful_ if the tops of the poles lie on the same line, that is, b-a = c-b.  Determine whether the arrangement of the poles is beautiful.

Incorrect submission (verdict: Wrong Answer):

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


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

Fixed, accepted submission:

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


if b - a == c - b:
    print('YES')
else:
    print('NO')
Problem:
AtCoder Mart sells 1000000 of each of the six items below:    * Riceballs, priced at 100 yen (the currency of Japan) each   * Sandwiches, priced at 101 yen each   * Cookies, priced at 102 yen each   * Cakes, priced at 103 yen each   * Candies, priced at 104 yen each   * Computers, priced at 105 yen each  Takahashi wants to buy some of them that cost exactly X yen in total. Determine whether this is possible.   (Ignore consumption tax.)

Incorrect submission (verdict: Wrong Answer):
X=int(input())
Y=X%100
Z=X//100
if X>(Z*5):
	print(0)
else:
	print(1)

Fixed, accepted submission:
X=int(input())
Y=X%100
Z=X//100
if Y>(Z*5):
	print(0)
else:
	print(1)
Problem:
The word `internationalization` is sometimes abbreviated to `i18n`. This comes from the fact that there are 18 letters between the first `i` and the last `n`.  You are given a string s of length at least 3 consisting of lowercase English letters. Abbreviate s in the same way.

Incorrect submission (verdict: Wrong Answer):
import math
s=input()
print(s[0]+str(len(s)-1)+s[-1])

Fixed, accepted submission:
import math
s=input()
print(s[0]+str(len(s)-2)+s[-1])
Problem:
Snuke has decided to construct a string that starts with `A` and ends with `Z`, by taking out a substring of a string s (that is, a consecutive part of s).  Find the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with `A` and ends with `Z`.

Incorrect submission (verdict: Wrong Answer):
s = input()

a = s.find("A")
z = s.rfind("Z")

print(s[a:z + 1])

Fixed, accepted submission:
s = input()

a = s.find("A")
z = s.rfind("Z")

print(z - a + 1)
Problem:
It is September 9 in Japan now.  You are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?

Incorrect submission (verdict: Wrong Answer):
N = input()
if "9" in "N":
    print("YES")
else:
    print("NO")

Fixed, accepted submission:
N = input()
if "9" in N:
    print("Yes")
else:
    print("No")
Problem:
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.

Incorrect submission (verdict: Wrong Answer):
a, b = [int(i) for i in input().split()]
if a * b % 2 == 0:
	print('Odd')
else:
	print('Even')


Fixed, accepted submission:
x = input()

x = x.split(" ")

product = 1

for i in x:

    product *= int(i)

if product % 2 == 0:

    print ("Even")

else:
    print ("Odd")
Problem:
Write a program which reads two integers a, b and an operator op, and then prints the value of a op b.  The operator op is '+', '-', '*' or '/' (sum, difference, product or quotient). The division should truncate any fractional part.

Incorrect submission (verdict: Wrong Answer):

# import
import sys


for inputData in sys.stdin:
    inputData = inputData.split(" ")
    a, b, op = int(inputData[0]), int(inputData[2]), inputData[1]
    retVal = 0

    
    if op == '?':
        
        break

    if op == '+':
        retVal = a + b
    elif op == '-':
        retVal = a - b
    elif op == '*':
        retVal = a * b
    elif op == '/':
        retVal = a / b
    else:
        retVal = 0

    # ????????????
    print(retVal)

Fixed, accepted submission:

# import
import sys


for inputData in sys.stdin:
    inputList = inputData.split()
    a, op, b = int(inputList[0]), inputList[1], int(inputList[2])
    retVal = 0

    
    if op == '?':
        
        break
    elif op == '+':
        retVal = a + b
    elif op == '-':
        retVal = a - b
    elif op == '*':
        retVal = a * b
    elif op == '/':
        retVal = a // b
    else:
        retVal = 0

    # ????????????
    print(retVal)