Educational Codeforces Round 123 (Rated for Div. 2) 1644B. Anti-Fibonacci Permutation Solution

 

Problem Link : https://codeforces.com/contest/1644/problem/A

Solve in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include<bits/stdc++.h>

using namespace std;

int main()

{

    ios::sync_with_stdio(false);

    cin.tie(0);

    int t;

    cin>>t;

    while(t--)

    {

        string s;

        cin>>s;

       if (s.find('R')<s.find('r'))

            cout<<"No"<<endl;

        else if (s.find('G')<s.find('g'))

            cout<<"No"<<endl;

        else if (s.find('B')<s.find('b'))

            cout<<"No"<<endl;

        else

            cout<<"Yes"<<endl;

    }

}