TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
# -*- coding: utf-8 -*-
# get a integer
a = input()
# output
if len(a) == 6 and a[2] == a[3] and a[4] == a[5]:
	print('Yes')
else
	print('No')

# -*- coding: utf-8 -*-
# get a integer
a = raw_input()
# output
print(len(a) == 6 and a[2] == a[3] and a[4] == a[5])

# -*- coding: utf-8 -*-
# get a integer
a = input()
# output
print(len(a) == 6 and a[2] == a[3] and a[4] == a[5])

# -*- coding: utf-8 -*-
# get a integer
a = input()
# output
if len(a) == 6 and a[2] == a[3] and a[4] == a[5]:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
def merge(A,B):
    C = []
    
    while len(A)!=0 and len(B) != 0:
        if A[0]>B[0]:
            C.append(A[0])
            del A[0]
        else:
            C.append(B[0])
            del B[0]

    if len(A)>len(B):
        C.extend(A)
    else:
        C.extend(B)

    return C

if __name__ == "__main__":
    X,Y,A,B,C = map(int,input().split())
    P = list(map(int,input().split()))
    Q = list(map(int,input().split()))
    R = list(map(int,input().split()))

    
    # P = [1,23,4,1,2]
    # Q = [4,3,56]
    # R = [70,20,1]

    P.sort(reverse=True)
    Q.sort(reverse=True)
    R.sort(reverse=True)

    S = merge(P[:X],Q[:Y])
    S = merge(S,R)
    
    score = 0
    for i in range(X+Y):
        score += S[i]
    print(score)



S = input()

if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s=input()
if s[3]==s[4] and s[5]==s[6]:
  print('Yes')
  exit()
  
print('No')

k,n=map(int,input().split())
a=list(map(int,input().split()))
b=0
s=[0]*n

for i in range(n-1):
    s[i]=a[i+1]-a[i]

for i in range(n):
  if s[i]<k/3:
    b=b+s[i]
  else:
    con=k-s[i]
    print(con)
    exit()
  
print(b)

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
S=input()
ans='no'

if S[2]==S[3] and S[4]==S[5]:
    ans='yes'
    
print(ans)

S=input()
ans='no'

if S[2]==S[3] or S[4]==S[5]:
    ans='yes'
    
print(ans)

S=input()
ans='No'

if S[2]==S[3] and S[4]==S[5]:
    ans='Yes'
    
print(ans)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
X,Y,A,B,C=map(int,input().split())
p=list(map(int,input().split()))
q=list(map(int,input().split()))
r=list(map(int,input().split()))

p.sort()
q.sort()
p.reverse()
q.reverse()

a=p[:]
a.extend(q)
a.extend(r)
a.sort()
a.reverse()
b=q[:]
b.extend(r)
b.sort()
b.reverse()
c=p[:]
c.extend(r)
c.sort()
c.reverse()
red=0
green=0
sum=0
sum1=0
sum2=0
d=0
for i in range((X+Y)*2):
  if(a[i] in p):
    red+=1
  elif(a[i] in q):
    green+=1
  d+=a[i]
  if(red>X and i-X-Y+1+green==Y):
    break
  if(i<X):
      sum1+=p[i]
      sum2+=c[i]
  if(i<Y):
      sum1+=b[i]
      sum2+=q[i]
  if(i==X+Y and red<=X and green<=Y):
    print(sum)
    break
  if(red>X and i-X-Y+1+green==Y):
    print(sum1)
    break
  elif(green>Y and i-X-Y+1+red==X):
    print(sum2)
    break

s=input()

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

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s = input().split()
s = [i for i in s]

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

