| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 80368 | sh25_wangtaojie | 合数求和 | C++ | Accepted | 0 MS | 240 KB | 374 | 2026-01-04 15:14:30 |
#include <iostream> using namespace std; bool isComposite(int num) { for (int i = 2; i * i <= num; ++i) { if (num % i == 0) return true; } return false; } int main() { int N; cin >> N; int sum = 0; for (int i = 4; i <= N; ++i) { if (isComposite(i)) sum += i; } cout << sum << endl; return 0; }