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: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

s = input().split()[0]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    S=ST()
    if(S[2]==S[3] and S[4]==S[5]):
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# ANSHUL GAUTAM
# IIIT-D

from math import *
from copy import *
from string import *				# alpha = ascii_lowercase
from random import *				# l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from bisect import *				# bisect_left(arr,x,start,end)  => start and end parameters are temporary
from sys import stdin				# bisect_left return leftmost position where x should be inserted to keep sorted
from sys import maxsize
from operator import *				# d = sorted(d.items(), key=itemgetter(1))
from itertools import *
from collections import Counter		# d = dict(Counter(l))
from collections import defaultdict # d = defaultdict(list)

'''

'''

def solve(l):
	n = len(l)


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
S = input()
if S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

Solution code:
def get_ints():
    return map(int, input().split())

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(S: str):
    print(YES if S[2] == S[3] and S[4] == S[5] else NO)


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8

S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : list(map(int, stdin.readline().split()))
sys.setrecursionlimit(10 ** 7)

def main():
    s = ns()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
A = input()

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

Submission status: Accepted

Solution code:
from sys import stdin
from sys import setrecursionlimit
from collections import Counter, deque, defaultdict
setrecursionlimit(1000000)

# INF = float('inf')
INF = int(1e10)

def input():
    return stdin.readline()[:-1]

def main():
    from builtins import int, map
    S = input()
    if S[2] == S[3] and S[4] == S[5]:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

Solution code:
S=input()
print(['No','Yes'][S[2]==S[3] and S[4]==S[5]])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys


S=input()

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

Submission status: Accepted

Solution code:
S=input()
print("YNeos"[not(S[2]==S[3]and S[4]==S[5])::2])

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]

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

Submission status: Accepted

Solution code:
#template
def inputlist(): return [int(j) for j in input().split()]
from collections import Counter
#template
#issueから始める
S = input()
if S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# import sys
# input = sys.stdin.readline
s = input()
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353


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

Submission status: Accepted

Solution code:

# じょえチャンネルおもしろいよ～～～
# https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

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

#Solve
if __name__ == "__main__":
    solve()

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

Submission status: Runtime Error

