因数之和奇偶性判断：C++区间陷阱检测算法

```cpp #include <iostream> #include <cmath> using namespace std; int factorSum(int x) { int sum = 0; for (int i = 1; i <= sqrt(x); i++) { if (x % i == 0) { sum += i; int pair = x / i; if (pair != i) { sum += pair; } } } return sum; } int main() { int m, n; cin >> m >> n; bool allEven = true; for (int i = m; i <= n; i++) { int sum = factorSum(i); if (sum % 2 != 0) { allEven = false; break; } } if (allEven) { cout << "Safe" << endl; } else { cout << "Trap" << endl; } return 0; } ``` ######[AI问答 | 224点数解答 | 2026-06-20 20:14:38]