TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = int(input())

def cal_S(r):
    return r**2

print(cal_S(r))


r = int(input())

def cal_S(r):
    return 3*r**2

print(cal_S(r))


Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = input()
s = 3*r**2
print(s)

r = int(input())
s = 3*r**2
print(s)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = int(input())
print(2*r*r)

r = int(input())
print(3*r*r)


Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r=input()
a= 3*r**2
print(a)

print(3*int(input())**2)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
import numpy as np

n = int(input())
A = np.array(list(map(int,input().split())))

balls = np.array([0]*(n+1))

for i in range(1,n+1):
    s = sum(balls[n+1-i::n+1-i])
    if s%2 != A[-i]:
        balls[-i] += 1

#print(balls)

ans = np.where(balls==1)[0].tolist()
if sum(balls):
    print(sum(balls))
    print(*ans)
else:
    print(0)

print(a*int(input())**2)

a = int(input())
print(3*a**2)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r=int(input())
print(3*a*a)

a=int(input())
print(3*a*a)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = input()
result = 3*r*r
print(result)

r = int(input())
result = 3*r*r
print(result)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
print(3*(int(input())**3))

print(3*int(input())**3)

print(3*(int(input())**2))

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
D = 3 * r**2

D = 3 * (r**2)

r = int(input())
D = 3 * (r**2)
print(D)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
n, k = map(int, input().split())
dp = {}

dp[(0, 0, 0)] = 1

def perm(i, j, k):
  if (i, j, k) in dp:
    return dp[(i, j, k)]
  
  if i < 0 or j < 0 or k < 0 or i < j:
    return 0
  
  dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\
                + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\
                +  1*perm(i-1, j-1, k-2*j))%int(10e9+7)
  return dp[(i, j, k)]

print(perm(n, 0, k))

r = int(input())

print(3*r*r)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
n = int(input())
a = [int(s) for s in input().split()]
tmpa = a 
tmpa.sort()
for x in a:
  if x == tmpa[n-1]:
    print(tmpa[n-2])
  else:
    print(tmpa[n-1])
"""
if a[0] > a[1]:
  m,m2 = a[0],a[1]
else:
  m,m2 = a[1],a[0]

for x in a[2:]:
  if x > m2:
    if x>m:
      m2,m = 

"""


n = int(input())

print(3 * (n ** 2))

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
import math

N, D = list(map(int, input().strip().split(" ")))

