TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
import sys
import collections

N = int(input())
A_i = list(map(int, input().split()))
A_i = [i for i in A_i if 1 <= i and i <= 10**9]

if not 2 <= N or not N <= 2*10**5:
    print("error:N")
    sys.exit()

if len(collections.Counter(A_i)) == len(A_i):
    print("Yes")
else:
    print("No")

import sys

Ball = list(map(str, input().split()))
Quantity = list(map(int,input().split()))
U = str(input())

S = Ball[0]
T = Ball[1]
A = Quantity[0]
B = Quantity[1]

if not 1 <= len(S) or not len(S) <= 10:
    print("error:S_length")
    sys.exit()    
if not 1 <= len(T) or not len(T) <= 10:
    print("error:T_length")
    sys.exit()   
if S == T:
    print("error:S==T")
    sys.exit()
if S != U and T != U:
    print("error:S=U or S=T")
    sys.exit()
if not 1<= A or not B <= 10:
    print("error:A,B")
    sys.exit()

if U == S:
    A -= 1
if U == T:
    B -= 1
print(A,B)

Verdicts: Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S, T = input().split())
A, B = map(int,input().split())
U = input()
if S == U:
  print(A - 1, B)
else:
  print(A, B - 1)

S, T = input().split()
A, B = map(int,input().split())
U = input()
if S == U:
  print(A - 1, B)
else:
  print(A, B - 1)

Verdicts: Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S = "red"
T = "blue"
A ,B = input().split()
U = str(input())
if(U == S):
   A = int(A) - 1
elif(U==T):
    B = int(B) -1
print(A, B)

S, T = input().split()
A ,B = input().split()
U = str(input())
if(U == S):
   A = int(A) - 1
elif(U==T):
    B = int(B) -1
print(A, B)

Verdicts: Wrong Answer

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S,T = input().split()
A,B = int(input().split())
U =input()

if S == U:
  	print(A-1,B)
else:
    print(A,B-1)
    

S,T = input().split()
A,B = int(input().split())
U = input()
if U == S:
  	print(A-1,B)
elif U == T:
    print(A,B-1)
    

S,T = input().split()
A,B = int(input().split())
U = input()

if S == U:
  	print(A-1,B)
elif T == U:
    print(A,B-1)

S,T = input().split()
A,B = map(int,input().split())
U = input()
if U == S:
  	print(A-1,B)
elif U == T:
    print(A,B-1)
    

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
n, k = map(int, input().split())
p = list(map(int, input().split()))
l = [0] * (n + 1)
ans = []
for i in range(n):
    l[i + 1] = l[i] + (p[i] + 1) / 2
for i in range(n - k + 1):
    ans.append(l[i + k] - l[i])
print(max(ans))

n, k = map(int, input().split())
p = list(map(int, input().split()))
l = [0] * n
ans = []
l[0] = (p[0] + 1) / 2
for i in range(1, n):
    l[i] = l[i - 1] + (p[i] + 1) / 2
for i in range(n - k):
    ans.append(l[i + k] - l[i])
print(max(ans))

input1 = input().split()
input2 = list(map(int,input().split()))
U = input()
S = input1[0]
T = input1[1]
A = input2[0]
B = input2[1]
if U == S:
  A -= 1
else:
  B -= 1
print(str(A) + " " + str(B))

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S,T=input().split()
A,B map(int, input().split())
U = input()
if S==U:
  print(A-1,B)
elif T==U:
  print(A,B-1)

import str
S,T=map(chr, input(),split())
A,B map(int, input(),split())
U = chr(input())
if S==U:
  print(A-1 B)
elif T==U:
  print(A B-1)

S,T=input(),split()
A,B map(int, input(),split())
U = input()
if S==U:
  A-=1
elif T==U:
  B-=1
print(A,B)

import str
S,T=map(chr, input(),split())
A,B map(int, input(),split())
U = chr(input())
if S==U:
  A-1
elif T==U:
  B-1
print(A,B)

S, T = input().split()
A, B= map(int, input().split())
U = input()
if S == U:
    print(A - 1, B)
