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


coffee = input()
print("Yes") if coffee[3] == coffee[4] else print("No")

print("Yes") if list(input().split())[3-1] == list(input().split())[4-1] else print("No")

coffee = input()
print("Yes") if coffee[2] == coffee[3] and coffee[4] == coffee[5] 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):
n = list(input())
if (n[2]==n[3])and(n[4]==n[5]):
    print("YES")
else:
    print("NO")
    


n = list(input())
if (n[5]):
    if (n[2]==n[3])and(n[4]==n[5]):
        print("YES")
    else:
        print("NO")
       
    

n = list(input())
if (n[5]):
    if (n[2]==n[3])and(n[4]==n[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):
if S[2]==S[3] and S[4]==S[5]:
  return "Yes"

return "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()

condition = s[2]==s[3] and s[3]==s[4]

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

s = input()
 
condition = s[2]==s[3] and s[4]==s[5]
 
if condition:
  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 len(s) < 6:
  print('No')
elif s[-1] == [-2] and s[-3] == s[-4]:
  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 = int(input())
a = int(x/500)
b = x - 500*a
c = int(b/5)

print(1000*a + 5*c)



x = list(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):
s = input()
if len(s) == 6 and s[2] == s[3] and s[4] == s[5]:
    print('Yse')
else:
    print('No')

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

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



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




S1=list(S)
print(S1)
if S1[2]==S1[3] and S1[4]==S1[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):
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] && 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 len(s) != 6:
    print("NO")
else:
    a = [0]*26
    flag = True
    if s[2] != s[3]:
        flag = False
    if s[4] != s[5]:
        flag = False
    if s[3] == s[4]:
        flag = False
    if s[0] == s[1] or s[0] == s[2]:
        flag = False
    if s[0] == s[4] or s[1] == s[2]:
        flag = False
    if s[1] == s[4]:
        flag = False
    if flag:
        print("YES")
    else:
        print("NO")



s = input()
if len(s) != 6:
    print("NO")
else:
    a = [0]*26
    flag = True
    if s[2] != s[3]:
        flag = False
    if s[4] != s[5]:
        flag = False
    if flag:
        print("YES")
    else:
        print("NO")

s = input()

flag = True
if s[2] != s[3]:
    flag = False
if s[4] != s[5]:
    flag = False
if flag:
    print("YES")
else:
    print("NO")

s = input()
flag = True
if len(s) != 6:
    flag = False

for i in s:
    if ord(i) < 97 or ord(i) > 122:
        flag = False
if len(s) == 6:
    if s[2] != s[3]:
        flag = False
    if s[4] != s[5]:
        flag = False
if flag:
    print("YES")
else:
    print("NO")

s = input()
flag = True
if len(s) != 6:
    flag = False

for i in s:
    if ord(i) < 97 or ord(i) > 122:
        flag = False
if len(s) == 6:
    if s[2] != s[3]:
        flag = False
    if s[4] != s[5]:
        flag = False
if flag:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

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

a = input()
if (a[3] == a[4]) and (a[5] == a[6]):
    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

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[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 =input()
if (n[2] == n[3] and n[4] == n[5]):
    print("YES")
else:
    print("NO")

n =list(input())
if (n[2] == n[3] and n[4] == n[5]):
    print("YES")
else:
    print("NO")

n =input()
if ((n[2] == n[3]) and (n[4] == n[5])):
    print("YES")
else:
    print("NO")

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

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

n, x, y = map(int, input().split())
x -= 1
y -= 1
INF = 10010101010101
ans = [0]*n
def put(v, d):
    if dist[v] != INF:
        return
    dist[v] = d
    q.put(v)
for sv in range(n):
    q = queue.Queue()
    dist = [INF for _ in range(n)]
    put(sv, 0)
    while not q.empty():
        v = q.get()
        d = dist[v]
        if v-1 >= 0:
            put(v-1, d+1)
        if v+1 < n:
            put(v+1, d+1)
        if v == x:
            put(y, d+1)
        if v == y:
            put(x, d+1)
    for i in range(n):
        ans[dist[i]] += 1
for i in range(n):
    ans[i] = int(ans[i] / 2)

print(*ans[1:], sep='\n')

s = list(input())
ans = True
if not s[2] == s[3]:
    ans = False
if not s[4] == s[5]:
    ans = False
if ans:
    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 solve():
	s = input()
   	if s[2] == s[3] and s[4] == s[5]:
		print("Yes")
    else:
		print("No")
          
if __name__ == "__main__":
	solve()

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

  return

if __name__ == "__main__":
  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):
K, N = map(int,input().split())
A = list(map(int, input().split()))
a = A[0]
sub = []
for _ in range(N):
    p = A.pop()
    sub.append(K-p)
    K = p
sub[0] += a
sub.remove(max(sub))
print(sum(sub))

