Submission #904315

---

Source Code Expand

//satyaki3794
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define MOD (1000000007LL)
#define LEFT(n) (2*(n))
#define RIGHT(n) (2*(n)+1)
 
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
 
ll pwr(ll base, ll p, ll mod = MOD){
ll ans = 1;while(p){if(p&1)ans=(ans*base)%mod;base=(base*base)%mod;p/=2;}return ans;
}
 
ll gcd(ll a, ll b){
    if(b == 0)  return a;
    return gcd(b, a%b);
}




int main(){

    ios_base::sync_with_stdio(0);

    string str;
    cin>>str;

    stack<char> st;
    int n = str.length();
    for(int i=0;i<n;i++){
        st.push(str[i]);
        while(1){
            if(st.size() < 2)   break;
            char ch = st.top();
            st.pop();
            if(st.top() == 'S' && ch == 'T'){
                st.pop();
                continue;
            }
            st.push(ch);
            break;
        }
    }

    cout<<st.size();
    return 0;
}

Submission Info

Judge Result