GESP二级真题 C++ 编程题 - 自幂数判断 (2023年6月)

#include #include using namespace std;

bool isArmstrong(int num) { int sum = 0; int temp = num; int n = to_string(num).length(); while (temp > 0) { int digit = temp % 10; sum += pow(digit, n); temp /= 10; } return sum == num; }

int main() { int M; cin >> M; for (int i = 0; i < M; i++) { int num; cin >> num; if (isArmstrong(num)) { cout << 'T' << endl; } else { cout << 'F' << endl; } } return 0; }