Submission #1077003

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a); i<(b); i++)
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define sort(v,n) sort(v,v+n);
#define vsort(v) sort(v.begin(),v.end());
#define ll long long
#define pb(a) push_back(a)
#define fi first
#define se second
#define inf 999999999
using namespace std;
typedef pair<int,int> p;
typedef pair<ll,ll> lp;
bool is_uruu(int y) {
        return y % 4 == 0 && (y % 100 != 0 || y % 400 == 0);
}
const ll MOD=1e9+7;
//---------------------------------------------------------------------------//

int main(){
        string s;
        cin>>s;
        if(s.length()<=200) {
                int i=0;
                while(1) {
                        if(s.substr(i,2)=="ST" && s.length()>2) {
                                s=s.substr(0,i)+s.substr(i+2,s.length()-i-2);
                                i=0;
                        }else if(s.substr(0,2)=="ST" && s.length()==2) {
                                cout<<0<<endl;
                                return 0;
                        }
                        if(i==s.length()-1) {
                                break;
                        }
                        i++;
                }
                cout<<s.length()<<endl;
        }
}

Submission Info

Judge Result