Submission #2227420

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)

using namespace std;
typedef long long int lli;

int main(){
	string X;
  	cin>>X;
  	int l=(int)X.length();
  
//末尾のSの個数をカウント
  	int num=0;
  	rep(i,l){
    	if(X[l-1-i]=='S'){
        	num+=1;
        }
      	else break;
    }
	cout<<2*num;
}

Submission Info

Judge Result