elif:
    print(A, B - 1)

S,T=map(chr, input(),split())
A,B map(int, input(),split())
U = chr(input())
if S==U:
  A-=1
elif T==U:
  B-=1
print(A,B)

S,T=map(chr, input(),split())
A,B map(int, input(),split())
U = chr(input())
if S==U:
  A=A-1
elif T==U:
  B=B-1
print(A,B)

S, T = input().split()
A, B= map(int, input().split())
U = input()
if S == U:
    print(A - 1, B)
elif T==U:
    print(A, B - 1)
else:

S,T=input().split()
A,B map(int, input().split())
U = input()
if S==U:
  A-=1
elif T==U:
  B-=1
print(A,B)

S, T = input().split()
A, B= map(int, input().split())
U = input()
if S == U:
    A-=1
else:
    B-=1
print(A,B)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S, T = input().split()
A,B = map(int,input().split())
U = input()
print(A,B)
if U == S:
  A -= 1
  print(A)
else:
  B -= 1
  print(B)
    

import numpy as np
N,K = map(int,input().split())
P = list(map(int,input().split()))
total = 0
for i in range(N-K+1):
  A = P[i:i+K]
  total = sum(A)
  if total>0:
    B = A
np.array(B)
C = (B+np.array([1]))/np.array([2])
print(sum(C))


S, T = input().split()
A,B = map(int,input().split())
U = input()
print(A,B)
if U == S:
  A -= 1
  print(A,B)
else:
  B -= 1
  print(A,B)
    

S, T = input().split()
A,B = map(int,input().split())
U = input()
if U == S:
  A -= 1
  print(A,B)
else:
  B -= 1
  print(A,B)

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
from collections import defaultdict
d = defaultdict(int)
s, t = map(str, input().split())
a, b = map(int, input().split())
u = input()
d[s] = a
d[t] = b
d[u] -= 1
for v in d.values():
  print(v, end=' ')

s, t = map(str, input().split())
a, b = map(int, input().split())
u = input()
d = {}
d[s] = a
d[t] = b
d[u] -= 1
print(d[s], d[t])

Verdicts: Wrong Answer

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
def solve():
    S, T, A, B, U = map(int, open(0).read().split())
    if S == U:
        print(A - 1, B)
    else:
        print(A, B - 1)


if __name__ == '__main__':
    solve()


def solve():
    S, T = map(str, input().split())
    A, B = map(int, input().split())
    U = input()
    if S == U:
        print(A - 1, B)
    else:
        print(A, B - 1)


if __name__ == '__main__':
    solve()


Verdicts: Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
n = int(input())
a = list(map(int,input().split()))
a.sort()
for idx, i in enumerate(a[:-1]):
    if i == a[idx+1]:
        print('NO')
        break
if idx == n - 2:
    print('YES')

s,t = input().split()
a,b = list(map(int, input().split()))
u = input()

if u == s:
    a -= 1
if u == t:
    b -= 1
print("{} {}".format(a,b))

Verdicts: Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
s, t= input().split(' ')
a, b = map(int,input().split(' '))
u = input()
print(a-1) if u == s else print(b-1)

s, t= input().split(' ')
a, b = map(int,input().split(' '))
u = input()
print(a-1, b) if u == s else print(a, b-1)

Verdicts: Wrong Answer

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S, T = input().split()
A, B = map(int, input().split())
U = input()
if U == S:    A -= 1
else: B -= 1
print(A)

