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):
S = input()


judge = (S[2] == S[3] and S[4] == S[5])

print(judge)

S = input()


judge = (S[2] == S[3] and S[4] == S[5])

if judge:
	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: 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):
K, N = map(int, input().split())
A = list(map(int, input().split()))

for i in range(0, N): 
        for j in range(i + 1, N): 
            if A[i] + A[j] == K: 
                if A[i] > A[j]:
                    print(A[i] - A[j])
                else:
                    print(A[j] - A[i])

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()S = input()

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

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

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):
if s[2] == s[3] and s[4] == s[5]:
    print('Yes')


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 = coffee
if S is coffee-like
    return("Yes")
    else
    print("No")
  
  


def get_count(text):
    if text[2] == text[3] and text[4] == text[5]:
        return 'Yes'
    else:
        return 'No'
 
 
if __name__ == '__main__':
    string = input().strip()
 
    result = get_count(string)
    print(result)

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):
K,N=map(int,input().split())
A=list(map(int,input().split()))
List=[]
for i in range(N):
  b=abs(A[i]-A[i-1])
  List.append(b)
SL=sorted(List)
print(K-SL[-1])

K,N=map(int,input().split())
A=list(map(int,input().split()))
d=0
for i in range(N-1):
  b=A[i+1]-A[i]
  if A[i+1]-A[0] >= K/2:
    d=d+A[i]-A[0]+K-A[i+1]
print(d)
  

K,N=map(int,input().split())
A=list(map(int,input().split()))
d=0
for i in range(N-1):
  b=A[i+1]-A[i]
  if d == 0 and A[i+1]-A[0] >= K/2:
    d=d+A[i]-A[0]+K-A[i+1]
if d == 0:
  d=d+A[N-1]
print(d)

X,Y,A,B,C=map(int,input().split())
p=sorted(list(map(int,input().split())))
q=sorted(list(map(int,input().split())))
r=sorted(list(map(int,input().split())))
for i in range(min(X,Y)):
  if p[A-X+i] > q[B-Y+i]:
    if r[-1] >= q[B-Y+i]:
      del q[B-Y+i]
      q.insert(B-Y+i,r[-1])
      del r[-1]
      r.insert(0,0)
      if r[-1] > p[A-X+i]:
        del p[A-X+i]
        p.insert(A-X+i,r[-1])
        del r[-1]
        r.insert(0,0)
  else:
    if r[-1] > p[A-X+i]:
      del p[A-X+i]
      p.insert(A-X+i,r[-1])
      del r[-1]
      r.insert(0,0)
      if r[-1] > q[B-Y+i]:
        del q[B-Y+i]
        q.insert(B-Y+i,r[-1])
        del r[-1]
        r.insert(0,0)
if X>Y:
  for j in range(X-Y):
    if p[A-X+Y+j] < r[-1]:
      del p[A-X+Y+j]
      p.insert(A-X+Y+j,r[-1])
      del r[-1]
      r.insert(0,0)
if X<Y:
  for j in range(Y-X):
    if q[B-Y+X+j] < r[-1]:
      del q[B-Y+X+j]
      q.insert(B-Y+X+j,r[-1])
      del r[-1]
      r.insert(0,0)
P=sorted(p)
Q=sorted(q)
sc=0
for k in range(X):
  sc+=P[A-X+k]
for l in range(Y):
  sc+=Q[B-Y+l]
print(sc)


K,N=map(int,input().split())
A=list(map(int,input().split()))
d=0
for i in range(N-1):
  if d == 0 and A[i+1]-A[0] >= K/2:
    d=d+A[i]-A[0]+K-A[i+1]
if d == 0:
  d=d+A[N-1]-A[N-2]
print(d)

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

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):
p=S
if p[3]==p[4] and p[5]=p[6]:
  print('Yes')
else:
  print('No')
  

s='S'
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

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[3]=s[4] and s[5]=s[6]:
 print("Yes")
