Problem:


Score : 100 points

Problem Statement

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.

Constraints

S is a string of length 6 consisting of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

If S is coffee-like, print Yes; otherwise, print No.

Sample Input 1

sippuu

Sample Output 1

Yes

In sippuu, the 3-rd and 4-th characters are equal, and the 5-th and 6-th characters are also equal.

Sample Input 2

iphone

Sample Output 2

No

Sample Input 3

coffee

Sample Output 3

Yes



Sample input:
sippuu


Sample output:
Yes

Submission status: Runtime Error

Solution code:
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])

Submission status: Runtime Error

Solution code:
message = input()

temp_list=list(message)


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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

Solution code:
s=input()

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

Submission status: Runtime Error

Solution code:
s=input()

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

Submission status: Runtime Error

Solution code:
s=input()

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

Submission status: Runtime Error

Solution code:
s=input()

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

Submission status: Runtime Error

Solution code:
s=input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input("")
if ((S[2]) == (S[3])):
    if ((S[4]) == (S[5])):
        print ('Yes')
else:
    print("If" + S +"is coffee-like,'No'.")

Submission status: Runtime Error

Solution code:
S = input("")
if ((S[2]) == (S[3])):
    if ((S[4]) == (S[5])):
        print (f"If {S} is coffee-like,'Yes'.")
else:
    print(f"If {S} is coffee-like,'No'.")

Submission status: Runtime Error

Solution code:
S = list(str, input())

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

Submission status: Runtime Error

Solution code:
S = list(str.imput())

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

Submission status: Runtime Error

Solution code:
S = input("")
if ((S[2]) == (S[3])):
    if ((S[4]) == (S[5])):
        if S.islower():
            print (f"If {S} is coffee-like,'Yes'.")
        else:
            print (f"If {S} is coffee-like,'No'.")
else:
    print(f"If {S} is coffee-like,'No'.")

Submission status: Runtime Error

Solution code:
S = input("")
if ((S[2]) == (S[3])):
    if ((S[4]) == (S[5])):
        if S.islower():
            print (f"If {S} is coffee-like,'Yes'.")
        else:
            print (f"If {S} is coffee-like,'No'.")
else:
    print(f"If {S} is coffee-like,'No'.")

Submission status: Runtime Error

Solution code:
S = input("")
# if len(S) == 1:
#     print(f"If {S} is coffee-like,'Yes'.")
# else:
if ((S[2]) == (S[3])):
    if ((S[4]) == (S[5])):
        if S.islower():
            print (f"If {S} is coffee-like,'Yes'.")
        else:
            print (f"If {S} is coffee-like,'No'.")
else:
    print(f"If {S} is coffee-like,'No'.")

Submission status: Runtime Error

Solution code:
S = input("")
if len(S)<6:
    print(f"If {S} is coffee-like,'Yes'.")
else:
    if ((S[2]) == (S[3])):
        if ((S[4]) == (S[5])):
            if S.islower():
                print ("Yes")
            else:
                print ("No")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
S = input("")
if len(S)=='S':
    print(f"If {S} is coffee-like,'Yes'.")
else:
    if ((S[2]) == (S[3])):
        if ((S[4]) == (S[5])):
            if S.islower():
                print ("Yes")
            else:
                print ("No")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
import sys

args = sys.argv
if args[2] is args[3] and args[4] is args[5]:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
S = input("")
if len(S)= 'S':
    print("Yes")
else:
    if ((S[2]) == (S[3])):
        if ((S[4]) == (S[5])):
            if S.islower():
                print ("Yes")
            else:
                print ("No")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
S = input("")
if len(S)= 'S':
    print("Yes")
else:
    if ((S[2]) == (S[3])):
        if ((S[4]) == (S[5])):
            if S.islower():
                print ("Yes")
            else:
                print ("No")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
S = input("")
if len(S)= 'S':
    print("If S is coffee-like, print 'Yes';")
else:
    if ((S[2]) == (S[3])):
        if ((S[4]) == (S[5])):
            if S.islower():
                print ("Yes")
            else:
                print ("No")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
S = input("")
if len(S)= 'S':
    print("If S is coffee-like, print 'Yes';")
else:
    if ((S[2]) == (S[3])):
        if ((S[4]) == (S[5])):
            if S.islower():
                print ("Yes")
            else:
                print ("No")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
S = input("")
if len(S)<6:
    print("If S is coffee-like, print 'Yes'; otherwise, print 'No'.")
else:
    if ((S[2]) == (S[3])):
        if ((S[4]) == (S[5])):
            if S.islower():
                print ("Yes")
            else:
                print ("No")
    else:
        print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()

