python/GESP/202306_2_2.cpp

#include <bits/stdc++.h>
using namespace std;

void solve() {
    int n;
    cin >> n;
    int sum = 0;
    int len = 0;
    int tmp;
    tmp = n;
    while (tmp) {
        tmp /= 10;
        len++;
    }

    tmp = n;
    while (tmp) {
        int x = tmp % 10;
        sum += pow(x, len);
        tmp /= 10;
    }
    if (sum == n)
        cout << "T" << endl;
    else
        cout << "F" << endl;
}
// 自幂数
int main() {
    int T;
    cin >> T;
    while (T--) solve();
    return 0;
}