else if:
 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[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[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

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[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("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):
list=input().rstrip
if list[2]==list[3] and list[4]==list[5]:
	print("Yes")
else:
	print("No")
 

list=input().rstrip()
if list[2]==list[3] and list[4]==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):
[N, X, Y] = input().split()
N = int(N)
X = int(X)
Y = int(Y)
dist_list = []

for i in range(N):
    for j in range(i+1, N):
        a = j - i
        b = abs(i+1 - X) + abs(j+1 -Y) + 1
        if a > b:
            dist_list.append(b)
        else:
            dist_list.append(a)

for k in range(N-1):
    print(dist_list.count(k+1))



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):
K, N = input().split()
i, lists = 0, []
while i < N:
    lists.append(eval(input()))
    i += 1
if 0 in lists:
   lists.remove(0) 
print(max(lists) - min(lists))

string = input("").lower()
print("Yes" if string[3] == string[4] and string[5] == string[6] else "No")

string = input("").lower()
print("Yes" if (string[2] == string[3]) and (string[4] == string[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 = list(input())
if S[3] == S[4] and S[3] == S[4]:
    print('Yes')
else:
    print('No')

S = list(input())
if S[3] == S[4] 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

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: 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
# Your code here!
s = input()
print(s[2]==s[3] and s[4]==s[5])


# coding: utf-8
# Your code here!
s = input()
ret = 'No'
if s[2]==s[3] and s[4]==s[5]:
    ret = 'Yes'
print(ret)


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):
n=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] = S[3] and S[4] = S[5]):
  print("Yes")
else:
  print("No")

a = input()

if (a[2] = a[3] and a[4] = a[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()
 
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()
for i in range(0,6):
  if(s[3]==s[4] and s[4]==s[5]):
    print("Yes")
    break
  else:
    print ("No")
    break


s=input()
for i in range(0,6):
  if(s[3]==s[4] and s[4]==s[5]):
    print("yes")
    break
  else:
    print ("no")
    break

s=input()
for i in range(0,6):
  if(s[2]==s[3] and s[4]==s[5]):
    print("Yes")
    break
  else:
    print ("No")
    break


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):
# -*- coding: utf-8 -*-
S= input()
S_list = list(S)
print(S_list)
if S_list[2] == S_list[3]:
    if S_list[4] == S_list[5]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

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

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

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

Verdicts: Wrong Answer

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[-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()
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[2]==[3] and s[4]==[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):
word = input()
print("yes" if(word[2] == word[3] and word[4] == word[5]) else "No")

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




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




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

Verdicts: Wrong Answer

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):
cf =list(input())

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

cf =list(input())

if cf[2]==cf[3] and cf[4]==cf[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()
S= list(S)
if S[2]==S[3] and S[4]==S[5]:
  print('yes')
else: 
  print('no')

S = input()
S= list(S)
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()
for i in range(0, len(S)):
    if ((S[2]==S[3])&(S[4]==S[5])):
        print("yes")
        break
    else:
        print("No")
        break

S = input()
for i in range(0, len(S)):
    if ((S[2]==S[3])&(S[4]==S[5])):
        print("Yes")
        break
    else:
        print("No")
        break

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):
https://atcoder.jp/contests/abc160/tasks/abc160_a

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]==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()
check = S[2] == S[4] and S[3] == S[5]

print("Yes" if check else "No")

S = int(input())

check = S[2] == S[3] and S[4] == S[5]

print("Yes" if check else "No")

S = int(input())

check = S[2] == S[4] and S[3] == S[5]

print("Yes" if check else "No")

S = input()

check = S[2] == S[3] and S[4] == S[5]

print("Yes" if check else "No")

Verdicts: 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):
if s[2] == s[3] & s[4] == s[5]:
  print('Yes')
else:
  print('No')

s = input()

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

x = input()
 
happyPoints = 0
 
y = x - (x % 500)
 
if x % 500 !== x:
  happyPoints += (x/500)*1000
  	if y % 5 !== y:
      z = y - (y % 5)
      happyPoints += y
elif x % 5 !== x:
  w = x - (x % 5)
  happyPoints += w
 
  print(happyPoints)


x = input()
 
happyPoints = 0
 
y = x - (x % 500)
 
if x % 500 !== x:
  happyPoints += (x/500)*1000
  	if y % 5 !== y:
      z = y - (y % 5)
      happyPoints += y
elif x % 5 !== x:
  w = x - (x % 5)
  happyPoints += w
 
  print(happyPoints)


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] 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()
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, x, y = map(int, input().split())
li = [0] * (n-1)
for i in range(1, n+1):
  for j in range(i+1, n+1):
    num = min(j-i, abs(x-i)+abs(y-j)+1)
    li[num-1] += 1