S, T = input().split()
A, B = map(int, input().split())
U = input()
if U == S:    A -= 1
else: B -= 1
print(A, 😎

S, T = input().split()
A, B = map(int, input().split())
U = input()
if U == S:    A -= 1
else: B -= 1
print(A,B)

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
import sys

def main():

    

    s, t = input().split()
    a, b = map(int, input().split())
    u    = input()

    if s == t:
        a -= 1
    else:
        b -= 1

    print(str(a) + " " + str(b))

if __name__ == "__main__":
    main()


import sys

def main():

    

    s, t = input().split()
    a, b = map(int, input().split())
    u    = input()

    if s == u:
        a -= 1
    else:
        b -= 1

    print(str(a) + " " + str(b))

if __name__ == "__main__":
    main()


Verdicts: Wrong Answer

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
N, K = map(int, input().split())
num = list(map(int, input().split()))
 

expect = []
for i in range(N):
  expect.append((1 + num[i]) / 2)
 

cs = [0]
for i in range(N):
    cs.append(cs[i]+expect[i])

max = 0
for i in range(K, N+1): 
  if max < cs[i] - cs[i-K]:
    max = cs[i] - cs[i - K]
print(max)

s,t = map(str,input().split())
a,b = map(int,input().split())
u=str(input())

if s == u:
    a=a-1
else:
    b=b-1

print(a,b)

Verdicts: Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S, T = input().split(' ')
A, B = list(map(int, input().split(' ')))
U = input()
if U==S: return A-1,B
if U==T: return A,B-1

S, T = input().split(' ')
A, B = list(map(int, input().split(' ')))
U = input()
if U==S: print(A-1,B)
if U==T: print(A,B-1)

Verdicts: Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
n,m = input().split()
r,b = map(int,input().split())
i = input()
if i == n:
  r = r -1
  print(r + ' ' + b)
else:
  b = b-1
  print(r + ' ' + b)

n.m = input().split()
r,b = map(int,input().split())
t = input()
if n == t:
  print(str(r-1) + ' ' + str(b))
else:
  print(str(r) + ' ' + str(b-1))


n,m = input().split()
r,b = map(int,input().split())
t = input()
if n == t:
  print(str(r-1) + ' ' + str(b))
else:
  print(str(r) + ' ' + str(b-1))


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):

s,t = map(str,input().split())
a,b = map(int,input().split())
u = input()


if s == t:
    a = a - 1
else:
    b = b - 1


print("{} {}".format(a,b))



s,t = map(str,input().split())
a,b = map(int,input().split())
u = input()


if s == u:
    a = a - 1
else:
    b = b - 1


print("{} {}".format(a,b))


Verdicts: Wrong Answer

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S, T= input().split()
A, B= map(int, input().split())
U= input().split()
 
if (S==U):
    print(A-1,B)
else if (T==U):
    print(A,B-1)
else:
    print(A,B)

S, T= input().split()
A, B= map(int, input().split())
U= input().split()

if (S==U):
    print(A-1 B)
else:
    print(A B-1)

S, T= input().split()
A, B= map(int, input().split())
U= input().split()

if (S==U):
    print(str(A-1) B)
else:
    print(A str(B-1))

S, T= input().split()
A, B= map(int, input().split())
U= input().split()
 
if (S==U):
    print(A-1,B)
else if (T==U):
    print(A,B-1)

S, T= input().split()
A, B= int(input().split())
U= input().split()

if (S==U):
    print(A-1 B)
else:
    print(A B-1)

S, T= input().split()
A, B= map(int, input().split())
U= input().split()
 

if (S==U):
    
    print(A-1,B)
elif (T==U):
    print(A,B-1)
else:
    print(A,B)

S,T=input().split()
A,B=map(int, input().split())
U=input().split()
if(S==U):print(A-1,B)
else if(T==U):print(A,B-1)

S, T= input().split()
A, B= map(int, input().split())
U= input().split()

if (S==U):
    print(A-1,B)
else:
    print(A,B-1)

S, T= input().split()
A, B= map(int, input().split())
U= input()
if (S == U):
    print(A-1,B)
elif (T == U):
    print(A,B-1)
else:
    print(A,B)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S, T = input().split()
A, B = map(int,input().split)
U = input()
 
if U == S:
    print(A-1 , B)
else:
    print(A , B-1)

S, T = map(input().split())
A, B = map(int,input().split)
U = input()

if S == U:
    print(A-1 " " B)
else:
    print(A " " B-1)


S, T = input().split()
A, B = map(int,input().split)
U = input()

if S == U:
    print(A-1 " " B)
else:
    print(A " " B-1)


