Codeforces Beta Round #26 (Codeforces format) 26B - Regular Bracket Sequence Solution



 

Problem Link :  https://codeforces.com/problemset/problem/26/

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  l,c=0,ans=0,i;
  string s;
  cin>>s;
  l=s.size();
  for(i=0;i<l;i++)
  {
      if(s[i]=='(')
        c++;
      else if(c!=0)
      {
          c--;
          ans++;
      }
  }
  cout<<ans*2<<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.