for i in range(n-1):
  print(li[i])

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
print("Yes" if s[2]==s[3] and s[4]==s[5] else "No")

s = input()
print("Yes" if s[2]==s[3] and s[4]==s[5] else "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();
ans =0
for n in set(i for i in s[2::]):
  if s.count(n)==2:
    ans+=1
print('Yes' if ans>1 else 'No'

s=input()[2::];print('Yes' if len(set(s[:2]))==1 and len(set(s[2:]))==1 else '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[3]==s[4] and s[5] == s[6]:
  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):
N = str(input("Enter something:"))
    if N[3] == N[4] and N[5] == N[6]:
        print("yes")
    else:
        print("No")

print yes or no"""
N = str(input("Enter something:"))
for str in N:
    if N[3] == N[4] and N[5] == N[6]:
        print("yes")
    else:
        print("No")

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

"""print yes or no"""
N = str(input("Enter something:"))
for str in N:
    if N[3] == N[4] and N[5] == N[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] and S[4] = S[5]:
  print(Yes)
else if:
  print(No)


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)


S=int(input())
a=S//500
b=S%500
c=b//5
print(a*1000+c*5)


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


a,b=divmod(int(input()),500)
print(a*1000+(b//5)*5)


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

Runtime Error

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):
s=int(input())

n=list(s)

if n[2]==n[3] and n[4]==n[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):
if txt[2] == txt[3] and txt[4] == txt[5]:
    print('Yes')
else :
    print('No')


txt = input()

if txt[2] == txt[3] and txt[4] == txt[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):
k,n=map(int,input().split())
houses=list(map(int,input().split()))
houses.sort()
maxx=-float('INF')
for i in range(n-1):
    if houses[i+1]-houses[i]>maxx:
        maxx=houses[i+1]-houses[i]

maxx=max([maxx,k-(houses[-1]-houses[0])])
print(maxx)


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 = 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: 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):
inp = input()
print('Yes' if inp[3] == inp[4] and inp[5] == inp[6] else 'No')

inp = input()
print('Yes' if inp == 'coffee' else 'No')

k, n = map(int, input().split())
home_positions = list(map(int, input().split()))


def max_distance_homes(homes):
    max_distance = 0
    for i in range(len(homes) - 1):
        distance = homes[i + 1] - homes[i]
        if max_distance < distance:
            max_distance = distance
    distance = k + homes[0] - homes[-1]
    if max_distance < distance:
        max_distance = distance
    return max_distance


print(k - max_distance_homes(home_positions))

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

Verdicts: Runtime Error

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):
user_input = input()
coffee = "coffee"
is_same = [2,3,4,5]
is_sim = True

for i in is_same:
    if not (user_input[i] == coffee[i]):
        is_sim = False

if is_sim:
    print("Yes")
else:
    print("No")

usr = input()
arr = [2,4]
bol = True

for i in arr:
    if not (usr[i] == usr[i+1]):
        bol = False

if bol:
    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):
K, N = map(int,input().split())
A = list(map(int, input().split()))
List = []

for i in range(1, N):
  List.append(A[i] - A[i-1])
  
d = K - A[-1] + A[0]
List.append(d)
List.sort()
print(sum(List[:-1]))
  

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=int(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):
a,b,c,d,e,f = input()
if (c==d) and (e==f) : print("Yes")
else print("No")

n = input()
print (list (n))

cin >>> a,b,c,d,e,f;
if c=d and e=f : cout <<< "Yes"
else : cout <<< "No"

a,b,c,d,e,f = input()
if (c==d) and (e==f) : print("Yes")
else : print("No")

Verdicts: Runtime Error

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):
k,n = map(int,input().split())
pos = list(map(int,input().split()))





subtract = []
for i in range(n-1):
    subtract.append(pos[i+1]-pos[i])

(posの終点～posの始点)
subtract.append(k-pos[n-1]+pos[0])


idx = subtract.index(max(subtract))

if idx == 0:
    rsl = k-pos[idx-1]+pos[0]
else:
    rsl = pos[n-1]-pos[0]

print(rsl)

str = input()

if str[2] == str[3] and str[4] == str[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):
money = int(input())
 
happy = 0
 
happy += int((money / 500) * 1000)
 
money -= (money / 500) * 500
 
happy += int((money / 5) * 5)
 
print(happy)

string = input()
if string[2] == string[3] and string[4] == string[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[2] == s[3] and s[4] = s[5]:
    print("Yes")
else:
    print("No")


s = str(input())
print("Yes") if s[2] == s[3] and s[4] == s[5] 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=[x for x in input()]
if(x[3]==x[4] and x[5]==x[6]):
    print('Yes')
else:
    print('No')

x=input()
if(x[2]==x[3] and x[4]==x[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()
if a[0]==a[1] and 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: 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):
str = input()

str_list = list(str)

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



str = input()

str_list = list(str)

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



str = input()
 
if str[2] == str[3] and str[4] == str[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]==[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):
S = list(input())

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




S= list(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):
X = int(input())

num1000 = X // 500
r500 = X % 500
num5 = r500 // 5

print(num1000 * 1000 + num5 * 5)


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):
import sys
from io import StringIO
import unittest

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

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = 
        output = """Yes"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """iphone"""
        output = """No"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """coffee"""
        output = """Yes"""
        self.assertIO(input, output)

if __name__ == "__main__":
    unittest.main()

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

import sys
from io import StringIO
import unittest

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

if __name__ == "__main__":
    resolve()

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] and s[5]==[6]):
  print("Yes")
else:
  print("No")

n=list(input())
if n[2]==n[3] and n[4]==n[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):
#!/usr/bin/env python3

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

if '__name__' == '__main__':
    main()


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):
from collections import defaultdict
N,X,Y = map(int,input().split())

k = defaultdict(lambda: 0)

for i in range(N-1):
    for j in range(i+1,N):
        dist = min( j-i , abs(X-1-i)+1+abs(Y-1-j) , abs(Y-1-i)+1+abs(X-1-j) )
        k[dist] += 1

for i in range(1,N+1):
    print(k[i])


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

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):
coffee = str(input())
iff3 = coffee[3]
iff4 = coffee[4]
iff5 = coffee[5]
iff6 = coffee[6]
if iff3 == iff4 :
    if iff5 == iff6 :
        print("Yes")
    if iff5 != iff6 :
        print("No")
if iff3 != iff4:
    print("No")

a = input()
iff3 = a[2]
iff4 = a[3]
iff5 = a[4]
iff6 = a[5]
if iff3 == iff4 :
    if iff5 == iff6 :
        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 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):
X=int(input())
print(X//500*1000+X%500//5*5)

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

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):
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')

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):
string = input()

if string[2] == string[3] and string[4] == string[5]:
  print 'Yes'
else:
  print 'No'

string = input()

if string[2] == string[3] and string[4] == string[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[4] == S[5] and S[2] == S[3]:
    print("Yes")
else:
    print("No")
print(S)


S = list(input())
if S[4] == S[5] and S[2] == S[3]:
    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=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: 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):
k,n=map(int,input().split())
arr=list(map(int,input().split()))

for i in range(n-1):
	arr.append(arr[i]+k)

min_=99999999999

for i in range(n):
	if arr[i+n-1]-arr[i]<min_:
		min_=arr[i+n-1]-arr[i]


print(min_)

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):
cof = input()
if cof[2] == cof[3] & cof[4] == cof[5]:
  print("Yes")
else:
  print("No")

cof = input()
if cof[2] == cof[3] and cof[4] == cof[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 = f"@{input()}"
print(s[3] == s[4] and s[5] == s[6])

s = f"@{input()}"
print((s[3] == s[4] and s[5] == s[6]) and "Yes" or "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 = int(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] == S[3] and S[4] == S[5]:
  print("Yes")
else:
  print("No"

X = int(input())
if n==17:
  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")
    exit()

print("No")

S = input()

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

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 [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