S, T, U = map(input().split())
A, B = map(int,input().split)

if S == U:
    print(S-1 " " T)
else:
    print(S " " T-1)


S, T = input().split()
A, B = map(int, input().split)
U = input()
 
if S == U:
    print(A-1 , B)
else:
    print(A , B-1)

S, T = input().split()
A, B = map(int,input().split)
U = input()
 
if S == U:
    print(A-1 , B)
else:
    print(A , B-1)

S, T = input().split()
A, B = map(int,input().split())
U = input()
 
if S == U:
    print(A-1 , B)
else:
    print(A , B-1)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S, T = map(str, input().split())
A, B = map(int, input().split())
U = input(str)
if S == U:
  print(A-1, end=" ")
  print(B)
else:
  print (A, end=" ")
  print(B-1)

S, T = map(str, input().split())
A, B = map(int, input().split())
U = input(str)
if S == U:
  print(A-1),
  print(B),
else:
  print(A),
  print(B-1),

S, T = map(str, input().split())
A, B = map(int, input().split())
U = str(input())
if S == U:
  print(A-1, end=" ")
  print(B)
else:
  print (A, end=" ")
  print(B-1)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

s, t = read().decode().split()
a, b = map(int, read().split())
u = read().decode()

if u == s:
    a -= 1
else:
    b -= 1

print(a, b)


import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

s, t = readline().decode('utf-8').split()
a, b = map(int, readline().split())
u = read().decode('utf-8').rstrip()

if u == s:
    a -= 1
else:
    b -= 1

print(a, b)


Verdicts: Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
def main():
 s,t = input().split()
 a,b = int(input().split())
 u = input()
 if s == u:
     a -= 1
 else:
     b -= 1
main()

def main():
 s,t = input().split()
 a,b = int(input().split())
 u = input()
 if s == u:
     a -= 1
 else:
     b -= 1
 print(a,b)
main()

def main():
 s,t = input().split()
 a,b = map(int,input().split())
 u = input()
 if s == u:
     a -= 1
 else:
     b -= 1
 print(a,b)
main()

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S,T=map(int,input().split())
A,B=map(int,input().split())
U=input()
if U==S:
  A=A-1
else:
  B=B-1
print('{} {}'.format(A,B))


S,T=input().split()
A,B=map(int,input().split())
U=input()
if U==S:
  A=A-1
else:
  B=B-1
print('{} {}'.format(A,B))


Verdicts: Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S,T=map(str,input().split())
A,B=map(int,input().split())
U=input()
if S==U:
  A-=1
else:
  B-=1
print(A<B)


S,T=map(str,input().split())
A,B=map(int,input().split())
U=input()
if S==U:
  A-=1
else:
  B-=1
print(A,B)


Verdicts: Wrong Answer

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S, T = map(input().split())
A, B = map(int, input().split())
U = input()
ans = 0

if(S == U):
  ans = A - 1
  print(ans,B)
else:
  ans = B - 1
  print(A,ans)

S, T = map(input().split())
A, B = map(int, input().split())
U = input()
ans = 0

if(S == U):
  ans = A - 1
  print(ans,B)
else:
  ans = B - 1
  print(A,ans)

S, T = map(str,input().split())
A, B = map(int, input().split())
U = input()
ans = 0

if(S == U):
  ans = A - 1
  print(ans,B)
else:
  ans = B - 1
  print(A,ans)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S,T=map(int,input().split())
A,B=map(int,input().split())
U=int(input())

if S==U:
    A-=1
else:
    B-=1

print(str(A)+" "+str(B))


S,T=input().split()
A,B=map(int,input().split())
U=input()

if S==U:
    A-=1
else:
    B-=1

print(str(A)+" "+str(B))

Verdicts: Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
n, k = (int(x) for x in input().split())
p = list(int(x) for x in input().split())

max_val = 0
for i in range(0, len(p)-k+1):
  tmp = p[i:i+k]
  val = sum([sum([x for x in range(1, t+1)]) / t for t in tmp])

  if max_val < val:
    max_val = val

