H. 我爱XTU
思路: 如果存在i,j,有i>j且sumix-sumjx=sumit-sumjt能够得到sumix-sumit=sumjx-sumjt,说明只要存在一对i,j使得sumix-sumit=sumjx-sumjt那么X与T的数量是相等的,那么同理还要保证sumit-sumiu=sumjt-sumju,所以我们只需要存储一个pair<sumix-sumit,sumit-sumiu>,如果前面存在跟他相同的pair那么这就是满足题意的i,j,同时要注意初始化pair<0,0>
// Problem: H. 我爱XTU
// Contest: Codeforces - 2023 Xiangtan Unversity Freshman Conteset
// URL: https://codeforces.com/gym/104303/problem/H
// Memory Limit: 256 MB
// Time Limit: 1000 ms
#include<iostream>
#include<cstring>
#include<string>
#include<sstream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<vector>
#include<set>
#include<unordered_map>
#include<ctime>
#include<cstdlib>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> PII;
typedef pair<int,pair<int,int> > PIII;
const double eps=1e-7;
const int N=5e5+7 ,M=5e5+7, INF=0x3f3f3f3f,mod=1e9+7;
const long long int llINF=0x3f3f3f3f3f3f3f3f;
inline ll read() {ll x=0,f=1;char c=getchar();while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') {x=(ll)x*10+c-'0';c=getchar();} return x*f;}
inline void write(ll x) {if(x < 0) {putchar('-'); x = -x;}if(x >= 10) write(x / 10);putchar(x % 10 + '0');}
inline void write(ll x,char ch) {write(x);putchar(ch);}
void stin() {freopen("in_put.txt","r",stdin);freopen("my_out_put.txt","w",stdout);}
bool cmp0(int a,int b) {return a>b;}
template<typename T> T gcd(T a,T b) {return b==0?a:gcd(b,a%b);}
template<typename T> T lcm(T a,T b) {return a*b/gcd(a,b);}
void hack() {printf("\n----------------------------------\n");}
int T,hackT;
int n,m,k;
char str[N];
int res[10000][3];
void solve() {
scanf("%s",str+1);
n=strlen(str+1);
int ans=0;
memset(res,0,sizeof res);
map<int,map<int,int> > st;
st[0][0]++;
for(int i=1;i<=n;i++) {
res[i][0]=res[i-1][0];
res[i][1]=res[i-1][1];
res[i][2]=res[i-1][2];
if(str[i]=='X') res[i][0]++;
else if(str[i]=='T') res[i][1]++;
else res[i][2]++;
ans+=st[res[i][0]-res[i][1]][res[i][1]-res[i][2]]++;
}
printf("%d\n",ans);
}
int main() {
// init();
// stin();
scanf("%d",&T);
// T=1;
while(T--) hackT++,solve();
return 0;
}