↓下面是程序↓
#include<bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n];
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
for (long long i = 0; i < n; i++) {
long long num = a[i];
vector<int> digits;
while (num > 0) {
digits.push_back(num % 10);
num /= 10;
}
reverse(digits.begin(), digits.end());
for (size_t j = 1; j < digits.size(); j += 2) {
digits[j] *= 7;
while (digits[j] > 9) {
int sum = 0;
while (digits[j] > 0) {
sum += digits[j] % 10;
digits[j] /= 10;
}
digits[j] = sum;
}
}
long long sum = accumulate(digits.begin(), digits.end(), 0);
if (sum % 8 == 0) {
cout << 'T' << endl;
} else {
cout << 'F' << endl;
}
}
return 0;
}
莫名其妙WA了一个,求调!