print('{:.12f}'.format(val))

s, t = input().split()
a, b = (int(x) for x in input().split())
u = input()

if s == u:
  a -= 1
else:
  b -= 1

print('{} {}'.format(a, b))

Verdicts: Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
s,t = input().split()
a,b = map(int, input().split())
u = input()

dic = {s: a, t: b}
dic[u] -= 1
print(dic[s] + ' ' + dic[t])

s,t = input().split()
a,b = map(int, input().split())
u = input()
 
dic = {s: a, t: b}
dic[u] -= 1
print(str(dic[s]) + ' ' + str(dic[t]))

Verdicts: Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S,T = map(int,input().split())
A,B = map(int,input().split())
s = input()

if s == S:
    A -=1
else:
    B -=1
print(A,B)

N = int(input())
A = list(map(int, input().split()))
res = "YES"
A.sort()
for i in range(len(A)):
    if i == 0:
        continue
    if A[i-1] == A[i]:
        res = "NO"
        break
    else:
        continue
print(res)


S,T = map(str,input().split())
A,B = map(int,input().split())
s = input()

if s == S:
    A -=1
elif s == T:
    B -=1
print(A,B)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S, T = map(int, input().split())
A, B = map(int, input().split())
U int(input())

if U == S:
  A -= 1
if U == T:
  B -= 1
  
print(A, B)


S, T = input().split()
A, B = map(int, input().split())
U = input()
 
if U == S:
  A -= 1
if U == T:
  B -= 1

print(A, B)

Verdicts: Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
s, t = map(str, input().split())
a. b = map(int, input().split())
u = input()

if s == u:
  print("{} {}".format(a-1, b))
else:
  print("{} {}".format(a, b-1))


s, t = input().split()
a. b = map(int, input().split())
u = input()

if s == u:
  print(a-1 b)
else:
  print(a b-1)


s, t = input().split()
a. b = map(int, input().split())
u = input()

if s == u:
  print("{} {}".format(a-1, b))
else:
  print("{} {}".format(a, b-1))


s, t = input().split()
a, b = map(int, input().split())
u = input()

if s == u:
  print("{} {}".format(a-1, b))
else:
  print("{} {}".format(a, b-1))


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
s,t=map(str,input().spilt())
a,b=map(int,input().split())
u=input()
if u==s:
  print(s-1,t)
else:
  print(s,t-1)

s,t=map(str,input().spilt())
a,b=map(int,input().split())
u=input()
if u==s:
  print(str(a-1),str(b))
else:
  print(str(a),str(b-1))

s,t=map(str,input().spilt())
a,b=map(int,input().split())
u=input()
if u==s:
  print(a-1,b)
else:
  print(a,b-1)

s,t=map(str,input().split())
a,b=map(int,input().split())
u=input()
if u==s:
  print(str(a-1)+' '+str(b))
else:
  print(str(a)+' '+str(b-1))

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S, T = input().split()
A, B = map(int, input().split())
if S == input():
  A -=1
else:
  B -=1
print("{0}" "{1}".format(A, B))



S, T = input().split()
A, B = map(int, input().split())
if S == input():
    A -= 1
else:
    B -= 1
print("{0} {1}".format(A, B))


Verdicts: Wrong Answer

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):

# ABC154
#A Remaining balls
s, t = map(input().split())
a, b = map(int, input().split())
u = input()
if s == u:
    a = a - 1
else:
    b = b -1
print(a, b)


# ABC154
#A Remaining balls
s, t = map(str,input().split())
a, b = map(int, input().split())
u = input()
if s == u:
    a = a - 1
else:
    b = b -1
print(a, b)


Verdicts: Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
Moji = input().split()
Ball = input().split()
Takahasi = input()

if Moji == Takahasi:
  print(int(Ball[0])-1,int(Ball[1]))
else:
  print(int(Ball[0]),int(Ball[1])-1)

Moji = input().split()
Ball = input().split()
Takahasi = input()

if Moji[0] == Takahasi:
  print(int(Ball[0])-1,int(Ball[1]))
