黄金城防御系统：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"; } else { cout << "Trap"; } return 0; } ``` ######[AI问答 | 227点数解答 | 2026-04-25 20:01:49]