Codeforces 1469A. Regular Bracket Sequence Solution

   ///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()

    {

        int t,l;

        cin>>t;

        while(t--)

        {

            string s;

            cin>>s;

            l=s.size();

            if((l%2==1)||(s[0]==')')||(s[l-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.