TnT/CodeNet4Repair huggingface dataset:
Problem:
E869120 found a chest which is likely to contain treasure.   However, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.   He also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with `?`.  One more thing he found is a sheet of paper with the following facts written on it:    * Condition 1: The string S contains a string T as a contiguous substring.   * Condition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.  Print the string S.   If such a string does not exist, print `UNRESTORABLE`.

Incorrect submission (verdict: Wrong Answer):
s=input()
t=input()
def ga(i,t):
    turn=0
    for k in range(len(t)):
        if s[-(i+k)]!=t[-(k+1)] and s[-(i+k)]!='?':
            break
    else:
        turn+=1
    return turn
li=list(s)
li2=list(t)
for i in range(1,len(s)-len(t)+1):
    if ga(i,t)==1:
        for k in range(len(t)):
            print(i,k)
            li[-(i+k)]=li2[-(k+1)]
        n=''.join(li)
        break
else:
    print('UNRESTORABLE')
    exit()
print(n.replace('?','a'))
            
    


Fixed, accepted submission:
s=input()
t=input()
def ga(i,t):
    turn=0
    for k in range(len(t)):
        if s[-(i+k)]!=t[-(k+1)] and s[-(i+k)]!='?':
            break
    else:
        turn+=1
    return turn
li=list(s)
li2=list(t)
for i in range(1,len(s)-len(t)+2):
    if ga(i,t)==1:
        for k in range(len(t)):
            li[-(i+k)]=li2[-(k+1)]
        n=''.join(li)
        break
else:
    print('UNRESTORABLE')
    exit()
print(n.replace('?','a'))
Problem:
Write a program which calculates the cube of a given integer x.

Incorrect submission (verdict: Wrong Answer):
x = int(input('please input number > '))
ans = int(x * x * x)
print(ans)

Fixed, accepted submission:
x = int(input())
print(int(x * x * x))
Problem:
You are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.    An example of a trapezoid  Find the area of this trapezoid.

Incorrect submission (verdict: Wrong Answer):
a,b,c = [str(input()) for i in range(3)]
current = 'a'
while True:
    cur = current[len(current)-1]
    if cur == 'a':
      current+=a[0]
      a=a[1:]
    elif cur == 'b':
      current+=b[0]
      b=b[1:]
    elif cur == 'c':
      current+=c[0]
      c=c[1:]
    if a == '' or b =='' or c =='':
      print(current[len(current)-1].upper())
      break

Fixed, accepted submission:
a,b,h = [int(input()) for i in range(3)]
print(int((a+b)/2*h))
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):
S = input()

if S in "1234567890": 
    print ("number")
elif S in "abcdefghijklmnopqrstuvwxyz": 
    print ("alphabet")
else:
    print ("other")

Fixed, accepted submission:
a,b = input().split()
a = int(a)
b = int(b)
c = a % 2
d = b % 2
if c == 0 or d == 0:
    print ("Even")
else:
    print ("Odd")
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):
from sys import exit
from numpy.random import rand
# A,B,C = [int(n) for n in input().split()]
# N = int(input())
# a = [int(input()) for _ in range(N)]
# S = str(input())
# L = len(S)
# T = str(input())
N = int(input())
# dic = {}



