黄金城防御系统陷阱判断：C++ 计算数字因数和输出结果

```cpp #include <iostream> using namespace std; // 计算一个数的因数之和 int sumOfFactors(int num) { int sum = 0; for (int i = 1; i <= num; i++) { if (num % i == 0) { sum += i; } } return sum; } int main() { int m, n; cin >> m >> n; bool allEven = true; for (int i = m; i <= n; i++) { if (sumOfFactors(i) % 2 != 0) { allEven = false; break; } } if (allEven) { cout << "Safe" << endl; } else { cout << "Trap" << endl; } return 0; } ``` ######[AI问答 | 234点数解答 | 2026-06-20 20:21:52]