| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 76654 | sh25_shenpy | 哥德巴赫猜想 | C++ | Accepted | 0 MS | 172 KB | 387 | 2025-12-19 15:42:18 |
#include <cstdio> bool is_prime(int x) { if(x <= 1) return false; for(int i = 2; i * i <= x; i++) { if(x % i == 0) return false; } return true; } int main() { for(int i = 6; i <= 100; i += 2) { for(int j = 1; j <= i / 2; j++) { if(is_prime(j) && is_prime(i - j)) { printf("%d=%d+%d\n", i, j, i - j); break; } } } return 0; }