Codeforces Round #784 (Div. 4) 1669D - Colorful Stamp Solution




Problem  link:  https://codeforces.com/contest/1669/problem/D

Solution in C++: 

 ///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int  n,b,r,ans,i,j,t;
    cin>>t;
    while(t--)
    {
        string s;
        ans=b=r=0;
        cin>>n>>s;
        for(i=0; i<n; i++)
        {
            if(s[i]!='W')
            {
                b=r=0;
                while((n>i)&&(s[i]!='W'))
                {
                    if(s[i]=='B')
                        b++;
                    else
                        r++;
                    i++;
                }
                if(b==0||r==0)
                {
                    ans=1;
                    break;
                }
            }
        }
        if(ans==1)
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
}




No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.