print( int(math.ceil(N // (2 * D)))

import math
 
N, D = list(map(int, input().strip().split(" ")))

if D == 0:
    print(N)
elif N == 0:
    print("0")
else:
	print( int(math.ceil(N / (2 * D))))

r = int(input())

print( 3 * r * r)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = int(intput())
print(3*r*r)

r = int(input())
print(3*r*r)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
n = int(input())
print(4*n*n)

n = int(input())
print(3*n*n)

Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
n = int(input())
a = [int(input()) for i in range(n)]
b = sorted(a)

for A in a:
    if A == b[n - 1]:
        print(b[n - 2])
    else:
        print(b[n - 1])

n = int(input())
a = [int(input()) for i in range(n)]
b = sorted(a)

for A in a:
    if A == b[n - 1]:
        print(b[n - 2])
    else:
        print(b[n - 1])


r = int(input())

print(3 * r * r)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
n = int(input())
d = int(input())
ans = n // (2*d + 1)
if n % (2*d + 1) == 0:
  print(ans)
else:
  print(ans+1)


r = int(input())

print("{}".format(3*r*r))

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = input()
print(3*(r**2))

r = int(input())
print(3*(r**2))


Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r=int(input())
return(3*r^2)

r=int(input())
print(3*(r**2))

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
print(3*(int(input()**2))

print(3*(int(input())**2))

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
a = int(input())

b = 3 * (a^2)

print(b)

a = int(input())
b = 3 * (a ** 2)
print(b)

Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = int(input())
print(4 * r * r)

r = int(input())
print(3*r*r)

Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r=input()
print(3*r*r)

r=int(input())
print(3*r*r)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
n = int(input())
a = [int(input()) for i in range(n)]

m = max(a)

for i in range(n):
    if m >= a[i]:
        print(m)
    else:
        b = a[i]
        a.remove(b)
        print(max(a))
        a.insert(i,b)

r = int(input())

print(3*(r**2))

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = input()
print(3 * r**3)

r = int(input())
print(3 * r * r * r)

r = int(input())
print(3 * r**)

r = input()
print(3 * r^3)

r = int(input())
print(3 * r ** 3)

r = int(input())
print(3 * r**2)

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

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

print(N//(2*D+1)+1)

a = int(input())
s = 3 * a **2
print(s)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
N = int(input())
ans = 0
lst = list(map(int, input().split()))
slice_lst = lst[:int(N / 2)]
for i,k in enumerate(reversed(slice_lst)):
  sub_lst = lst[len(slice_lst)-i-1:len(lst):len(slice_lst)-i]
  if (k != sum(sub_lst) % 2):
    if (k == 0):
      lst[len(slice_lst)-i-1] = 1
    else:
      ans = -1
      break

if (ans == -1):
  print(ans)
else:
  ans_lst = []
  for i,k in enumerate(lst):
    if (k == 1):
      ans_lst.append(str(i+1))
  print(len(ans_lst))
  result = ' '.join(ans_lst)
  print(result)

r = int(input())

print(3 * r **2)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r=int(input())
ans=3*r**2

r=int(input())
ans=3*r**2
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
print(r**2*3)

r = int(input())

print(r**2*3)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
N = int(input())
A = [int(input()) for i in range(N)]
M = max(A)
c = A.count(M)
a = list(set(A))
a.sort(reverse=True)
 
for i in range(N):
  if A[i] != M:
    print(M)
  else:
    if c >= 2:
      print(M)
    else:
      print(a[1])

print(((int(input()))**2)*3)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = int(input())
S = 3*r*r*r
print(S)

r = int(input())
S = 3*r*r
print(S)

Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
N = int(input())
print(3*r**2)

r = int(input())
print(3*r**2)


Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
# -*- coding: utf-8 -*-

a = int(input())
ans = 3 * a^2

print(ans)

# -*- coding: utf-8 -*-

a = int(input())
ans = 3 * (a**2)

print(ans)

Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = input()
print(3 * r * r)

r = input()
r = int(r)
print(3 * r * r)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
import copy
N = int(input())
a = [input() for i in range(N)]
b = copy.deepcopy(a)
for i in b:
    del b[i]
    print(max(b))
    b = copy.deepcopy(a)

hankei = int(input())
ans = 3*(hankei*hankei)
print(ans)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
a = int(input())
print(3＊a＊a)


a = int(input())
print(3*a*a)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
print(3*input()*input())

print(3 * input())

r = input()
s = 3 * (a ** 2)
print(s)

r = input()
s = 3 * r * r
print("s")

r = map(int,input())
s = 3 * r ** 2
print(s)

r = map(int,input().int())
s = 3 * r ** 2
print(s)

r = map(int,input())
s = 3 * r * r
print("s")

r = map(int,input().split())
s = 3 * r * r
print("s")

r = input()
s = 3 * (r ^ 2)
print(3 * s)

r = input()
s = 3 * (r ** 2)
print(s)

r = input()
s = 3 * (r ** 2)
print("s")

r = input()
s = 3 * a ** 2
print("s")

r = int(input())
s = 3 * r * r
print(s)

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r=int(input())
return(3*r*r)

r=int(input())
print(3*r*r)


Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
print(3*(int(input()**2)))

r = int(input())
print(r**2*3)


Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = input()
print(3*r*r)

r = 0

s = 3*r*r
printf(s)

r = float(input())
print(3*r*r)

r = int(input())
print(3*r*r)

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
def main():
    n = int(input())
    p_l = list(map(int, input().split()))
    cnt = 0
    for i in range(n):
        if p_l[i] == i + 1: continue
        else: cnt += 1
    if cnt > 2: print("NO")
    else: print("YES")
if __name__ == "__main__":
    main()

def main():
    r = int(input())
    print( 3 * r ** 2)
if __name__ == "__main__":
    main()

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
a,b=map(int,input().split(' '))
print(-(-a//(1+2*b)))


N, D = map(int, input().split())

if N % (2*D + 1) == 0:
  print(N // (2*D + 1))
else:
  print(N // (2*D + 1) + 1)


N,D=map(int, input().split())
b2=D*2+1
print(-(-N//b2))


a,b=map(int,input().split())
print(-(-a//(1+2*b)))


r = int(input())
d = 3*(r**2)
print(d)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = int(input())
print(3*(r^2))

print(3*(int(input())**2))

Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
N = int(input())
a = list(map(int, input().split()))
ans = []
for i in range(N):
	if sum(x % (N - i) for x in ans) != a[N - 1 - i]:
		ans.append(N - i)
print(len(ans))
Ans = [str(x) for x in ans]
print(' '.join(Ans))

r = int(input())
print(3 * (r ** 2))

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = int(input())
print((3 * r*r)

r = int(input())
print(3 * r*r)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
x = int(input())
print(3(*x**2))

x = int(input())
print(3*(x**2))

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = int(input())

print(3 * r ** r)

r = int(input())


print(3 * r ** 2)

Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
N = int(input())
B = [int(i) for i in input().split()]
S = [0]*N
cnt = 0
for i in range(N-1, -1, -1):
  A = S[i::i+1]
  if sum(A)%2 == B[i]:
    continue
  elif sum(A)%2 == 0 and B[i] == 1:
    S[i] += 1
    cnt += 1
  elif sum(A)%2 == 1 and B[i] == 0:
    S[i] += 1
    cnt += 1
print(cnt)
for i in range(N):
  if S[i] == 1:
    print(i+1, end=" ")

a = int(input())
print(3*a**2)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
import math
n,d=map(int,input().split())
print(math.ceil(n/(2*d+1)))

r=int(input())
print(3*r**2)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
int r
int t
t = 3*r*r
print(t)

r=int(input())
print(3*(r**2))

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r=input()
print(3*r*r)

a,b=map(int,input().split())
c=(a//(2b+1))+1
print(c)

r=int(input())
print(3*r**2)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
N, D = map(int, input().split())
print((N+2*D)//(2*D+1))



N, D = map(int, input().split())
print(int((N+2*D)/(2*D+1)))



from math import ceil 
N, D = map(int, input().split())
print(ceil(N/(2*D+1)))



N, D = map(int, input().split())
# print(int((N+2*D)/(2*D+1)))
print((N+2*D)//(2*D+1))



N, D = map(int, input().split())
print(int((N+2*D)/(2*D+1)))

# A - Dodecagon

r = int(input())
print(3*r**2)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
n,d = map(int,input().split())
sight = 2*d+1
print((n//sight) + (n%sight != 0))
    


print(3*(int(input())**2))

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
a = int(input())
print(3 * a**3)

a = int(input())
print(3 * a**2)


Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

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

Result = 3*Input**2

print(Result)

Input =  int(input())

if 1<=Input<=100:
  Result = 3*Input**2

print(Result)


Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = int(input())
print(3*(r)*2)

r = int(input())
print(3*(r)**2)

Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
print(3 * int(input())**3)

print(3 * (int(input()) ** 2))

Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = int(input(""))
print(3*(r^2))

r = int(input(""))
print(int(3*(r*r)))

Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
a=float(input())
print(3*a*a)

a=float(input())
print(int(3*a*a))

Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
n=int(input());
num_list=[];
for i in range(n):
    num_list.append(int(input()));
    m=max(num_list)
for j in range(n):
    if(num_list[j]==m):
        num_list[j]=0;
        print(max(num_list))
    print(m);


n=int(input());
num_list=[];
for i in range(n):
    num_list.append(int(input()));
    m=max(num_list)
for j in range(n):
    if(num_list[j]==m):
        num_list[j]=0;
        print(max(num_list))
    else:
        print(m);


n=int(input());
num_list=[];
for i in range(n):
    num_list.append(int(input()));
    m=max(num_list)
for j in range(n):
    if(num_list[j]==m):
        print(m=max(num_list))
    print(m);


a=int(input());
print(3*a**3);

n=int(input());
num_list=[];
for i in range(n):
    num_list.append(int(input()));
    m=max(num_list)
for j in range(n):
    if(num_list[j]==m):
        print(max(num_list))
    print(m);


a=int(input());
print(3*a**2);

Verdicts: Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = float(input())
print(3*r**2)

r = int(input())
print(3*r**2)

Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
from sys import stdin
n = int(stdin.readline().rstrip())
li = list(int(stdin.readline().rstrip()) for _ in range(n))
li_to = sorted(li)
one = li_to[-1]
two = li_to[-2]
for i in range(n):
    if max(li) == li[i]:
        print(two)
    else:
        print(one)

from sys import stdin

n = int(stdin.readline().rstrip())
print(3*n**2)

Verdicts: Runtime Error

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
r = int(input())
print(3*r*r*r)

r = int(input())
print(3*r*r)

Verdicts: Wrong Answer

Accepted
Problem: It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.  Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Submission attempts (in order):
x = input()
print(3 * x ** 2)

x = int(input())
print(3 * x ** 2)

Verdicts: Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
S=list(input())
H=['']*4
for i in range(4):
    H[i]=S[i]
A=list(set(H))
if S.count(A[0])==2 and S.count(A[1])==2:
    print('Yes')
else:
    print('No')
print(H)

S=list(input())
H=['']*4
for i in range(4):
    H[i]=S[i]
A=list(set(H))
if S.count(A[0])==2 and S.count(A[1])==2:
    print('Yes')
else:
    print('No')


Verdicts: Wrong Answer

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

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


S = len(set(input()))
if S == 2:
  print('Yes')
else:
  print('No')

Verdicts: Wrong Answer

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

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

Red = N-K
Blue = K
mod = 1000000007

ans = 1
for i in range(Blue):
    if Red < i:
            ans = 0
    elif i != 0:
        ans = (ans * (Red + 1 - i) * (Blue - i) // ((i + 1) * i))
    else:
        ans = (ans * (Red + 1 - i) // (i + 1))
    print(int(ans) % mod)


S = input()

count = 0
if S[0] == S[1] and S[2] == S[3]:
    count += 1

if S[0] == S[2] and S[1] == S[3]:
    count += 1

if S[0] == S[3] and S[1] == S[2]:
    count += 1

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


Verdicts: Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):

s = input()


slist = list(s)
slist.sort()
print(slist)

if slist[0] == slist[1] and slist[2] == slist[3] and slist[0] != slist[2]:
    print("Yes")
else:
    print("No")

str = input()
strlist = list(str)
strlist.sort()

if strlist[0] == strlist[1] and strlist[2] == strlist[3] and strlist[0] != strlist[3]:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
s=input()
st=set(s)
print(st)
if len(st)==2:
    print("Yes")
else:
    print("No")

s=input()
st=set(s)

if len(st)==2:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
s = list(input())
slst = sorted(s)
if s[0]==s[1] and s[2]==s[3]:
	print("Yes")
else:
	print("No")

sls = list(input())
s = sorted(sls)
if s[0]==s[1] and s[2]==s[3] and s[0]!=s[2]:
	print("Yes")
else:
	print("No")

Verdicts: Wrong Answer

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
l = list(input().split())

dic = {}
for i, v in enumerate(l):
    if v in dic:
        dic[v] += 1
    else:
        dic[v] = 1

li = list(dic.values())

if len(li) == 2 and li[0] == 2 and li[1] == 2:
    print('Yes')
else:
    print('No')


l = list(input())

dic = {}
for i, v in enumerate(l):
    if v in dic:
        dic[v] += 1
    else:
        dic[v] = 1

print(dic)
li = list(dic.values())

if len(li) == 2 and li[0] == 2 and li[1] == 2:
    print('Yes')
else:
    print('No')


S = input()

if len(set(S)) == 2:
    print('Yes')
else:
    print('No')


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
s = input()
a = set(s)
print('Yes' if len(a) == 2 and s.count(a[0]) == 2 and s.count(a[1]) == 2 else 'No')

s = input()
a = list(set(s))
print('Yes' if len(a) == 2 and s.count(a[0]) == 2 and s.count(a[1]) == 2 else 'No')

Verdicts: Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

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

print('Yes' if all(S.count(s) == 2 for s in input()) else 'No')


S = input()

print('Yes' if all(S.count(s) == 2 for s in S) else 'No')


Verdicts: Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
A,B,C,D = input()
S = (A+B+C+D)
S1 = []
if A == B == C== D:
    print('No')
    exit()
for i in S:
    if i.strip(A) !='':
        S1.append(i.strip(A))
if S1[0] == S1[1] and len(S1) == 2 and len(S2) == 2:
    print("Yes")
else :
    print("No")


A,B,C,D = input()
S = (A+B+C+D)
S1 = []
if A == B == C== D:
    print('No')
    ezxt()
for i in S:
    if i.strip(A) !='':
        S1.append(i.strip(A))
if S1[0] == S1[1] and len(S1) == 2 and len(S2) == 2:
    print("Yes")
else :
    print("No")


A,B,C,D = input()
S = (A+B+C+D)
if len(S.strip(A)) == len(S.strip(B)) and len(S.strip(C)) == len(S.sript(D)):
    print("Yes")
else:
    print("No")

A,B,C,D = input()
S = (A+B+C+D)
if len(S.strip(A)) == len(S.strip(B)) and len(S.strip(C)) == len(S.strip(D)):
    print("Yes")
else:
    print("No")


A,B,C,D = input()
S = (A+B+C+D)
S1 = S.strip(A)
S2 = S.strip(S1)
if len(S1) == len(S2) and len(S1) == 2:
    print("Yes")
else:
    print("No")


A,B,C,D = input()
S = (A+B+C+D)
S1 = []
if A == B == C== D:
    print('No')
    exit()
for i in S:
    if i.strip(A) !='':
        S1.append(i.strip(A))
if len(S1) == 2:
        if S1[0] == S1[1]:
            print("Yes")
        else:
            print("No")
else :
    print("No")


Verdicts: Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
n = int(input())
P = list(map(int, input().split()))
count = 0
for i in range(1, n-1):
  A = [P[i-1], P[i], P[i+1]]
  sort = sorted(A)
  if sort[1] = A[1]:
    count += 1

print(count)


s = input()
a = set()
for i in len(s):
  a.add(i)
if len(a) == 2:
  print('Yes')
else:
  print('No')

s = input()
a = set()
for i in len(s):
  a.add(s[i])
if len(a) == 2:
  print('Yes')
else:
  print('No')


n = int(input())
P = [int(input()) for _ in range(n)]
count = 0
for i in range(1, n-1):
  A = [P[i-1], P[i], P[i+1]]
  sort = sorted(A)
  if sort[1] = A[1]:
    count += 1

print(count)


s = input()
a = set()
for i in range(len(s)):
  a.add(s[i])
if len(a) == 2:
  print('Yes')
else:
  print('No')


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
s = input()
l = len(s)
set_s = set(s)

if l == 4 and len(a) == 2:
    print('Yes')
else:
    print('No')

s = input()
l = len(s)
set_s = set(s)

if l == 4 and len(set_s) == 2:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
s=input()
d={}
for i in s:
    if i not in d:
        d[i]=1
    else:
        d[i]+=1
if len(d)==2:
    print("YES")
else:
    print("NO")

word=input()
word=sorted(word)
print(word)
if word[0]==word[1] and word[2]==word[3] and word[0]!=word[2] and word[1]!=word[3]:
    print('Yes')
else:
    print('No')

s = input()
a = set()
for i in s: a.add(i)
if len(a) == 2 and s.count(a[0]) == 2:
    print("Yes")
else:
    print("No")

s=input()
d={}
for i in s:
    if i not in d:
        d[i]=1
    else:
        d[i]+=1
v=list(d.values())
if len(d)==2:
    if (v[0]==2)and(v[1]==2):
        print("YES")
    else:
        print("NO")
else:
    print("NO")

line=sorted(list(input()))
if line[0]==line[1] and line[2]==line[3] and line[0]!=line[2]:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
S = input()
a = S[0]
b = S[1]
c = S[2]
d = S[3]
l = []
l.append(a)
l.append(b)
l.append(c)
l.append(d)
k = set(l)
if len(k) == 2:
  if count(a) == 2:
    print("Yes")
  else:
    print("No")
else:
  print("No")

S = input()
a = S[0]
b = S[1]
c = S[2]
d = S[3]
l = []
l.append(a)
l.append(b)
l.append(c)
l.append(d)
k = list(set(l))
if len(k) == 2:
  if count(a) == 2:
    print("Yes")
  else:
    print("No")
else:
  print("No")

S = input()
a = S[0]
b = S[1]
c = S[2]
d = S[3]
l = []
l.append(a)
l.append(b)
l.append(c)
l.append(d)
k = list(set(l))
if len(k) == 2:
  if l.count(a) == 2:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
s = list(input().split())
ans="No"
if s[0]==s[1] and s[2]==s[3] or s[0]==s[2] and s[1]==s[3] or s[0]==s[4] and s[1]==s[2]:
	ans="Yes"
print(ans)

s = input()

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


s = input()

s_l=s.sorted()
if s_l[0]!=s_l[1] or s_l[2]!=s_l[3] or s_l[0]==s[3]:
	print("No")
else :
	print("Yes")


s = list(input().split())
ans="No"
if s[0]==s[1] and s[2]==s[3] or s[0]==s[2] and s[1]==s[3] or s[0]==s[3] and s[1]==s[2]:
	ans="Yes"
print(ans)


s = input()

s=s.sorted()
if s[0]!=s[1] or s[2]!=s[3] or s[0]==s[3]:
	Print("No")
elif :
	print("Yes")

s = sorted(input())


if s[0]!=s[1] or s[2]!=s[3] or s[0]==s[3]:
	print("No")
else :
	print("Yes")


Verdicts: Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
s=input()
if len(set(input()))==2:
  print("Yes")
else:
  print("No")

s=input()
if len(set(s))==2:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):

s=list(input())
c = collections.Counter(s)
if list(c.values())==[2,2]:
    print("Yes")
else:
    print("No")


s=list(input())
import collections
s = collections.Counter(s)
if list(s.values())==[2,2]:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
print('YNeos'[len(set(input()))!=2::2]

print('YNeos'[len(set(input()))!=2::2])

Verdicts: Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
s=input()
t=[]
for i in range(4):
  if s[i] in t:
    t.append(t[i])
if len(t)==2:
  print("Yes")
else:
  print("No")

s=input()
s.sort()
if s[0]==s[1] and s[1]!=s[2] and s[2]==s[3]:
  print("Yes")
else:
  print("No")


s=input()
t=sorted(s)
u=''.join(t)
if u[0]==u[1] and u[1]!=u[2] and u[2]==u[3]:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
inputs_array = list(input())
check_dict = {}

is_words = False
is_two = True

for later in inputs_array:
  if later in check_dict:
    check_dict[later] += 1
  else:
    check_dict[later] = 1
    
for v in check_dict:
  if check_dict[v] == 2:
    continue
  else:
    is_two = False
    break

if len(check_dict) == 2:
  is_words = True
  
if is_words and is_two:
  print('YES')
else:
  print('NO')

inputs_array = list(input())
check_dict = {}

is_words = False
is_two = True

for later in inputs_array:
  if later in check_dict:
    check_dict[later] += 1
  else:
    check_dict[later] = 1
    
for v in check_dict:
  if check_dict[v] == 2:
    continue
  else:
    is_two = False
    break

if len(check_dict) == 2:
  is_words = True
  
if is_words and is_two:
  print('Yes')
else:
  print('No')

Verdicts: Wrong Answer

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

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

letters = []
for i in range(4):
  if not s[i] in letters:
    letters.append(s[0])
  
if len(letters)==2 and letters.count(s[0])==2:
  print('Yes')
else:
  print('No')


s = input()

letters = []
for i in range(4):
  if not s[0] in letters:
    letters.append(s[0])
  
if len(letters)==2 and letters.count(s[0])==2:
  print('Yes')
else:
  print('No')


s = input()

letters = []
for i in range(4):
  if not s[i] in letters:
    letters.append(s[i])
  
if len(letters)==2 and s.count(s[0])==2:
  print('Yes')
else:
  print('No')

print(letters)

s = input()

letters = []
for i in range(n):
  if not s[0] in letters:
    letters.append(s[0])
  
if len(letters)==2 and letters.count(s[0])==2:
  print('Yes')
else:
  print('No')

s = input()

letters = []
for i in range(4):
  if not s[i] in letters:
    letters.append(s[i])
  
if len(letters)==2 and s.count(s[0])==2:
  print('Yes')
else:
  print('No')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
S=input()
T=sorted(S.split())
print("Yes" if T[0] == T[1] and T[2]=T[3] and T[0] != T[2] else "No")


T=sorted(input())
print("Yes" if T[0] == T[1] and T[2] == T[3] and T[0] != T[2] else "No")

Verdicts: Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
import collections
s=list(input())
a=collections.Counter(s)
b=a.keys()
c=a.values()
values, counts = zip(*a.most_common())
if values[0]==values[1] and len(b)==2:
    print("Yes")
else:
   print("No")

s=list(input())
if s.count(s[0])==s.count(s[1])==s.count(s[2])==s.count(s[3])==2:
   print("Yes")
else:
   print("No")


Verdicts: Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
import collections
S = input()
L = collections.Counter(S)
if len(L) == 2 and L[0][1] == 2:
  print('Yes')
else:
  print('No')


import collections
S = input()
L = collections.Counter(S)
T = L.most_common()
if len(T) == 2 and T[0][1] == 2:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

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

if s[1]==s[2] and s[3]==s[4] and s[1]!=s[3]:
	print('Yes')
else:
  	print('No')

from collections import Counter
s=input()
t=Counter(s)
if len(t)==2 and max(t.values())==2:
	print("Yes")
else:
	print("No")

Verdicts: Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
a,b,c,d=input()
count=0

if(a==b):
    count+=1
    if(c==d and a!=c):
        count+=1
elif(a==c):
    count+=1
    if(b==d and a!=b):
        count+=1
elif(a==d):
    count+=1
    if(b==c ana a!=b):
        count+=1

if(count==2):
    print("Yes")
else:
    print("No")


a,b,c,d=input()
count=0

if(a==b):
    count+=1
    if(c==d):
        count+=1
else if(a==c):
    count+=1
    if(b==d):
        count+=1
else if(a==d):
    count+=1
    if(b==c):
        count+=1

if(count==2):
    print("Yes")
else:
    print("No")


a,b,c,d=input()
count=0

if(a==b or a==c or a==d):
    count+=1

if(b==c or b==d or c==d):
    if(b!=a and c!=a and d!=a):
    count+=1

if(count==2):
    print("Yes")
else:
    print("No")


a,b,c,d=input()
count=0

if(a==b or a==c or a==d):
    count+=1

if(b==c or b==d or c==d):
    if(b!=a and c!=a and d!=a)
    count+=1

if(count==2):
    print("Yes")
else:
    print("No")


N = int(input())
d = list(map(int, input().split())) 
print(len(d))

if(len(d)%2!=0):
    print(0)
else: 
    print(d[int(len(d)/2)]-d[int(len(d)/2)-1])

a,b,c,d=input()
count=0

if(a==b):
    count+=1
    if(c==d):
        count+=1
else if(a==c):
    count+=1
    if(b==d):
        count+=1
else if(a==d):
    count+=1
    if(b==c):
        count+=1

if(count==2):
    print("Yes")
else:
    print("No")


a,b,c,d=input()
count=0

if(a==b):
    count+=1
    if(c==d and a!=c):
        count+=1
elif(a==c):
    count+=1
    if(b==d and a!=b):
        count+=1
elif(a==d):
    count+=1
    if(b==c and a!=b):
        count+=1

if(count==2):
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
import sys

str = str(input())

if str[0] == str[1]:
  if str[2] == str[3]:
    print("Yes")
    sys.exit()
if str[0] == str[2]:
  if str[1] == str[3]:
    print("Yes")
    sys.exit()
else:
  print("No")

import sys

str = str(input())
list = []
for c in str:
  list.append(c)
list.sort()

if list[0] == list[2]:
    print("No")
    sys.exit()
if list[0] == list[1]:
  if list[2] == list[3]:
    print("Yes")
    sys.exit()
print("No")

Verdicts: Wrong Answer

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
def main():
    a= input()
    print(a)

    if a[0] == a[1]:
        if a[2] == a[3] and a[0] !=  a[2]:
            print("Yes")
        else:
            print("No")
    elif a[0] == a[2]:
        if a[1] == a[3] and a[0] !=  a[1]:
            print("Yes")
        else:
            print("No")
    elif a[0] == a[3]:
        if a[2] == a[1] and a[0] !=  a[2]:
            print("Yes")
        else:
            print("No")
    else:
        print("No")


if __name__ == "__main__":
    main()

def main():
    a= input()

    if a[0] == a[1]:
        if a[2] == a[3] and a[0] !=  a[2]:
            print("Yes")
        else:
            print("No")
    elif a[0] == a[2]:
        if a[1] == a[3] and a[0] !=  a[1]:
            print("Yes")
        else:
            print("No")
    elif a[0] == a[3]:
        if a[2] == a[1] and a[0] !=  a[2]:
            print("Yes")
        else:
            print("No")
    else:
        print("No")


if __name__ == "__main__":
    main()

Verdicts: Wrong Answer

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
s=sorted(input())
s.replace(s[0],"").replace(s[2],"")

print(s)
                       

s = set(input())
print('Yes' if len(s) == 2 else 'No')

Verdicts: Runtime Error

Accepted
Problem: You are given a 4-character string S consisting of uppercase English letters. Determine if S consists of exactly two kinds of characters which both appear twice in S.

Submission attempts (in order):
s=list(map(int,input().split()))
s1=s[0]
sf=s.count(s1)
for i in range(sf):
  s.remove(s1)
if s[0]==s[1]:
  print("Yes")
else:
  print("No")

s=list(input())
s1=s[0]
sf=s.count(s1)
if sf==2:
  for i in range(2):
    s.remove(s1)
  if s[0]==s[1]:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Verdicts: Runtime Error

Accepted