if len(s) == 6 & s[2]==s[3] & s[4]== s[5] {
    return print("Yes")
}else {
    return print("No")
}

Submission status: Runtime Error

Solution code:
X,Y,A,B,C = map(int, input().split())
p=list(map(int,input().split()))
q=list(map(int,input().split()))
r=list(map(int,input().split()))
p.sort()
p.reverse()
q.sort()
q.reverse()
r.sort()
r.reverse()
ans=0
ccounter=0
for i in range(0,X):
    ans=p[i]+ans
for i in range(0,Y):
    ans=q[i]+ans
for i in range(0,X):
    if i>=C:
      break
    if p[X-1-i]<=r[i]:
        ccounter=ccounter+1
        ans=ans-p[X-1-i]+r[i]
    else:
        break
for i in range(0,Y):
    if i+ccounter>=C:
        break
    if q[Y-1-i]<=r[i+ccounter]:
        ans=ans-q[Y-1-i]+r[i+ccounter]
        ccounter=ccounter+1
    else:
        break
print(ans)

Submission status: Runtime Error

Solution code:
import sys
S = sys.argv
if S[2]==S[3] and S[4]==S[5]:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
def merge(A,B):
    C = []
    
    while len(A)!=0 and len(B) != 0:
        if A[0]>B[0]:
            C.append(A[0])
            del A[0]
        else:
            C.append(B[0])
            del B[0]

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

    return C

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

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

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

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

Submission status: Runtime Error

Solution code:
word = input()
if word[2]==word[3] and word[4]==word[5]:
    print('Yes')
    sys.exit(0)
print('No')

Submission status: Runtime Error

Solution code:
import sys

word = sys.argv[1]
if word[2]==word[3] and word[4]==word[5]:
    print('Yes')
    sys.exit(0)
print('No')

Submission status: Runtime Error

Solution code:
N = str(input("Enter something:"))
    if N[3] == N[4] and N[5] == N[6]:
        print("yes")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
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")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <string>
#include <iostream>
using namespace std;

int main()
{
	string str;
	cin >> str;
	if (str[2] == str[3] && str[4] == str[5]) {
		cout << "Yes" << endl;
		return 0;
	}
	cout << "No" << endl;
	return 0;
}

Submission status: Runtime Error

Solution code:
a = input()

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

Submission status: Runtime Error

Solution code:
s=input()
flag=1
if list(s)[2]==list(s)[3]:
  if list(s)[4]==list(s)[5]:
    flag=0
if flag=0:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
str1 = input()


if str1[2] == str1[3] and str1[4] =  str1[5]:
  print "Yes"
else:
  print "No"

Submission status: Runtime Error

Solution code:
import sys

def solve():
    input = lambda: sys.stdin.readline().rstrip()
    sys.setrecursionlimit(10 ** 7)
    mod = 10 ** 9 + 7
    
    def comb(n, r):
        if r > n: return 0
        return fac[n] * inv[r] * inv[n - r] % mod

    def dfs(v, Pa=-1):
        for u in to[v]:
            if u == Pa: continue
            dfs(u, v)
            size[v] += size[u]
            dp[v] *= dp[u] % mod
            dp[v] *= comb(size[v], size[u]) % mod
        size[v] += 1

    def bfs(v, Pa=-1, P_val=1, P_sz=0):
        ans[v] = P_val * dp[v] * comb(n - 1, P_sz) % mod
        for u in to[v]:
            if u == Pa: continue
            val = ans[v] * INV(dp[u] * comb(n - 1, size[u])) % mod
            bfs(u, v, val, n - size[u])

    n = int(input())
    to = [[] for _ in range(n)]
    for _ in range(n - 1):
        a, b = map(lambda x: int(x) - 1, input().split())
        to[a].append(b)
        to[b].append(a)

    fac = [1] * (n + 2)
    inv = [1] * (n + 2)

    for i in range(2, n + 1):
        fac[i] = fac[i - 1] * i % mod
    INV = lambda x: pow(x, mod - 2, mod)
    inv[n] = INV(fac[n])
    for i in range(n - 1, 1, -1):
        inv[i] = inv[i + 1] * (i + 1) % mod

    dp = [1] * n
    size = [0] * n
    ans = [0] * n

    dfs(0)
    bfs(0)
    print(*ans, sep='\n')

if __name__ == '__main__':
    solve()

Submission status: Runtime Error

Solution code:
X,Y,A,B,C = map(int, input().split(" "))
p = sorted([int(x) for x in input().split(" ")])
q = sorted([int(x) for x in input().split(" ")])
r = sorted([int(x) for x in input().split(" ")])