Solution code:
cof = input()
if cof[2] == cof[3] & cof[4] == cof[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:
#ABC160A
s = input()
print("Yes" if s[3]==s[4] and s[5]==s[6] else "No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input().split()
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 = int(input())

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

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

Submission status: Runtime Error

Solution code:
S = int(input())

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

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

Submission status: Runtime Error

Solution code:
s=list(map(str,input().split()))
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
import math
inp = lambda : stdin.readline().strip()

t = int(inp())
for _ in range(t):
    s = inp()
    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:
n=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=list[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:
S = input()

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

Submission status: Runtime Error

Solution code:
l=list(map(str.input.split()))
if l[2]==l[3]andl[4]==l[5]:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
N, X, Y = map(int, input().split())
ans = [0]*N

for i in range(1,N+1):
  for j in range(i+1,N+1):
    d = min(j-i,abs(i-X)+abs(j-Y)+1)
    #print(i,j,d)
    ans[d]+=1

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

Submission status: Runtime Error

Solution code:
S = input()
a = S[2]
b = S[3]
c = S[5]
d = S[6]
if a == b and c == d:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
S = input()
a = S[2]
b = S[3]
c = S[5]
d = S[6]
if a==b and c==d:
print("Yes")
else:
print("No")

Submission status: Runtime Error

Solution code:
#C - Traveling Salesman around Lake WA(ヒント)
K,N = map(int,input().split())
A = list(map(int, input().split()))

A[N+1:] = [A[0] + K]#Aを二回繰り返して円を表現

distance_list = []
for i in range(N):
    distance = abs(A[i] - A[i+1])
    distance_list.append(distance)
distance_list.remove(max(distance_list))
print(sum(distance_list))

Submission status: Runtime Error

Solution code:
#pragma GCC optimize(2)

#include "bits/stdc++.h"

using namespace std;

//#define _DEBUG
#define all(a) begin(a), end(a)
#define MOD 1000000007
#define PII pair<int, int>
#define complete_unique(a) a.erase(unique(begin(a), end(a)), end(a))
#define mst(x, a) memset(x, a, sizeof(x))
typedef vector<int> VI;
typedef long long ll;

ll quick_pow(ll a, ll b) {
    long long res = 1;
    while (b) {
        if (b & 1)
            res = a * res;
        a = a * a;
        b >>= 1;
    }
    return res;
}

ll gcd(ll a, ll b) {
    a = abs(a), b = abs(b);
    while (b != 0) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a * b / gcd(a, b);
}

bool is_prime(int n) {
    if (n == 0) return false;
    if (n == 1) return false;
    if (n == 2) return true;
    if (n % 2 == 0) return false;
    int j = sqrt(n);
    for (int i = 2; i <= j; ++i) {
        if (n % i == 0) return false;
    }
    return true;
}

ll reverse_num(ll n) {
    ll x = 0, t = n;
    while (t != 0) {
        x = x * 10 + t % 10;
        t /= 10;
    }
    return x;
}

void solve() {
    string s;
    cin >> s;
    if (s[2] == s[3] && s[4] == s[5]) {
        cout << "Yes";
    } else {
        cout << "No";
    }
}

int main() {
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif
    // 加速输入和输出
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Submission status: Runtime Error

Solution code:
s=int(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())
i=0
u=0
while 500<=x:
    x-=500
    i+=1
while x>=5:
    x-=5
    u+=1
print(1000*i+5*u)

Submission status: Runtime Error

Solution code:
X = int(input())

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

print(num1000 * 1000 + num5 * 5)

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

Solution code:
#include<iostream>
using namespace std;
int main()
{
    // 文字列の入力
    string s;
    cin >> s;
  	if(s[2]==s[3] && s[4]==s[5])
      cout << "Yes" << endl;
    else
      cout << "No" << endl; 
    return 0;
}

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

Submission status: Runtime Error

Solution code:
s = input()
ans = "No"

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

Submission status: Runtime Error

Solution code:
s = input()
ans = No

if s[2]==s[3]&&s[4]==s[5]:
  ans = Yes
  
print(ans)

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:
k,n=map(int,input().split())
a=list(map(int,input().split()))
ans=0
for x in range(n-1):
  b=a[x+1]-a[x]
  ans=max(ans,b)
  
c=k-a[n-1]+a[0]

print(k-max(ans,c))

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=input()
for i in range(6):
  if N[i]==N[i+1]:
    print("Yes")
    exit()
  else:
    print("No")

Submission status: Runtime Error

Solution code:
a = int(input())
a -= a%5
print(2*a - a%500)

Submission status: Runtime Error

Solution code:
K,N=map(int,input().split())
A = list(map(int, input().split()))
han=0
for a in range(len(A)):
    if abs(A[a]-A[a-1])>K/2:
        han=abs(A[a]+K-A[a-1])

    elif abs(A[a]-A[a-1])>han:
        han=abs(A[a]-A[a-1])
print(K-han)

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

Submission status: Runtime Error

Solution code:
n,x,y = map(int,input().split())
cnt_l = [0]*n
from collections import deque
# 幅優先探索
def bfs(start):
    queue = deque()
    queue.append(start)
    step_counts = [-1]*(n+1)
    step_counts[start] = 0
    while(queue):
        i = queue.popleft()
        cnt = step_counts[i]
        # 隣のグラフを取得
        if(i==x):
            nex_l = (i-1,y,i+1)
        elif(i==y):
            nex_l = (i-1,x,i+1)
        else:
            nex_l = (i-1,i+1)
 
        cnt += 1
        for j in nex_l:
            # 端より先だと止める
            if(j < 1 or n < j):
                continue
            # 訪問済みだと止める
            if(step_counts[j]!=-1):
                continue
            queue.append(j)
            step_counts[j] = cnt
            cnt_l[cnt] += 1
            
for i in range(1,n+1):
    bfs(i)

for i in range(1,n):
    # (a,b),(b,a)のペアがあるため//2
    print(cnt_l[i]//2)

Submission status: Runtime Error

Solution code:
n,x,y = map(int,input().split())
cnt_l = [0]*n
from collections import deque
# 幅優先探索
def bfs(start):
    queue = deque()
    queue.append(start)
    step_counts = [-1]*(n+1)
    step_counts[start] = 0
    while(queue):
        i = queue.popleft()
        cnt = step_counts[i]
        # 隣のグラフを取得
        if(i==x):
            nex_l = (i-1,y,i+1)
        elif(i==y):
            nex_l = (i-1,x,i+1)
        else:
            nex_l = (i-1,i+1)
 
        cnt += 1
        for j in nex_l:
            # 端より先だと止める
            if(j < 1 or n < j):
                continue
            # 訪問済みだと止める
            if(step_counts[j]!=-1):
                continue
            queue.append(j)
            step_counts[j] = cnt
            cnt_l[cnt] += 1
            
for i in range(1,n+1):
    bfs(i)
 
for i in range(1,n):
    # (a,b),(b,a)のペアがあるため//2
    print(cnt_l[i]//2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
// template version 1.12
using namespace std;
#include <iostream>
#include <bits/stdc++.h>

// varibable settings
#define infile "../test/sample-1.in"
#define int long long //{{{
const int INF=1e18;
const int MOD=1e9+7; //}}}

// define basic macro {{{
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)((b)-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define each(i,a) for (auto&& i : a)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x)-A.begin())
#define posu(A, x) (upper_bound(all(A),x)-A.begin())
template<class T> inline void chmax(T &a, const T &b) { if((a) < (b)) (a) = (b); }
template<class T> inline void chmin(T &a, const T &b) { if((a) > (b)) (a) = (b); }

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;

template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast;

#if defined(PCM) || defined(LOCAL)
  #include "lib/dump.hpp"
#else
  #define dump(...) 42
  #define dump_1d(...) 42
  #define dump_2d(...) 42
#endif
//}}}

// 隣接リストで使う辺を表す型
struct Edge {
  int to, cost;  // 辺の接続先頂点, 辺の重み
  Edge(int to, int cost) : to(to), cost(cost) {}  // コンストラクタ
};

typedef vector<vector<Edge> > AdjList;  // 隣接リストの型
AdjList graph;  // グラフの辺を格納した構造体
                // graph[v][i]は頂点vから出るi番目の辺Edge

vector<int> dist; // 最短距離

int solve(){
  //int n,m,p;cin>>n>>m>>p;
  string s,ans;
  ans="No";
  cin>>s;
  if(s[2]==s[3]&&s[4]==s[5])ans="Yes";
  
  cout << ans << endl;
  return 0;
}

signed main() { //{{{
#ifdef INPUT_FROM_FILE
  std::ifstream in(infile);
  std::cin.rdbuf(in.rdbuf());
#endif
  solve();
  return 0;
} //}}}

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=list.input()

if a[2]==a[3] and a[4]==a[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:
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")

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:
import sys
input = sys.stdin.readline

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

Submission status: Runtime Error

Solution code:
S = (input().split())

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

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

a = x//500

b = (x%500)//5

A = a*1000
B = b*5
print(A+B)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# A - Coffee
S = int(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.index(2)==S.index(3) and S.index(4)==S.index(5):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from math import floor
from decimal import Decimal

S = int(input())

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

Submission status: Runtime Error

Solution code:
K,N=map(int,input().split())
Alist=list(map(int,input().split()))
kyori=[]
ans=0
for i in range(N-1):
    kyori.append(Alist[i+1]-Alist[i])
kyori.append(K-Alist[N-1]+Alist[0])
kyori.remove(max(kyori))
for i in range(len(kyori)):
    ans+=kyori[i]
print(ans)

Submission status: Runtime Error

Solution code:
K,N=map(int,input().split())
Alist=list(map(int,input().split()))
kyori=[]
ans=0
for i in range(N-1):
    kyori.append(Alist[i+1]-Alist[i])
kyori.append(Alist[N-1]-Alist[0])
kyori.remove(max(kyori))
for i in range(len(kyori)):
    ans+=kyori[i]
print(ans)

Submission status: Runtime Error

Solution code:
k, n = map(int, input().split())
a = list(map(int, input().split()))
dmax = k - (a[n - 1] - a[0])
for i in range(n - 1):
    if (a[i + 1] - a[i]) > dmax:
        dmax = a[i + 1] - a[i]
print(k - dmax)

Submission status: Runtime Error

Solution code:
x = int(input())
h = 0
fh = x // 500
h += fh * 1000
r = x % 500
f = r // 5
h += f * 5
print(h)

Submission status: Runtime Error

Solution code:
k, n = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
b = []
c = abs(k+a[0]-a[n-1])
for i in range(1, n):
  b.append(abs(a[i] - a[i-1]))
  b.sort()
  p = b[-1]

if p > c:
  print(k - p)
else:
  print(k - c)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x = int(input())
print(x//500*500*2+x%500//5*5)

Submission status: Runtime Error

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