else:
  print(int(Ball[0]),int(Ball[1])-1)


Verdicts: Wrong Answer

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
S = input().split()
A = list(map(int, input().split()))
Z = input()

if S[0] == Z:
  X = A[1]
  Y = A[0] - 1
if S[1] == Z:
  X = A[0]
  Y = A[1]-1
  
print("{} {}".format(X, Y))

S = input().split()
A = list(map(int, input().split()))
Z = input()
 
if S[0] == Z:
  X = A[0] - 1
  Y = A[1]
  print("{} {}".format(X, Y))
if S[1] == Z:
  X = A[0]
  Y = A[1] - 1
  print("{} {}".format(X, Y))
  


Verdicts: Wrong Answer

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
s,t = input().split()
sn,tn = map(int,input().split())
u  = input()

if s == u:
    print((sn-1) + ' '+ tn)
else:
    print(sn + ' ' + (tn-1))

s,t = input().split()
sn,tn = map(int,input().split())
u  = input()

if s == u:
	print((sn-1) ' '+ (tn))
else:
	print(sn + '' + (tn-1))

s,t = input().split()
sn,tn = map(int,input().split())
u  = input()

if s == u:
    print(str(sn-1) + ' '+ str(tn))
else:
    print(str(sn) + ' ' + str(tn-1))

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: We have A balls with the string S written on each of them and B balls with the string T written on each of them.   From these balls, Takahashi chooses one with the string U written on it and throws it away.   Find the number of balls with the string S and balls with the string T that we have now.

Submission attempts (in order):
[S, T] = [x for x in input().split()]
[A, B] = [int(x) for x in input().split()]
U = input()

if U == S:
    A -= 1
else:
    B -= 1
print([A,B])

[S, T] = [x for x in input().split()]
[A, B] = [int(x) for x in input().split()]
U = input()

if U == S:
    A -= 1
else:
    B -= 1
print(str(A)+' '+str(B))

Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s = input()
print(x * len(s))

s = input()
print('x' * len(s))

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s=input()
print(x*len(s))

s=input()
print("x"*len(s))

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
S = input()
ans = ''.join(['x' for _ in range(len(S))])
ans

S = input()
ans = ''.join(['x' for _ in range(len(S))])
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
S = input()
print("s" * len(S))

S = input()
print("x" * len(S))

Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s=input()

l=len(s)
a=""
for i in range(l):
  a+"x"
  
  
print(a)

s=input()

l=len(s)

for i in range(l):
  s[i]="x"
  
  
print(s)


s=input()

l=len(s)

for i in range(l):
  s[i]=x
  
  
print(s)

s=input()
a=""

l=len(s)

for i in range (l):
  a=a+"x"
print(a)

Verdicts: Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
color = input().split()
num = input().split()
choice = input()

for i in range(2):
  if choice == color[i]:
    num[i] = int(num[i]) - 1 
    
print(num)

s = input()
c = ''
for i in range(len(s)):
  c += 'x'
  

print(c)

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
S=input()
x=""
for i in range(len(S)):
  x+"x"
print(x)


S=input()
x=""
for i in range(len(S)):
  x+="x"
print(x)

Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
def main():
    s = input()
    n = len(s)
    ans = ''
    for _ in range(n):
        ans += "*"
    print(ans)


if __name__ == "__main__":
    main()


def main():
    s = input()
    n = len(s)
    ans = ''
    for _ in range(n):
        ans += "x"
    print(ans)


if __name__ == "__main__":
    main()


Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s = input()
l = []

for i in s:
  i = 'x'
  i += i*(len(s))
print(i)




s = input()

print('x'*len(s))

Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
def resolve_B():
    s = input()
    l = len(s)
    print("x" * l)
resolve_B

def resolve_B():
    s = input()
    l = len(s)
    print("x" * l)
resolve_B()

Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s = input()
print('x'*s)

s = input()
print('x'*len(s))

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s=input()
for i in len(s):
    s[i]="x"
print(s)

s=input()
for i in s:
    i="x"
print(s)

s=len(input())
print("x"*s)

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
#include <bits/stdc++.h>
using namespace std;