s = 0
# gen c
for a in range(C+1):
  for b in range(C+1):
    if a + b > C:
      break
    t = sum(p[A-X+a:A]) + sum(q[B-Y+b:B]) + sum(r[C-a-b:C])
    s = max([s, t])

print(s)

Submission status: Runtime Error

Solution code:
[a,b,c,d,e,f] = import()

if c = d and e = f:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
[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))

Submission status: Runtime Error

Solution code:
s=int(input())

n=list(s)

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

Submission status: Runtime Error

Solution code:
import re

text = input()
if text[2] == text[3] && text[4] == text[5]:
  return "Yes"
else:
  return "No"

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()

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

Submission status: Runtime Error

Solution code:
n,a,b = map(int,input().split())
count_list = [0]*n

cnt = 0
for i in range(1,n):
  for k in range(i+1,n+1):
    a0 = k-i
    a1 = abs(a-i)+ abs(b-k) + 1
    count_list[cnt] = min(a0,a1)
    #print(i,"@",k,"@",a0,"@",a1,"@",count_list,cnt)
    cnt += 1
    
    

for result in range(1,n+1):
  print(count_list.count(result))

Submission status: Runtime Error

Solution code:
str = input().lower()
char_list = list(str[:5])
if char_list[2] == char_list[3]:
    if char_list[4] == char_list[5]:
        print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