s = list(input())

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


Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
a=input()
for i in range(0,int(len(a))):
  if(a[2]==a[3]):
	if(a[4]==a[5]):
      print("YES")
    else:
      print("NO")
  else:
    print("NO)
  

a=input()
if((a[2]==a[3])and(a[4]==a[5])):
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
n, k = map(int, input().split(" "))
houses = list(map(int, input().split(" ")))
dif_houses = [houses[x+1]-houses[x] for x in range(k-1)]
dif_houses.append(houses[0]-houses[k-1]+n)

max_dif = max(dif_houses)
print(n-max_dif)

s = input()
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s=input()
return s[2]==s[3] and s[4]==s[5]

s=input()
print(s[2]==s[3] and s[4]==s[5])

S = input()
print("Yes" if S[2]==S[3]and S[4]==S[5] else "No")

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s=input()
print('Yse' if s[2] is s[3] and s[4] is s[5] else 'No')

s=input()
print('Yes' if s[2] in s[3] and s[4] in s[5] else 'No')

Verdicts: Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s = input()
if s[2]==s[3] and s[4]==s[5]:
    print(Yes)
else:
    print(No)

s = str(input())
if s[2]==s[3] and s[4]==s[5]:
    print(Yes)
else:
    print(No)

s = str(input())
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
n=input()
if a[2]==a[3] and a[4]==a[5]:
  print("Yes")
else:
  print("No")

a=input()
if a[2]==a[3] and a[4]==a[5]:
  print("Yes")
else:
  print("No")


Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
X,Y,A,B,C = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
C_copy = C.copy()
for i in range(30):
    C_copy.append(0)
    C.append(0)
ux_1 = 0
uy_1 = 0
for i in range(X):
    ux_1 += max(max(A),max(C_copy))
    if max(A) >= max(C_copy):
        A.pop(A.index(max(A)))
    else:
        C_copy.pop(C_copy.index(max(C_copy)))
for i in range(Y):
    uy_1 += max(max(B),max(C_copy))
    if max(B) >= max(C_copy):
        B.pop(B.index(max(B)))
    else:
        C_copy.pop(C_copy.index(max(C_copy)))
print(ux_1 + uy_1)

S = str(input())
if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s = str(input())
if s[3]==s[4] && s[5]==s[6]:
    pritn("Yes")
else:
    print("No")

_in = list(map(int, input().split()))
k = _in[0]
n = _in[1]
p = 0
_i = list(map(int, input().split()))
dis = 0
mdis = k - _i[n-1] + _i[0]
for i in range(0,n-2):
    dis = _i[i+1]- _i[i]
    if dis>mdis:
        mdis = dis
print(k-mdis)

_in = list(map(int, input().split()))
k = _in[0]
n = _in[1]
p = 0
_i = list(map(int, input().split()))
dis = 0
mdis = k - _i[n-1] + _i[0]
for i in range(1,n-2):
    dis = _i[i+1]- _i[i]
    if dis>=mdis:
        mdis = dis
print(k-mdis)

s = str(input())
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
def solve():
  val = str(input())
  return val[2] == val[3] && val[4] == val[5]
solve();

def solve():
  val = str(input())
  if val[2] == val[3] and val[4] == val[5]:
    print('Yes')
  else:
    print('No')
solve();

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s = input()
if s[2:4] == 'ff' and s[4:6] == 'ee':
    print('Yes')
else:
    print('No')

s = input()
if s[3:4] == 'ff' and s[5:6] == 'ee'
    print('Yes')
else:
    print('No')

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

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
S=input().split()
if S[3]==S[4] and S[5]==S[6]:
    print('Yes')
else:
    print('No')


S=input()
if S[3]==S[4] and S[5]==S[6]:
    print('Yes')
else:
    print('No')


S=int(input())
if S[3]==S[4] and S[5]==S[6]:
    print('Yes')
else:
    print('No')

S=input()
if S[2]==S[3] and S[4]==S[5]:
    print('Yes')
else:
    print('No')


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

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

if S[3] ==S[4] and S[5] == S[6]:
  Print('Yes')
  else:
    Print('No')

S = input()
 
if S[3] ==S[4] and S[5] == S[6]:
  print('Yes')
else:
  print('No')

S = input()
 
if S[2] ==S[3] and S[4] == S[5]:
  Print('Yes')
else:
  Print('No')

S = input()
 
if S[3] ==S[4] and S[5] == S[6]:
  Print('Yes')
else:
  Print('No')

S = input()

if S[2]==S[3] and S[4]==S[5]:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
S = input();
 
if S[2]==S[3] & S[4]==S[5]:
  print("Yes");
else:
  print("No");

S = input();
 
if S[3]==S[4] & S[5]==S[6]:
  print("Yes");
else:
  print("No");

S = input();

if S[3]==S[4] & S[5]==S[6]:
  print("Yes");
else
  print("No");

S = input();
 
if S[2]==S[3] and S[4]==S[5]:
  print("Yes");
else:
  print("No");


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

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

if s[3]==s[4] and s[5]==s[6]:
    print("Yes")
else:
    print("No")

s = input()

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

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
def INT(): x = int(input()) return x
def LIST(): x = list(map(int, input().split())) return x

S = input()
if S[2]==S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")



S = str(input())
if S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
x = input()
if x[2]==x[3] and x[4]==x[5]:
  print("YES")
else:
  print("NO")

x = input()
if x[2]==x[3] and x[4]==x[5]:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s=input()
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
elif
    print("No")

s=input()
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
letters = eval(input("Enter: "))
for i in letters:
  print(["Yes" if (i[2]==i[3] and i[4]==i[5]) "Yes" if letters=="coffee-like" else "No"])

letters = eval(input("Enter: "))
for i in letters:
  print("Yes" if (i[2]==i[3] and i[4]==i[5]) "Yes" if letters=="coffee-like" else "No")

i = eval(input("Enter: "))
print(["Yes" if (i[2]==i[3] and i[4]==i[5]) "Yes" if letters=="coffee-like" else "No"])

letters = eval(input("Enter: "))
for i in letters:
	print(["Yes" if i[2]==i[3] and i[4]==i[5] else "No"])

l = input("Enter: ")
print("Yes" if (l[2]==l[3] and l[4]==l[5]) else "No")

letters = eval(input("Enter your words: "))
for i in letters:
  if (i[2]==i[3]) and (i[4]==i[5]:
      print("Yes")
  else:
      print("No")

letters = eval(input("Enter: "))
for i in letters:
  if i[2]==i[3] and i[4]==i[5]:
    print("Yes")
  elif letters=="coffee-like":
    print("Yes")
  else:
    print("No")

letters = eval(input("Enter your words: "))
for i in letters:
  print(["Yes" if (i[2]==i[3] and i[4]==i[5]) else "NO" )


l = eval(input("Enter: "))
for i in len(l):
  if len(l)<=6:
    if i[2]==i[3] and i[4]==i[5]:
      print("Yes")
    elif l=="coffee-like":
      print("Yes")
    else:
      print("No")
  print("No")
    

i = eval(input("Enter your words: "))
if (i[2]==i[3]) and (i[4]==i[5]:
      print("Yes")
elif i=="coffee-like":
    print("Yes")
else:
      print("No")

letters = eval(input("Enter your words: "))
for i in letters:
  if i[2]==i[3] and i[4]==i[5]:
    print("Yes")
  else:
    print("No")

l = input("Enter: ")
if len(l)<= 6 and l==[a-z]:
	print("Yes" if (l[2]==l[3] and l[4]==l[5]) else "No")

l = input("Enter: ")
print("Yes" if (l[2]==l[3] and l[4]==l[5] else "No"))

letters = eval(input("Enter: "))
if letters.index(2)==letters.index(3) and letters.index(4)==letters.index(5):
  print("Yes)
elif letters=="coffee-like":
  print("Yes")
else:
   print("No")

letters = eval(input("Enter your words: "))
for i in letters:
  print(["Yes" if (i[2]==i[3] and i[4]==i[5]) else "NO" )

letters = eval(input("Enter: "))
for i in letters:
	print(["Yes" if i[2]==i[3] and i[4]==i[5] else "No"])


l = input("Enter: ")
print("Yes" if (l[2]==l[3] and l[4]==l[5]) else "No")

l = input()
print("Yes" if (l[2]==l[3] and l[4]==l[5]) else "No")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s = list(input())
if s[2] == s[3] and s[4] == s[5]:
	print('YES')
else:
	print('NO')

s = list(input())
if s[2] == s[3] and s[4] == s[5]:
	print('Yes')
else:
	print('No')

Verdicts: Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

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

if S[2]==S[3]andS[4]==S[5]:
    print("Yes")
else:
    print("No")
    

S = input()

if S[2]==S[3] and S[4]==S[5]:
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = readline().decode().rstrip()
if S[0] == S[5] and S[1] == S[4] and S[2] == S[3]:
    print('Yes')
else:
    print('No')

import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = readline().decode().rstrip()
if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
S = input()
if S[3] == S[4] and S[4] == S[5]:
  print("Yes")
else:
  print("No")

S = input()
if S[2] == S[3] and S[4] == S[5]:
  print("Yes")
else:
  print("No")


Verdicts: Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s=input()
if s[2]==s[3] and s[4]=s[5]:
    print("Yes")
else:
    print("NO")


s=input()
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s=input()
if s[3]==s[4] and s[5]==s[6]:
  print("Yes")
else:
  print("No")

s=input()
if s[2]==s[3] and s[4]==s[5]:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
letters = input()
if letters[2] == letters[3] && letters[4] == letters[5] :
    print('Yes')

else :
    print('No')

letters = input()
if letters[2] == letters[3] and letters[4] == letters[5] :
    print('Yes')

else :
    print('No')

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
words = list(input())
if words[3] == words[4] and words[5]== words[6]:
    print("Yes")
else:
    print("No")

words = list(input())
if words[2] == words[3] and words[4]== words[5]:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
abcdef=input()
if c==d and e==f:
  print(yes)
  else:
    print(no)

S=input()
Sbara=list(S)
if Sbara[2]==Sbara[3] and Sbara[4]==Sbara[5]:
  print("yes")
else:
  print("no")

S=input()
Sbara=list(S)
if Sbara[2]==Sbara[3] and Sbara[4]==Sbara[5]:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s=input()
if s[2]==s[3]&&s[4]==s[5]:
  print("Yes")
else:
  print("No")

s=input()
if (s[2]==s[3]) and (s[4]==s[5]):
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
def coffee(string):
      if len(string) == 6:
            for i in range(0,len(string)):
                  if string[i+2] == string[i+3] and string[i+4] == string[i+5]:
                        return 'Yes'
                  else:
                        return 'No'
                    
print(coffee('iphone'))

def coffee(s):
      if len(s) == 6 and s.islower():
            for i in range(0,len(s)):
                  if s[i+2] == s[i+3] and s[i+4] == s[i+5]:
                        return 'Yes'
                  else:
                        return 'No'
      else:
            return ''

def coffee(string):
      if len(string) == 6 and string.islower():
            for i in range(0,len(string)):
                  if string[i+2] == string[i+3] and string[i+4] == string[i+5]:
                        return 'Yes'
                  else:
                        return 'No'

b=int(input())
if b>=500:
      overall=b*2
      print(overall)
elif b<=499 and b>0:
      print(b)
elif b<=0:
      print(0)

def coffee_like(s):
      for i in range(0,len(s)):
            if s[i+2] == s[i+3] and s[i+4] == s[i+5]:
                  return 'Yes'
            else:
                  return 'No'

def coffee(string):
      if len(string) == 6 and string.islower():
            for i in range(0,len(string)):
                  if string[i+2] == string[i+3] and string[i+4] == string[i+5]:
                        return 'Yes'
                  else:
                        return 'No'
      else:
            return 'False'
                    
print(coffee('COFFEE'))

def coffee(s):
      if len(s) == 6 and s.lower():
            for i in range(0,len(s)):
                  if s[i+2] == s[i+3] and s[i+4] == s[i+5]:
                        return 'Yes'
                  else:
                        return 'No'

a=int(input())
b= a // 500
bc= a % 500
abc = bc // 5
happy= b * 1000 + abc * 5
print(happy)

def coffee_like(s):
      s=list(str(s))
      for i in range(0,len(s)):
            if s[i+2] == s[i+3] and s[i+4] == s[i+5]:
                  return 'Yes'
            else:
                  return 'No'

def coffee(s):
      if len(s) == 6 and s.islower():
            for i in range(0,len(s)):
                  if s[i+2] == s[i+3] and s[i+4] == s[i+5]:
                        return 'Yes'
                  else:
                        return 'No'

s = input()
s=str(s)
b=list(s)
if b[2]==b[3] and b[4]==b[5]:
      print('Yes')
else:
      print('No')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s=input()
if(len(s)>6s=input()

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


s=input()
 
if(s[2]==s[3] and s[4]==s[5]):
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

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

if S[2:] =="ffee":
    print("Yes")
else:
    print("No")

S = input()
if len(set(list(S[2:4]))) == len(set(list(S[4:6]))) == 1:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
S = input()
if S[3] == S[4] and S[5]==S[6]:
  print("Yes")
else:
  print("No")

S = input()
if S[3] == S[2] and S[5]==S[4]:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s = list(input())
print(s)
if s[2] == s[3] && s[4] == s[5]:
  print("Yes")
else:
  print("No")

s = list(input())
if s[2] == s[3] and s[4] == s[5]:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s=list(input())
if s[2]==s[3]  and s[4]==s[5]:
    print("YES")
else:
    print("NO")

s=list(input())
if s[2]==s[3]  and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print("yes")
else:
    print("no")

a,b,c,d,e,f = list(input())
if c==d and e==f:
    print("yes")
else:
  print("no")

s = input()
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

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

if S[3] == S[4]:
  if S[5] == S[6]:
    print("Yes")
  else:
    print("No")
else:
  print("No")


S = input()

if S[2] == S[3]:
  if S[4] == S[5]:
    print("Yes")
  else:
    print("No")
else:
  print("No")


Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
S = int(input())
SS = S//500
SSS = (S%500)//5
print(1000*SS + 5*SSS)

S = int(input())

S500 = S/500

S_nokori = S%500

S5 = S_nokori/5

print(1000*S500 + 5*S5)

X = int(input())
 
ans = (X//500)*1000
ans += ((X % 500)//5) * 5
 
print(ans)

S = list(input())
 
if S[2] == S[3] and S[4] == S[5]:
  print("yes")
else:
  print("No")

S = input()

if S[2] == S[3] and S[4] == S[5]:
  print("yes")
else:
  print("No")




S = input()
SS = S/500
SSS = (S%500)/5
print(1000*SS + 5*SSS)

S = int(input())
S500 = S/500
S5 = (S%500)/5
print(1000*S500 + 5*S5)

S=input()
if (S[2]==S[3]) and (S[4]==S[5]):
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s=list(map(str,input().split()))
if s[2]==s[3] and s[4]==s[5]:
    print('Yes')
else:
    print('No')

s=list(input())
if s[2]==s[3] and s[4]==s[5]:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
S = input()
print("Yes" if S[3] == S[4] and S[5] == S[6] else "No")


S = input()
print("Yes" if S[4] == S[5] and S[6] == S[7] else "No")

S = input()
print("Yes" if S[2] == S[3] and S[4] == S[5] else "No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s_in = input()
if s_in[2]==s_in[3] and s_in[4]==s_in[5]:
    print('yes')
else:
    print('no')


s_in = input()
if s_in[2]==s_in[3] and s_in[4]==s_in[5]:
    print('yes')
else:
    print('no')


s_in = S
if s_in[2]==s_in[3] and s_in[4]==s_in[5]:
    print('yes')
else:
    print('no')

s_in = input()
if s_in[2]==s_in[3] and s_in[4]==s_in[5]:
    print('Yes')
else:
    print('No')


Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
S = input()
if S[3]==S[4] and S[5]==S[6]:
  print "Yes"
else:
  print "No"

s=input()
if s[2]==s[3] and s[4]==s[5]:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

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

if s[3]==s[4] and s[5]==s[6];
	print("sはcoffeeと似ています")
	else;
    print("sはcoffeeと似ていません")


s=input()

if (s[2]==s[3] and s[4]==s[5]):
	print("yes")
else:
    print("no")


s = input()

if((s[3]==s[4]) and (s[5]==s[6])):
  	print("yes")
else:
	print("no")


s = input()

if((s[2]==s[3]) and (s[4]==s[5])):
  	print("yes")
else:
	print("no")


s=input()

if s[3]==s[4] and s[5]==s[6]
	print("sはcoffeeと似ています")
	else
    print("sはcoffeeと似ていません")

s = input()

if((s[3]==s[4]) and (s[5]==s[6])):
  	print("Yes")
else:
	print("No")


s=input()

if (s[3]==s[4] and s[5]==s[6]):
	print("yes")
	else:
    print("no")


s=input()

if s[3]==s[4] and s[5]==s[6];
	print("sはcoffeeと似ています")
	else
    print("sはcoffeeと似ていません")


s=input()

if s[3]==s[4] and s[5]==s[6]:
	print("sはcoffeeと似ています")
	else:
    print("sはcoffeeと似ていません")


s = input()

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


Verdicts: Runtime Error

Wrong Answer

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
word = map(str, input())

if word[2]==word[3] and word[4]==word[5]:
  print('Yes')
else:
  print('No')

word = str(input())
 
if word[2]==word[3] and word[4]==word[5]:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s = input()
if(s.length() != 6):
  print("No")

if(s[2] == s[3] && s[4] == s[5]):
  print("Yes")
else:
  print("No")

s = input()
 
if(s[2] == s[3] and s[4] == s[5]):
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
def main():
    K, N = [int(_) for _ in input().split()]
    A = list(map(int, input().split()))
    mx = 0

    for i in range(N-1):
        dis = A[i+1]-A[i]
        if dis > mx:
            mx = dis
    se = A[N-1] - A[0]
    if (K-(se)) > mx:
        mx = K - se
    print(mx)
main()

def main():
    s = input()
    if s[2]==s[3] and s[4]==s[5]:
            print('Yes')
    else:
        print('No')

main()




Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s = input()
if s[2] == s[3] or s[4] == s[5]:
  print('yes')
else:
  print('no')

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

Verdicts: Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
# -*- coding: utf-8 -*-
text = list(S)
if text[2] == text[3]:
    if text[4]==text[5]:
        print('Yes')
    else:
        prinrt('No')
else:
    print('No')

# -*- coding: utf-8 -*-
text = list(input())
if text[2] == text[3]:
    if text[4]==text[5]:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
S = input()
if len(S) < 6:
    print("No")
else:
    if S[2] == S[3] and S[4] == S[5]:
        print("No")
    else:
        print("No")

S = input()
if len(S) < 6:
    print("No")
else:
    if S[2] == S[3] and S[4] == S[5]:
        print("Yes")
    else:
        print("No")

Verdicts: Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
S = input()
if S[2] == S[3] && S[4] == S[5]:
	print("Yes")
else:
	print("No")


S = input()
if (S[2] == S[3]) and (S[4] == S[5]):
	print("Yes")
else:
	print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

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

if S[3]==S[4]:
    if S[5]==S[6]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

S = input()

if S[2]==S[3]:
    if S[4]==S[5]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
n=input()
if n.islower:
	if n[2]==n[3] and n[4==n[5]:
		print("Yes")
	else:
		print("No")
else:
	print("No")

n=input()
if n.islower():
	if n[2]==n[3] and n[4]==n[5]:
		print("Yes")
	else:
		print("No")
else:
	print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

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

temp_list=list(message)


if (temp_list[2] == temp_list[3]) and (temp_list[4] == temp_list[5]):
    print("Yes")
else
    print("No")

message = input()

temp_list=list(message)


if (temp_list[2] == temp_list[3]) and (temp_list[4] == temp_list[5]):
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s = str(input("Enter a string: "))
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

s = str(input("Enter a string: "))

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


s = str(input())
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s=input()
print('Yes' if s[4]=='e' and s[5]=='e' else 'No')

s=input()
print('Yes' if s[2]=='f' and s[3]=='f' and s[4]=='e' and s[5]=='e' else 'No')

s=input()
print('Yes' if s[2]==s[3] and s[4]==s[5] else 'No')

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
S = input()
print("Yes" if S[3] == S[4] and S[5] == S[6] else "No")

S = input()
if S[3] == S[4] and S[5] == S[6]:
  print("Yes")
else:
  print("No")

S = input()
print("Yes" if S[2] == S[3] and S[4] == S[5] else "No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
if s[3] == s[4] and s[5] == s[6]:
  print('Yes')
else:
  print('No')

def func(data):
  if data[2] == data[3] and data[4] == data[5]:
    print('Yes')
  else:
    print('No')

def func(data):
  if data[2] == data[3] and data[4] == data[5]:
    print('Yes')
  else:
    print('No')
func(S)

def func(data):
  if data[2] == data[3] and data[4] == data[5]:
    print('Yes')
  else:
    print('No')

func(s)

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

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
S[] = input()
if S[2] == S[3]:
    if S[4] == S[5]:
        print(Yes)
    else:
        print(No)
else:
    print(No)

S = input()
if S[2] == S[3]:
    if S[4] == S[5]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
# -*- coding: utf-8 -*-
import collections
N,X,Y = map(int,input().split())
ToltN=N*(N-1)/2
Dist=[[0 for i in range(N)] for i in range(N)]
for i in range(N):
    for j in range(i,N):    
        MyDist=abs(i-(X-1))+abs(j-(Y-1))+1
        if MyDist<j-i:
            Dist[i][j]=MyDist
        else:
            Dist[i][j] = j-i
for j in range(N-1):
    ans=[0]
    for i in range(N):
        ans+=Dist[i]
c = collections.Counter(ans)
for i in range(N-1):
    print(c[i+1])


# -*- coding: utf-8 -*-
S= list(input())

if S[2]==S[3] and S[4]==S[5]:
    YorN="Yes"
else:
    YorN="No"
print(YorN)

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
S = input()
if S[3] == S[4] and S[5] == S[6]:
  print("Yes")
else:
  print("No")

S = str(input())
if S[3] == S[4] and S[5] == S[6]:
  print("Yes")
else:
  print("No")

s = input()
if s[2] == s[3] and s[4] == s[5]:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
S = input() 
if S[2:] == "ffee":
    answer = "Yes"

else:
    answer = "No"

print(answer)

S = input() 
if S[2] == S[3] and S[4]==S[5]:
    answer = "Yes"

else:
    answer = "No"

print(answer)

Verdicts: Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
s = input()
if s[3] == s[4] and s[5] == s[6]:
  print('Yes')
else:
  print('No')

s = input()

if s[3] == s[4] and s[5] == s[6]:
  print('Yes')
else:
  print('No')

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


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
S=input()
if S[2]==S[3] and S[4]==S[5]:
  print('yes')
else:
  print('no')

S=input()
if S[2]==S[3] and S[4]==S[5]:
  print('Yes')
else:
  print('No')

Verdicts: Wrong Answer

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
x, y, a, b, c = map(int, input().split())
arrayP = list(map(int, input().split()))
arrayQ = list(map(int, input().split()))
arrayR = list(map(int, input().split()))
arrayP.sort(reverse=True)
arrayQ.sort(reverse=True)
arrayR.sort(reverse=True)
arrayAns = []
for i in range(x):
    arrayAns.append(int(arrayP[i]))
for i in range(y):
    arrayAns.append(int(arrayQ[i]))
arrayAns.sort()
for i in range(len(arrayR)):
    if len(arrayAns) >= i
        if arrayAns[i] <= int(arrayR[i]):
           arrayAns[i] = int(arrayR[i])
        else:
            break
print(sum(arrayAns))


s = input()
if s[2] == s[3]:
    if s[4] == s[5]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.   Given a string S, determine whether it is coffee-like.

Submission attempts (in order):
import numpy as np


def solve():
    if s[2]==s[3] and s[4]==s[5]:
        print("YES")
    else:
        print("NO")
    return


s = str(input())
solve()


import numpy as np


def solve():
    if s[2]==s[3] and s[4]==s[5]:
        print("Yes")
    else:
        print("No")
    return


s = str(input())
solve()


Verdicts: Wrong Answer

Accepted