Codeforces Round #583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) 1214C - Bad Sequence Solution




 Problem Link :  https://codeforces.com/problemset/problem/1214/C

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()
{
    long long n,i,c=0;
    cin>>n;
    string s;
    cin>>s;
    for(i=0; i<s.size(); i++)
    {
        if(s[i]=='(')
            c++;
        else
        {
            c--;
            if(c==-2)
                break;
        }

    }
    if(c==0)
        cout<<"Yes"<<endl;
    else
    cout<<"No"<<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.