Codeforces Round #834 (Div. 3) A. Yes-Yes?

Codeforces Round #834 (Div. 3) A. Yes-Yes?

Note that it is enough to consider the string $full$=$YesYes...Yes$, where Yes is written $18$ times, since $18\cdot 3=54$, and our substring $s$ has size $|s|\le 50$.

Then we just use the built-in function find to $find$ out if our string $s$ is a substring of the string $full$.

#include<bits/stdc++.h>
using namespace std;

int main()
{
    string str;
    for(int i=0;i<50;i++)
        str+="Yes";

    int T;cin>>T;
    while(T--)
    {
        string s;cin>>s;
        if(str.find(s)!=-1) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}