Codeforces Round #769 (Div. 2) 1632A - ABC Solution




 Solution 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,n,i,l;
    cin>>t;
    while(t--)
    {
        cin>>l;
        string s;
        cin>>s;
        if(l==1)
            cout<<"YES"<<endl;
        else if((s=="00")||(s=="11"))
            cout<<"NO"<<endl;
        else if(l>=3)
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
    return 0;
}


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.