m = n%500
print(int((n - m)*1000/ 500 + m*5//5))

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

Solution code:
str = input()

str_list = list(str)

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

Submission status: Runtime Error

Solution code:
str = input()

str_list = list(str)

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

Submission status: Runtime Error

Solution code:
j = input()
if((j[3] == j[4]) && (j[5] == j[6]):
   print("Yes")
else:
   print("No")

Submission status: Runtime Error

Solution code:
S = input()
if len(S) < 5:
  return False
else:
  if s[2] == s[3] and s[4] == s[5]:
    return True
  
return False

Submission status: Runtime Error

Solution code:
"""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")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
word=list(input())
print(list)
if list[2]=list[3] and list[4]andlist[5]:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;
int main(){
	string s;
	cin>>s;
	if(s[2]==s[3]&&s[4]==s[5]) printf("Yes");
	else printf("No");
	return 0;
}

Submission status: Runtime Error

Solution code:
string = list(input());
if (string[2] == string[3] && string[4] == string[5]):
	print("Yes");
else:
    print("No");

Submission status: Runtime Error

Solution code:
string = list(input());
if (string[2] == string[3] and string[4] == string[5]):
	print("Yes");
  else:
    print("No");

Submission status: Runtime Error

Solution code:
string = list(input());
if (string[2] == string[3] && string[4] == string[5]):
	print("Yes");
  else:
    print("No");

Submission status: Runtime Error

Solution code:
string = list(input("");
if (string[2] == string[3]):
  if (string[4] == string[5]):
    print("Yes");
  else:
    print("No");
else:
  print("No");

Submission status: Runtime Error

Solution code:
s = str(input())

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

Submission status: Runtime Error

Solution code:
string = input().split();
if (string[2] == string[3]):
  if (string[4] == string[5]):
    print("Yes");
  else:
    print("No");
else:
  print("No");

Submission status: Runtime Error

Solution code:
K, N = map(int, input().split())
 
A_list = list(map(int, input().split()))

distance = []
diff = 0

for i in range(0, N):
    
    if i == N-1:
        diff = K + A_list[0] - A_list[i]
        distance.append(diff)
        
    else:
        diff = A_list[i+1] - A_list[i]
        distance.append(diff)
        

print(sum(distance) - max(distance))

Submission status: Runtime Error

Solution code:
import requests
import math
import random

def quick_sort(arr):
    left = []
    right = []
    if len(arr) <= 1:
        return arr

    # データの状態に左右されないためにrandom.choice()を用いることもある。
    # ref = random.choice(arr)
    ref = arr[0]
    ref_count = 0

    for ele in arr:
        if ele < ref:
            left.append(ele)
        elif ele > ref:
            right.append(ele)
        else:
            ref_count += 1
    left = quick_sort(left)
    right = quick_sort(right)
    return left + [ref] * ref_count + right


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



      
# for i in range(10):
#     print(i)
#     if i%5==4:
#         break

Submission status: Runtime Error

Solution code:
a

Submission status: Runtime Error

Solution code:
s = input()
if(s[1:2]==s[2:3] and s[3:4]==s[4:5]){print("Yes")}
else{print("No")}

Submission status: Runtime Error

Solution code:
s = input()
if(s[2:3]==s[3:4] and s[4:5]==s[5:6]){print("Yes")}
else{print("No")}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
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")

Submission status: Runtime Error

Solution code:
a = input()
for z in a:
  if a[3]==a[4] & a[5]==a[6] :
    print("Yes")
  else :
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
if __name__=='__main__':
    S = input()
    if S[2]==S[3] and S[4]==S[5]:\
      print(Yes)
    else:
      print(No)

Submission status: Runtime Error

Solution code:
X = int(input())

print(X // 500 * 1000 + X % 500 // 5 * 5)

Submission status: Runtime Error

Solution code:
s=input()
list=[a,b,c,d,e,f]
if list[c]==list[d] or list[e]==list[f]:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
ch=input()
if ch[2]==ch[3] and ch[4]==ch[5]:
  print(True)
print(False)

print(sippuu)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input()
f==-1
if s[2]==s[3]:
    if s[4]==s[5]:
        f==1
if f==1:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
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)

Submission status: Runtime Error

Solution code:
n, x, y = map(int, input().split())
X = min(x,y)
Y = max(x,y)
x =X
y = Y
sum = x +y +1
dist = x+1
for i in range(2,dist):
	sum += dist//i
dist = n+1-y
for j in range(2,dist):
	sum += dist//j
dist = y+1-x
sum+= dist
for k in range(2,dist):
  sum += dist//k
sum+= y-n+2

Submission status: Runtime Error

Solution code:
def main():
  S = input()
  if ((S[2] == S[3]) & (S[4] == S[5])):
    print("Yes")
  else:
    print("No")
  
in __name__ == "__main__":
  main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, X, Y= map(int, input().split())
K = [0]*(N-1)
for i in range(1,N):
    for j in range(i+1, N+1):
        idx = min([j-i, abs(X-i)+ abs(j-Y)+1, abs(Y-i) + 1 + abs(X-j)])-1
        K[idx] +=1
for value in K:
    print(value)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S=str(input())
if S[3]　== S[2]:
  if S[4]==S[6]:
    return str(Yes)

Submission status: Runtime Error

Solution code:
S = input()

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

Submission status: Runtime Error

Solution code:

S = input()

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

Submission status: Runtime Error

Solution code:
input_line= input()

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

Submission status: Runtime Error

Solution code:
val = input()
if val[2] == val[3] && val[4] == val[5]:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
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)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()
if len(S) != 6:
    print('No')
    return

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

Submission status: Runtime Error

Solution code:
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]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x = int(input())

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

print(500yen + 5yen)

Submission status: Runtime Error

Solution code:
x = int(input())

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

print(500yen + 5yen)

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

Solution code:
s = input()
if(s.length() != 6):
  print("No")

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from sys import stdin
from collections import deque


class BreadthFirstSearch:
    def __init__(self, num_nodes):
        self.n = num_nodes
        self.graph = [[] for _ in range(self.n)]

    # Edge数分回すことを想定
    def add_edge(self, start, end, undirected=True):
        self.graph[start].append(end)
        if undirected:
            self.graph[end].append(start)

    # depth = distance
    def search(self, start_node):
        order = [-1] * self.n # a bfs ordering of each vertex
        parent = [-1] * self.n # parent of each vertex in the bfs search tree
        depth = [-1] * self.n # the depth of each vertex
        q = deque([(start_node, -1, 0)]) # (vertex, parent, depth)
        num = 0 # current ordering
        while len(q) > 0:
            v, p, d = q.popleft()
            if order[v] < 0: # visited v for the first time
                order[v] = num; parent[v] = p; depth[v] = d
                num += 1
                for u in self.graph[v]:
                    if order[u] >= 0: continue
                    q.append((u, v, d+1))
        return order, parent, depth





# BFS pypyでAC
def get_result(data):
    N, X, Y = data
    _data = [[i, i+1] for i in range(1, N)]
    _data += [[X, Y]]
    bfs = BreadthFirstSearch(N)
    for val in _data:
        bfs.add_edge(val[0]-1, val[1]-1)
    dist_cnt = [0 for i in range(N)]
    for i in range(N):
        _, _, depth = bfs.search(i)
        for j in range(i, N):
            dist_cnt[depth[j]] += 1
    for i in range(1, N):
        print(dist_cnt[i])


if __name__ == '__main__':
    data = list(map(int, stdin.readline().rstrip('\n').split(' ')))
    get_result(data)

Submission status: Runtime Error

Solution code:
s=input(str("enter a string"))
if s[2]==s[3] and s[4]==s[5]
 print(yes)
else
 print(no)

Submission status: Runtime Error

Solution code:
def similar(S):
  if S(3) == S(4) and S(5) == S(6)
  	print('Yes)
  else print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

func(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def dijkstra(s,n,w,cost):
    #始点sから各頂点への最短距離
    #n:頂点数,　w:辺の数, cost[u][v] : 辺uvのコスト(存在しないときはinf)
    d = [float("inf")] * n
    used = [False] * n
    d[s] = 0

    while True:
        v = -1
        #まだ使われてない頂点の中から最小の距離のものを探す
        for i in range(n):
            if (not used[i]) and (v == -1):
                v = i
            elif (not used[i]) and d[i] < d[v]:
                v = i
        if v == -1:
            break
        used[v] = True

        for j in range(n):
            d[j] = min(d[j],d[v]+cost[v][j])
    return tuple(d)

n,x,y = map(int,input().split())

#cost[u][v] : 辺uvのコスト(存在しないときはinf この場合は10**10)
cost = [[float("inf") for i in range(n)] for i in range(n)]

for i in range(n-1):
    cost[i][i+1] = 1
    cost[i+1][i] = 1
cost[x-1][y-1] = 1
cost[y-1][x-1] = 1

ans = [0 for _ in range(n)]
for i in range(n):
    #nは頂点数、wは辺の数
    res = dijkstra(i,n,n,cost)
    for j in range(i+1,n):
        ans[res[j]] += 1

for i in range(1,n):
    print(ans[i])

Submission status: Runtime Error

Solution code:
from functools import reduce
p = 1000000007  #ここを変える
ccache = []
inv_ccache = []
N = 1000000
def powmod(a, n):
    global p
    res = 1
    tmp=a
    while n>0:
        if n & 1 == 1:
            res = (res * tmp) % p
        n=n//2
        tmp = tmp * tmp % p
    return res
def invmod(n):
    return powmod(n, p - 2)
def cmod(n, r):
    global p
    global ccache
    global inv_ccache
    global N
    if len(ccache) == 0:
      ccache.append(1)
      inv_ccache.append(1)
      for i in range(N):
        ccache.append(ccache[i]*(i+1)%p)
        inv_ccache.append(1)
      inv_ccache[N]=invmod(ccache[N])
      for i in range(N-1):
        inv_ccache[N-1-i]=inv_ccache[N-i]*(N-i)%p
    if r > n or r < 0:
        return 0
    if r > n // 2:
        return cmod(n, n - r)
    return ccache[n]*inv_ccache[r]%p*inv_ccache[n-r]%p
 
n = int(input())
adj_of = [[] for _ in range(n)]
for _ in range(n - 1):
    a, b = map(int, input().split())
    adj_of[a - 1].append(b - 1)
    adj_of[b - 1].append(a - 1)
stack = [(0, -1)] # root, excludee
course = []
while len(stack) > 0:
    popped = stack.pop()
    course.append(popped)
    for adj in adj_of[popped[0]]:
        if adj != popped[1]:
            stack.append((adj, popped[0]))
sizes = [{} for _ in range(n)] #size, pattern_num
pattern_nums = [{} for _ in range(n)]
for step in reversed(course):
    size = 1
    pattern_num = 1
    for adj in adj_of[step[0]]:
        if adj != step[1]:
            size += sizes[adj][step[0]]
            pattern_num *= pattern_nums[adj][step[0]] * cmod(size - 1, sizes[adj][step[0]]) % p
            pattern_num %= p
    sizes[step[0]][step[1]] = size
    pattern_nums[step[0]][step[1]] = pattern_num
 
#print(course)
#print(sizes)
#print(pattern_nums)
 
ans = [None] * n
for step in course:
    if step[0] == 0:
        ans[0] = pattern_nums[0][-1]
        continue
    #ans[step[0]] = pattern_nums[step[0]][step[1]] * pattern_nums[step[1]][step[0]]\
    #             * cmod(sizes[step[0]][step[1]] + sizes[step[1]][step[0]], sizes[step[0]][step[1]]) % p
    pattern_nums_step1_step0 = ans[step[1]] * invmod(cmod(n - 1, sizes[step[0]][step[1]]) % p * pattern_nums[step[0]][step[1]]) % p
    ans[step[0]] = pattern_nums[step[0]][step[1]] * pattern_nums_step1_step0 % p\
                 * cmod(n - 1, sizes[step[0]][step[1]] - 1) % p
 
for a in ans:
    print(a)

Submission status: Runtime Error

Solution code:
data = input()

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