Educational Codeforces Round 125 (Rated for Div. 2) 1657C - Bracket Sequence Deletion Solution



 Problem Link :  https://codeforces.com/contest/1657/problem/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 t,n,i,j,ans,c;
    cin>>t;
    while(t--)
    {
        cin>>n;
        string s;
        ans=c=0;
        cin>>s;
        for(i=1;i<n;i++)
        {
            if((s[c]=='('&&s[i]==')')||(s[c]==s[i]))
                c=++i,ans++;
        }
         cout<<ans<<" "<<n-c<<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.