1759A - Yes-Yes - CodeForces Solution

#include<bits/stdc++.h>
using namespace std ;
#define  ll long long
#define ld long double
#define  LM10 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ld long double
/*
bool f = false;
int cnt = 0  ;
int partition (int arr[] , int l , int h)
{
    int p = arr[l] ;
    int i= l ;
    int j=h ;
    while(i<j)
    {
        do {
            {
                i++ ;
            }
        }while (arr[i]<=p) ;
        do {

                j-- ;

        }while(arr[j]>p) ;
        if(i<j)
        {
            swap(arr[i],arr[j]) ;
            f=true ;

        }
    }
    if (f)
        cnt++ ;
    swap(arr[l],arr[j]) ;
    return j ;
}
void quicksort (int arr[], int left , int right)
{

    if (left<right)
    {
        int piv = partition(arr , left ,right) ;
        quicksort(arr,left,piv) ;
        quicksort(arr,piv+1,right) ;
    }

}
*/


/*
int n , m , cnt  = 0  ;
ll s = 0 ,sum = 0 ;
void solve() {
    cin>>n>>m ;
    ll bytesComp [10004]={};
while(n--)
{
    int a , b ;
    cin>>a>>b ;
    s+=a;
    bytesComp[cnt] = a-b ;
    cnt++ ;
}
bool f = false ;
    sort(bytesComp , bytesComp+cnt) ;
    for (int i = 0; i < cnt; ++i) {
        cout<<bytesComp[i]<<' ';
    }
    cout<<"\n" ;

    for (int i = 0; i < cnt; ++i) {
        sum+= bytesComp[i] ;
        if (sum==s-m){
            cout<<i ;
            f=true ;
            break;
        }
    }
    if (f==false)
         cout<<-1 ;

}
*/
int main(void)
{
LM10
int  tt ;
cin>>tt ;
while(tt--)
{
    string s ;
    cin>>s ;
    string t="YesYesYesYesYesYesYesYesYesYesYesYesYesYesYesYesYesYes" ;
    if (t.find(s)!=t.npos)
        cout<<"YES\n" ;
    else
        cout<<"NO\n" ;
}

}