int main() 
{
  string s;
  cin >> s;
  for (int i = 0; i < s.length(); i++) {
    cout << "x";
  }

}

s = input()
i = len(s)
print("x"*i)

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s = input()
x = ""
for i in s
	x+="x"
print(x)

s = input()
x = ""
for i in s:
	x+="x"
print(x)


Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
def makex(S):
    m="S"
    n=len(m)
    print("x"*7)

s=len(input())
2 print('x' * len(s))

S=input()
n=len(S)
print("x"*n)


Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
S = input()

print("X"*len(S))

S = input()

print("x"*len(S))


Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
S = input()
print(x * len(S))


S = input()
print('x' * len(S))


Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s = input()
l = len(input())
print('x'*l)

l = len(input())
print('x'*l)

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
for i in range(len(str(input()))):
  print("x")

for i in range(len(str(input()))):
  print("x")

import re

s = str(input())

print(re.sub('[a-z]', 'x', s))

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
c = input()
#print(len(c))
print('×'*len(c))

c = input()
#print(len(c))
print('x'*len(c))

Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
S=input()
word="S"
print(word.replace("S","X")*len(S))

S=input()
word="S"
print(word.replace("S","X")*len(S))

S=input()
word="S"
print(word.replace("S","x")*len(S))

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s = open(0).read()
print("x" * len(s))

s = open(0).read()
print("x" * len(s))

s = open(0).read().rstrip()
print("x" * len(s))

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
print(''*len(input()))

print('x'*len(input()))


Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
# -*- coding: utf-8 -*-
def main():
    StringS = input();
    list = [];
    max = len(StringS);
    for i in range(max):
        print('x');

main()


# -*- coding: utf-8 -*-
def main():
    StringS = input();
    list = '';
    max = len(StringS);
    for i in range(max):
        list = list + 'x';
    print(list);

main()


Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s = input()
print(x*len(s))

s = input()
print('x'*len(s))

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
S = input()
l = len(S)
ans = "*" * l
print(ans)

S = input()
print("*"*len(S))

S = input()
l = len(S)
ans = "x" * l
print(ans)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
import re
S = input()
print(len(S))
T = 'x'
for i in range(len(S) - 1):
  T = T + 'x'
print(T)

import re
S = input()
T = 'x'
for i in range(len(S) - 1):
  T = T + 'x'
print(T)

Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
S = input()
ans = []

for i in range(1,len(S)):
    ans.append("x")

print("".join(ans))

S = input()
S.replace()

ans = []

for i in range(1,len(s)):
    ans.append("x")

print("".join(ans))

S = input()
S.replace()

ans = []

for i in range(len(s)):
    ans.append("x")

print("".join(ans))

S = input()
ans = []

for i in range(len(S)):
    ans.append("x")

print("".join(ans))

Verdicts: Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
def main():
  S=input()
  nums = len(S)
  print(type(nums))
  xs = ''
  for num in range(nums):
    xs += "x"
  print(xs)
main()

def main():
  S=input()
  nums = len(S)
  print(type(nums))
  xs = ''
  for num in range(nums-1):
    xs += "x"
  print(xs)
main()

def main():
  S=input()
  nums = len(S)
  xs = ''
  for num in range(nums):
    xs += "x"
  print(xs)
main()

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s = input()
print('×' * len(s))

s = input()
print('×' * len(s), end='')

s = input()
print('x' * len(s))

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
input1 = len(input())
print("X"*input1)

input1 = len(input())
print("x"*input1)


Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s = input()
a = 'x'
print('a' * len(s))

s = input()

a = x

print('x' * len(s))

s = input()

a = x

print('a' * len(s))

s = input()
print('x' * len(s)) 

Verdicts: Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
a = list(input().split())
n = len(a)
for i in range(n):
  a[i] = "x"
print(a)


a = list(input())
n = len(a)
for i in range(n):
  a[i] = "x"
l = "".join(a)
print(l)


Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
# -*- coding: utf-8 -*-
s=str(input())
n=len(n)
print('x'*n)