ansgroup = []
if N%2 == 0:
    for i in range(1,N//2+1):
        ansgroup.append([i, N-i+1])
else:
    for i in range(1,N//2+1):
        ansgroup.append([i, N-i])
    ansgroup.append([N])
# print(ansgroup)
for i in range(len(ansgroup)):
    for j in range(i+1,len(ansgroup)):
        for e1 in ansgroup[i]:
            for e2 in ansgroup[j]:
                print(e1,e2)

# tmpset = set()

#     if ans[i-1][0] == ans[i][0]:

#     else:


# exit()



Fixed, accepted submission:
from sys import exit
from numpy.random import rand
# A,B,C = [int(n) for n in input().split()]
# N = int(input())
# a = [int(input()) for _ in range(N)]
# S = str(input())
# L = len(S)
# T = str(input())
N = int(input())
# dic = {}



ansgroup = []
if N%2 == 0:
    for i in range(1,N//2+1):
        ansgroup.append([i, N-i+1])
else:
    for i in range(1,N//2+1):
        ansgroup.append([i, N-i])
    ansgroup.append([N])
nodesum = 0
ans = []
for i in range(len(ansgroup)):
    for j in range(i+1,len(ansgroup)):
        for e1 in ansgroup[i]:
            for e2 in ansgroup[j]:
                nodesum+=1
                ans.append([e1,e2])
print(nodesum)
for a in ans:
    print(a[0],a[1])

# tmpset = set()

#     if ans[i-1][0] == ans[i][0]:

#     else:


# exit()
Problem:
Write a program which reads a rectangle and a circle, and determines whether the circle is arranged inside the rectangle. As shown in the following figures, the upper right coordinate $(W, H)$ of the rectangle and the central coordinate $(x, y)$ and radius $r$ of the circle are given.     

Incorrect submission (verdict: Wrong Answer):
(W, H, x, y, r) = [int(i) for i in input().split()]

if 0 >= x - r and 0 >= y - r and W <= x + r and H <= y + r :
  print('Yes')
else :
  print('No')

Fixed, accepted submission:
(W,H,x,y,r) = [int(i) for i in input().split()]

if x - r >= 0 and y - r >= 0 and x + r <= W and y + r <= H :
    print('Yes')
else :
    print('No')
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())
ans = 0
for i in range(1,N+1):
    S = str(i)
    a = 0
    for s in S:
        a+=int(s)
    if A<=a<=B:ans+=1
print(ans)

Fixed, accepted submission:
N,A,B = map(int,input().split())
ans = 0
for i in range(1,N+1):
    S = str(i)
    a = 0
    for s in S:
        a+=int(s)
    if A<=a<=B:ans+=i
print(ans)
Problem:
Takahashi wants to gain muscle, and decides to work out at AtCoder Gym.  The exercise machine at the gym has N buttons, and exactly one of the buttons is lighten up. These buttons are numbered 1 through N. When Button i is lighten up and you press it, the light is turned off, and then Button a_i will be lighten up. It is possible that i=a_i. When Button i is not lighten up, nothing will happen by pressing it.  Initially, Button 1 is lighten up. Takahashi wants to quit pressing buttons when Button 2 is lighten up.  Determine whether this is possible. If the answer is positive, find the minimum number of times he needs to press buttons.

Incorrect submission (verdict: Wrong Answer):
n = int(input())
l = [0] + [int(input()) for i in range(n)]
cnt = 0
a = 1
while a != 2:
    if a==0:
        print(-1)
        break
    a = l[a]
    l[a] = 0
    cnt += 1
else:
    print(cnt)


Fixed, accepted submission:
n = int(input())
l = [0] + [int(input()) for i in range(n)]
cnt = 0
a = 1
while a != 2:
    if a==0:
        print(-1)
        break
    tmp=l[a]
    l[a]=0
    a=tmp
    cnt += 1
else:
    print(cnt)
Problem:
Based on some criterion, Snuke divided the integers from 1 through 12 into three groups as shown in the figure below. Given two integers x and y (1 ≤ x < y ≤ 12), determine whether they belong to the same group.  

Incorrect submission (verdict: Wrong Answer):
x, y = map(int, input().split())
a = [1, 3, 5, 7, 8, 10, 12]
b = [4, 6, 9, 11]
c = [2]
if x in a and y in b:
  print('Yes')
elif x in b and y in b:
  print('Yes')
elif x in c and y in c:
  print('Yes')
else:
  print('No')

Fixed, accepted submission:
x, y = map(int, input().split())
a = [1, 3, 5, 7, 8, 10, 12]
b = [4, 6, 9, 11]
c = [2]
if x in a and y in a:
  print('Yes')
elif x in b and y in b:
  print('Yes')
elif x in c and y in c:
  print('Yes')
else:
  print('No')
Problem:
You have N kinds of items that you want to put them into a knapsack. Item i has value vi and weight wi.  You want to find a subset of items to put such that:    * The total value of the items is as large as possible.   * The items have combined weight at most W, that is capacity of the knapsack.   * You can select as many items as possible into a knapsack for each kind.  Find the maximum total value of items in the knapsack.

Incorrect submission (verdict: Wrong Answer):
N, W = map(int, input().split())
value = []
weight = []
dp = [0 for _ in range(W + 1)]
for i in range(N):
    v, w = map(int, input().split())
    for j in range(w+1):
        if j >= w:
            dp[j] = max(dp[j], dp[j - w] + v)
        else:
            break
print(dp[W])

Fixed, accepted submission:
N, W = map(int, input().split())
value = []
weight = []
dp = [0 for _ in range(W + 1)]
for i in range(N):
    v, w = map(int, input().split())
    for j in range(W+1):
        if j >= w:
            dp[j] = max(dp[j], dp[j - w] + v)
print(dp[W])
Problem:
Snuke is giving cookies to his three goats.  He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).  Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.

Incorrect submission (verdict: Wrong Answer):
a, b = map(int, input().split())
print("Possible" if a+b%3 == 0 or a%3==0 or b%3==0 else "Impossible")

Fixed, accepted submission:
a, b = map(int, input().split())
print("Possible" if (a+b)%3 == 0 or a%3==0 or b%3==0 else "Impossible")
Problem:
Write a program which reads two integers a and b, and calculates the following values:    * a ÷ b: d (in integer)   * remainder of a ÷ b: r (in integer)   * a ÷ b: f (in real number)

Incorrect submission (verdict: Wrong Answer):
(a, b) = [int(x) for x in input().split()]

x = a // b
y = a % b
z = a / b

print(x);
print(y);
print(z);

Fixed, accepted submission:
(a, b) = [int(i) for i in input().split()]
d = int (a / b)
r = a % b
f = a / b
print('%s %s %.5f' % (d, r, f))
Problem:
There are N stones arranged in a row. Every stone is painted white or black. A string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is `.`, and the stone is black if the character is `#`.  Takahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone. Find the minimum number of stones that needs to be recolored.

Incorrect submission (verdict: Wrong Answer):

import numpy as np

N = int(input())
s = input()

S = []
for c in s:
    S.append(c)
    
A = np.zeros(N+1)
if S[0] == "#":
    A[0] = 0 
for i in range(1,N+1):
    if S[i-1] == "#":
        A[i] = A[i-1] + 1
    else:
        A[i] = A[i-1]
    

minimum = N
for i in range(N+1):
    num = int(A[i] + (N-i-(A[N]-A[i])))
    if minimum > num:
        minimum = num
print(num)
    

    





Fixed, accepted submission:

import numpy as np

N = int(input())
s = input()

S = []
for c in s:
    S.append(c)
    
A = np.zeros(N+1)
if S[0] == "#":
    A[0] = 0 
for i in range(1,N+1):
    if S[i-1] == "#":
        A[i] = A[i-1] + 1
    else:
        A[i] = A[i-1]
    
minimum = N
for i in range(N+1):
    num = int(A[i] + (N-i-(A[N]-A[i])))
    if minimum > num:
        minimum = num
print(minimum)
Problem:
Write a program which reads three integers a, b and c, and prints "Yes" if a < b < c, otherwise "No".

Incorrect submission (verdict: Wrong Answer):
a, b, c = input().split(' ')
a = int(a)
b = int(b)
c = int(c)
if a > b > c:
  print('Yes')
else:
  print('No')

Fixed, accepted submission:
a, b, c = input().split(' ')
a = int(a)
b = int(b)
c = int(c)
if a < b < c:
  print("Yes")
else:
  print("No")
Problem:
We say that a odd number N is _similar to 2017_ when both N and (N+1)/2 are prime.  You are given Q queries.  In the i-th query, given two odd numbers l_i and r_i, find the number of odd numbers x similar to 2017 such that l_i ≤ x ≤ r_i.

Incorrect submission (verdict: Wrong Answer):
q = int(input())
n = 100001
limit = int(n**0.5)
a = [i for i in range(3, n, 2)]
e = []
for i in range(n):
  p = a[i]
  if limit <= p:
    break
  e = [j for j in a if j%p!=0 ]
print(e)

for i in range(q):
  l,r = map(int, input().split())
  

Fixed, accepted submission:
#import numpy

#for loop
#a = [1,2,3,4,5,6,7,8,9,10]
#s = [0]*len(a)
#s[0] = a[0]

#  s[i+1] = s[i] + a[i+1]
#print(s)

#numpy.cumsum()
#print(numpy.cumsum(a))

q = int(input())
n = 10**5+1
limit = int(n**0.5)
a = [i for i in range(3, n, 2)]
prime = [2]
while True:
  p = a[0]
  if limit <= p:
    prime += a
    break
  prime.append(p)
  a = [j for j in a if j%p!=0]
  
pi = [0]*n
for i in range(len(prime)):
  ai = (prime[i]+1)//2
  if ai in prime:
    pi[prime[i]-1] = 1
    
s = [0]*n
s[0] = pi[0]
for i in range(len(pi)-1):
  s[i+1] = s[i] + pi[i+1]
s = [0,0] + s
for i in range(q):
  l, r = map(int, input().split())
  print(s[r+1]-s[l])
Problem:
There are N people standing in a row from west to east. Each person is facing east or west. The directions of the people is given as a string S of length N. The i-th person from the west is facing east if S_i = `E`, and west if S_i = `W`.  You will appoint one of the N people as the leader, then command the rest of them to face in the direction of the leader. Here, we do not care which direction the leader is facing.  The people in the row hate to change their directions, so you would like to select the leader so that the number of people who have to change their directions is minimized. Find the minimum number of people who have to change their directions.

Incorrect submission (verdict: Wrong Answer):
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
S = [_ for _ in input()]

init_cnt = S[1:].count('E')
min_c = init_cnt
ans = 0

for i in range(1, N):
    tmp = min_c
    if S[i-1] == 'W':
        tmp = tmp + 1
    if S[i] == 'E':
        tmp = tmp - 1
    if tmp < min_c:
        min_c = tmp
        ans = i
print(ans)


Fixed, accepted submission:
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
S = [_ for _ in input()]

left, right = 0, S[1:].count('E')
ans = left + right
for i in range(N-1):
    if S[i] == 'W':
        left += 1
    if S[i+1] == 'E':
        right -= 1

    ans = min(ans, left + right)

print(ans)
Problem:
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.  He has N candidates of problems. The difficulty of the i-th candidate is D_i.  There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.  Determine whether Rng can complete the problem set without creating new candidates of problems.

Incorrect submission (verdict: Wrong Answer):
N=int(input())
D=[int(i) for i in input().split()]
M=int(input())
T=[int(i) for i in input().split()]

D.sort()
T.sort()

indexD=0
indexT=0
while indexD<len(D) and indexT<len(T):
	if D[indexD]==T[indexT]:
		indexD+=1
		indexT+=1
	else:
		indexD+=1
if indexT==len(T):
	print("Yes")
else:
	print("No")

Fixed, accepted submission:
N=int(input())
D=[int(i) for i in input().split()]
M=int(input())
T=[int(i) for i in input().split()]

D.sort()
T.sort()

indexD=0
indexT=0
while indexD<len(D) and indexT<len(T):
	if D[indexD]==T[indexT]:
		indexD+=1
		indexT+=1
	else:
		indexD+=1
if indexT==len(T):
	print("YES")
else:
	print("NO")
Problem:
Write a program which solve a simultaneous equation:      ax + by = c   dx + ey = f      The program should print x and y for given a, b, c, d, e and f (-1,000 ≤ a, b, c, d, e, f ≤ 1,000). You can suppose that given equation has a unique solution.

Incorrect submission (verdict: Wrong Answer):
import sys
from math import fabs


if __name__ == '__main__':
    epsilon = 1e-10
    
    for line in sys.stdin:
        a, b, e, c, d, f = [int(x) for x in line.strip().split(' ')]
        x = 1/(a*d-b*c) * (d*e - b*f)
        y = 1/(a*d-b*c) * (-c*e + a*f)
        
        if fabs(x) < epsilon:
            x = 0.0
        if fabs(y) < epsilon:
            y = 0.0
        print('{0:.3f}, {1:.3f}'.format(x, y))

Fixed, accepted submission:
import sys
from math import fabs

if __name__ == '__main__':
    epsilon = 1e-9
    
    for line in sys.stdin:
        a, b, e, c, d, f = [int(x) for x in line.strip().split(' ')]
        x = 1/(a*d-b*c) * (d*e - b*f)
        y = 1/(a*d-b*c) * (-c*e + a*f)
        
        if fabs(x) < epsilon:
            x = 0.0
        if fabs(y) < epsilon:
            y = 0.0
        print('{0:.3f} {1:.3f}'.format(x, y))
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 = input()
a = list(map(int, input().split(' ')))
cnt = 0
while sum(x%2==0 for x in a) == n:
        a = list(map(lambda x: x / 2 if x % 2 == 0 else x, a))
        cnt += 1
print(cnt)

Fixed, accepted submission:
n = int(input())
a = list(map(int, input().split(' ')))
cnt = 0
while sum(x%2==0 for x in a) == n:
    a = list(map(lambda x: x / 2 if x % 2 == 0 else x, a))
    cnt += 1
print(cnt)
Problem:
Today is August 24, one of the five Product Days in a year.  A date m-d (m is the month, d is the date) is called a Product Day when d is a two-digit number, and all of the following conditions are satisfied (here d_{10} is the tens digit of the day and d_1 is the ones digit of the day):    * d_1 \geq 2   * d_{10} \geq 2   * d_1 \times d_{10} = m  Takahashi wants more Product Days, and he made a new calendar called Takahashi Calendar where a year consists of M month from Month 1 to Month M, and each month consists of D days from Day 1 to Day D.  In Takahashi Calendar, how many Product Days does a year have?

Incorrect submission (verdict: Wrong Answer):
m,d=map(int,input().split())
ans=0
for i in range(1,m+1):
  for j in range(22,d+1):
    if j%10>=2 and (j/10)*(j%10)==i:
      ans=ans+1
print(ans)

Fixed, accepted submission:
m,d=map(int,input().split())
ans=0
for i in range(1,m+1):
  for j in range(22,d+1):
    if j%10>=2 and (j//10)*(j%10)==i:
      ans=ans+1
print(ans)
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())
a=list(map(int, input().split()))
count=0
while sum(a)%2==0:
    a=[i/2 for i in a]
    count+=1
    print(a)
print(count)

Fixed, accepted submission:
n=int(input())
a=list(map(int, input().split()))
count=0
while all(i%2==0 for i in a):
    a=[i//2 for i in a]
    count+=1
print(count)
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):
s = input().split()
N = int(s[0])
A = int(s[1])
B = int(s[2])
k = 0
for i in range(1,N+1):
  S = 0
  while i >= 1:
    p = i%10
    i = i//10
    S = S + p
  if A <= S <= B:
    k = k + i
print(k)

Fixed, accepted submission:
s = input().split()
N = int(s[0])
A = int(s[1])
B = int(s[2])
k = 0
for i in range(1,N+1):
  S = 0
  l = i
  while l >= 1:
    p = l%10
    l = l//10
    S = S + p
  if A <= S <= B:
    k = k + i
print(k)
Problem:
You are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits "1974".

Incorrect submission (verdict: Wrong Answer):
n = [int(i) for i in input().split()]
n.sort()
if n[0] == 1 and n[1] == 4 and n[2] == 7 and n[3] == 9:
  print("Yes")
else:
  print("No")

Fixed, accepted submission:
n = [int(i) for i in input().split()]
n.sort()
if n[0] == 1 and n[1] == 4 and n[2] == 7 and n[3] == 9:
  print("YES")
else:
  print("NO")
Problem:
Write a program of the Insertion Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:                 for i = 1 to A.length-1     key = A[i]     /* insert A[i] into the sorted sequence A[0,...,j-1] */     j = i - 1     while j >= 0 and A[j] > key         A[j+1] = A[j]         j--     A[j+1] = key   Note that, indices for array elements are based on 0-origin.  To illustrate the algorithms, your program should trace intermediate result for each step.

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

for i in range(1, len(A)):
    key = A[i]
    j = i - 1
    while j >= 0 and A[j] > key:
        A[j+1] = A[j]
        j -= 1
    A[j+1] = key
    print(*A)

Fixed, accepted submission:
n = input()
A = list(map(int, input().split()))
print(*A)
for i in range(1, len(A)):
    key = A[i]
    j = i - 1
    while j >= 0 and A[j] > key:
        A[j+1] = A[j]
        j -= 1
    A[j+1] = key
    print(*A)
Problem:
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.  The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).  Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.  If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.

Incorrect submission (verdict: Wrong Answer):
import math

n = int(input())

print(math.floor(math.floor(n/1.08)*1.08))
if math.floor(math.floor(n/1.08)*1.08) == n:
    print(math.floor(n/1.08))
elif math.floor((math.floor(n/1.08)+1) *1.08) == n:
    print(math.floor(n/1.08)+1)
else:
    print(':(')


Fixed, accepted submission:
import math

n = int(input())

if math.floor(math.floor(n/1.08)*1.08) == n:
    print(math.floor(n/1.08))
elif math.floor((math.floor(n/1.08)+1) *1.08) == n:
    print(math.floor(n/1.08)+1)
else:
    print(':(')