K, N = map(int,input().split())
A = list(map(int, input().split()))
sub = [A[0]+K-A[N-1]]
for _ in range(N-1):
    p = A.pop()
    sub.append(K-p)
    K = p
sub.remove(max(sub))
print(sum(sub))

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

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 = str(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):
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 = 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')

x=int(input())
happiness = 0
if x>=500:
    ans = divmod(x,500)
    happiness += 1000*ans[0]
    x = ans[1]

if x>=5:
    ans =divmod(x,5)
    happiness += 5*ans[0]

print(happiness)

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

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):
a, b, c, d, e, f = 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: 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 __name__ == "__main__":
    S = input()
    print((S[2] == S[3]) & (S[4] == S[5]))

if __name__ == "__main__":
    S = input()
    if ((S[2] == S[3]) & (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] == 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: 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):
#500-1000, 5-5

x = int(input())
fiveHundred = x//500
x -= fiveHundred*500
fives = x//5
print(fiveHundred*1000+fives*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):
n, x, y = map(int, input().split())

klist = [0]*(n)
for i in range(1, n):
  for j in range(i+1, n+1):
    k = min(j-i, abs(j-y)+1+abs(x-i))
    klist[k] += 1

for _ in range(1, n):
  print(klist[_])

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=list(map(str,input().split()))
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().split()
if c==d and e==f:
  print("Yes")
else:
  print("No")

a,b,c,d,e,f=input()
if c==d and e==f:
  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):
#!/usr/bin/env python3
import collections
import itertools as it
import math
import numpy as np

#  = input()
#  = int(input())
#  = map(int, input().split())
#  = list(map(int, input().split()))

#
# c = collections.Counter()


s = input()

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

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):
def coffee(n, ar):
    status = []
    if ar[3] == ar[4] and ar[5] == ar[6]:
      return 'Yes'
    else:
      return 'No'

if __name__ == '__main__':

    n = int(input())

    ar = list(map(str, input().rstrip().split()))

    result = coffee(n, ar)
    print(result)

def coffee(ar):
    
    if ar[3] == ar[4] and ar[5] == ar[6]:
      return 'Yes'
    else:
      return 'No'

if __name__ == '__main__':

    ar = str(input().split())

    result = coffee(ar)
    print(result)

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

def coffee(word):
    ar = [char for char in word] 
    if (ar[2] == ar[3]) and (ar[4] == ar[5]):
      return 'Yes'
    else:
      return 'No'

if __name__ == '__main__':

    ar = str(input())

    result = coffee(ar)
    print(result)

Verdicts: 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 = str(input())
if s[3]==s[4]  and s[5]==s[6]:
  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):
S=input()

ans="No"

if(S[2]==S[3]):
  if(S[4]==S[5]):
    ans="yes"

print(ans)
  

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

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

S = S.split()
if (S[2]=="f")&(S[3]=="f"):
  if (S[4]=="e")&(S[5]=="e"):
    return Yes
  else: return No
else: return No

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