# -*- coding: utf-8 -*-
s=str(input())
n=len(s)
print('x'*n)

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
a=input()
for i in range(len(a)):
  a[i]='x'
print(a)

a=input()
b=''
for i in range(len(a)):
  b+='x'

print(b)

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
import re
char=input()
re.sub(".", "x", char)

import re
char=input()
print(re.sub(".", "x", char))

Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s = input()
ans = 'x' * len(s)
print(len(input()) * 'x')

print(len(input()) * 'x')

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s = str(input())
n = len(s)
for i in range(n):
   A=(s.replace(s[i],"x"))

print(A)

s = str(input())
n = len(s)
print("x"*n)

Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
u = input()
for i in len(u):
    u[i]="x"
print(u)

u = input()
for i in u.length:
    u[i]="x"
print(u)

u = input()
for i in (len(u)-1):
    u[i]="x"
print(u)

t=input()
u=list(t)
for i in range(len(u)):
    u[i]="x"
    i+=1
t=''.join(u)
print (t)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
a,b = map(str,input().split())
c,d = map(int,input().split())
n = input()
if n == a:
    print(str(c-1)+" "+str(d))
else:
    print(str(c) + " " + str(d-1))

s = input()
m = ""
for i in s:
    m = m + i.replace(i, 'x')
print(m)

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
S = input()
T = S.replace("*","x")[
print(T)


S = input()
T = S.replace("*","x")
print(T)

S = input()
i= len(S)
for j in  range(i):
  S[j]="x"
print(S)

S= input()
t= len(S)
print("x" * t)

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
a=input()
b=int(len(a))
c="x"
d="x"
for i in range(b):
  d=d+c
print(d)

a=input()
b=int(len(a))
c="x"
d="x"
i=0
while i<b-1:
  d=d+c
  i=i+1
print(d)

Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s = input()
for i in range(len(s)):
  s[i] = 'x'
print(s)  

s = input()
print("x"*len(s))

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
print('x'*len(input())

S = input()
print('x'*len(S))

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
S ＝ input()
print("x" * len(S))

S = input()

print("x" * len(S))

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
print("x"*len(input))

print("x"*len(input()))

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
S = input()
out = ""

for i in range(S.len()):
  out += "x"

print(out)

S = input()

tmp = ""

for i in range(len(S)):
  tmp += "x"

print(tmp)

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
str = input()
out = ["x"]*len(str)
 
print(out)

str = input()
out = ["x"]*len(str)
print("".join(out))


Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
sardine

s = input()
length = len(s)

ans = ''

for i in range(length):
    ans += 'x'

print(ans)

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
S = list(input())
print(S)
for i in range(len(S)):
    S[i]='x'
print(*S, sep='')

S = list(input())
for i in range(len(S)):
    S[i]='x'
print(*S, sep='')

Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
s = input()
print(["x"]*len(s))


s = input()
print(*["x"]*len(s),sep="")


Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):

s = input()

print(["x"] * len(s))



s = input()
t = []
for i in range(len(s)):
    t.append("x")
strT = "".join(t)
print(strT)


Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
num = input()
ad = ""
for i in num:
  ad.append("x")
print(ad)
  

num = input()
ad = ""
for i in num:
  ad+="x"
print(ad)
  

Verdicts: Runtime Error

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
import re

txt = "The rain in Spain"
x = re.sub("[a-z]", "x",txt)
print(x)

import re

txt = input()
x = re.sub(".", "x",txt)
print(x)

Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
S = [input()]


n = len(S)
for i in range(n):
  S[i] = 'x'

ans = ''
for i in range(n):
  ans += S[i]

S = list(input())


n = len(S)
for i in range(n):
  S[i] = 'x'

ans = ''
for i in range(n):
  ans += S[i]

print(ans)

Verdicts: Wrong Answer

Accepted
Problem: Given is a string S. Replace every character in S with `x` and print the result.

Submission attempts (in order):
S=input()
newS='X'*len(S)
print(newS)

S=input()
newS='x'*len(S)
print(newS)

Verdicts: Wrong Answer

Accepted