黄金城防御系统问题：C++ 快速分析数字因数和判断陷阱情况

```cpp #include <iostream> using namespace std; // 计算一个数的因数之和 int factorSum(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; for (int i = m; i <= n; i++) { if (factorSum(i) % 2 != 0) { cout << "Trap" << endl; return 0; } } cout << "Safe" << endl; return 0; } ``` ######[AI问答 | 204点数解答 | 2026-06-20 20:16:27]