S = input()
#S = S.split()
if ((S[2]==S[3])&(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()
print("Yes" if 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

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

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

a = input()
if a[2]==a[3] and a[4]==a[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):
test = input()
for test in 6
 print(test)

test = input()
if test[2] == test[3]:
  if test[4] == test[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 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')

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]:
  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 -*-
X = int(input())

num_500 = int(X / 500)
num_5 = int((X - (num_500*500)) / 5)

print((num_500*1000) + (num_5)*5)

# -*- coding: utf-8 -*-
X, Y, A, B, C = map(int, input().split())
red_oishisa = list(map(int, input().split()))
green_oishisa = list(map(int, input().split()))
no_oishisa = list(map(int, input().split()))

red_oishisa = list(sorted(red_oishisa))[::-1]
green_oishisa = list(sorted(green_oishisa))[::-1]
no_oishisa = list(sorted(no_oishisa))[::-1]

oishisa_s = []

i=1
j=1
k=1
while(True):
    if len(oishisa_s) == X+Y:
        break
    
    hikaku_dict = dict()
    if i <= X:
        hikaku_dict['red'] = red_oishisa[i-1]
    if j <= Y:
        hikaku_dict['green'] = green_oishisa[j-1]
    if k <= C:
        hikaku_dict['no'] = no_oishisa[k-1]
    
    max_key, max_value = max(hikaku_dict.items(), key=lambda x:x[1])
    oishisa_s.append(max_value)
    if max_key == 'red':
        i += 1
    elif max_key == 'green':
        j += 1
    elif max_key == 'no':
        k += 1

print(sum(oishisa_s))

# -*- coding: utf-8 -*-
string = input()

if string[2] == string[3] and string[4] == string[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):
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(min(len(arrayR), len(arrayAns))):
    if arrayAns[i] <= int(arrayR[i]):
        arrayAns[i] = int(arrayR[i])
    else:
        break
print(sum(arrayAns))

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 arrayAns[i] <= int(arrayR[i]):
        arrayAns[i] = int(arrayR[i])
    else:
        break
print(sum(arrayAns))

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] == a[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()
t = 'coffee'
if s[2] == t[2] and s[3] == t[3] and s[4] == t[4] and s[5] == t[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)

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

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: 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: 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 = eval(input())
print((user_input // 500) * 1000 + ((user_input % 500) // 5) * 5)

def Coffee(usr):
    if usr[-1] == usr[-2] and usr[-3] == usr[-4]:
        return 'Yes'
    else:
        return 'No'

usr = str(input("Enter: "))
if usr[-1] == usr[-2] and usr[-3] == usr[-4]:
	print('Yes')
else:
	print('No')

def Coffee(usr):
    if usr[-1] == usr[-2] and usr[-3] == usr[-4]:
        return 'Yes'
    else:
        return 'No'

usr = eval(input())
if usr[-1] == usr[-2] and usr[-3] == usr[-4]:
    print('Yes')
else:
    print('No')

usr = str(input("Enter: "))
if  usr[-3] == usr[-4] and usr[-1] == usr[-2]:
	print('Yes')
else:
	print('No')

usr = str(input("Enter: "))
if usr[-1] == usr[-2] and usr[-3] == usr[-4]:
	print('Yes')
else:
	print('No')

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

Verdicts: 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):
X,Y,A,B,C= map(int, input().split())
R = list(map(int, input().split()))
G = list(map(int, input().split()))
N = list(map(int, input().split()))

R.sort(reverse=True)
G.sort(reverse=True)
N.sort(reverse=True)

R2 = R[:X]
G2 = G[:Y]

W = sorted(R2 + G2 + N, reverse=True)

print(sum(W[0:X+Y]))

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

flag = False

if str[2] == str[3] and str[4] == str[5]:
  flag = True
  
print(flag)

str = input()
 
flag = False
 
if str[2] == str[3] and str[4] == str[5]:
  flag = True
  
if flag:
  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("Enter 6 letters: ")
if S[2]==S[3] and S[4]==S[5] :
    print("Yes")
elif len(S)<=5:
    print("No")
else:
    print("No")

S=input("Enter 6 letters: ")
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):
from sys import exit, stdin
S = stdin.readline().rstrip()
if S[3] == S[4] and S[5] == S[6]:
  print('Yes')
else:
  print('No')


from sys import exit, stdin
S = stdin.readline().rstrip().split()
if S[3] == S[4] and S[5] == S[6]:
  print('Yes')
else:
  print('No')

from sys import exit, stdin
S = stdin.readline().rstrip()
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):
S = input("enter string ")
if S is S.lower():
    if len(S) == 6:
        if S[2] == S[3]:
            if S[4] == S[5]:
                print("Yes")
            else:    
                print("No")
        else:
            print("No")

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

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

S = input("enter string ")
S.lower()
if len(S) == 6:
    if S[2] == S[3]:
        if S[4] == S[5]:
            print("Yes")
        else:    
            print("No")
    else:
        print("No")

S = input("enter string ").lower()

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

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


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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

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

s = input()

if s[3] == s[4]:
	if 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):

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

a,b,c,d,e,f = input()
if c == d and e == f:
  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):
# -*- coding: utf-8 -*-

str = input()
strlist = list(str)
print(strlist)

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


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

str = input()
strlist = list(str)

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

a = input()
b = []
for z in a:
  b.apppend(z)
if b[2]==b[3]:
  if b[4]==b[5]:
    print("Yes")
  else:
    print("No")
else:
  print("No")
  

a = input()
b = []
for z in a:
  b.append(z)
if b[2]==b[3]:
  if b[4]==b[5]:
    print("Yes")
  else:
    print("No")
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('Enter something: ')
if S[2] == S[3] and S[4] == s[5]:
    print('Yes')
else:
    print('No')

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

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

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


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


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

num_500 = x / 500

amari = x - num_500

num_5 = int(amari / 5)

print(1000 * num_500 + 5 * num_5)

N = input()
if(N[2] == N[3] and N[4] == N[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(

a,b,c,d,e,f=input()
if c==d and e==f:
  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 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):
x = int(input())

500yen = x//500*1000
5yen = (x - x//500)//5*5

print(500yen + 5yen)


s = input()

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

x = int(input())

500yen = x//500*1000
5yen = x%500//5*5

print(500yen + 5yen)


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):
total, N = map(int, input().split())
nums = list(map(int, input().split()))
if N == 1:
    print(0)
else:
    ans = total - (total - nums[-1] + nums[0])
    prev = nums[0]
    for num in nums[1:]:
        ans = min(total-(num - prev), ans)
        prev = num
    print(ans)


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


s = input()

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

Wrong Answer

Accepted