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

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main(void){
  int N,X,Y;
  scanf("%d %d %d",&N,&X,&Y);
  if((N>=3 && N<=2000) && ((X>=1 && X<=N) &&(Y>=1 && Y<=N)))
  {
    if(X+1<Y)
    {
      int A[N][N];
      int i,j;
      int *R=(int *)malloc(sizeof(int)*(N-1));
        for(i=0;i<N;i++)
        A[i][i]=0;
      for(i=0;i<=N-1;i++)
      {
        for(j=i+1;j<=N-1;j++)
        {
          int c;
          if(((j>X && j<Y) && (i>X && i<Y))||(j<=X && i<=X)||(j>=Y && i>=Y))
            c=j-i;
          else
          {
            c=j-i;
            int d=abs(j-Y)+abs(i-X)+1;
            if(d<c)
              c=d;
          }
          A[i][j]=c;
        }
      }
      for(i=0;i<N;i++)
      {
        for(j=i+1;j<N;j++)
        {
          for(int k=1;k<=N-1;k++)
          {
            if(A[i][j]==k)
            {
              R[k-1]++;
            }
          }
        }
      }
      for(i=0;i<N-2;i++)
        printf("%d ",R[i]);
    }
  }
  return 0;
}