Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
55516 | zhangweiran | 哥德巴赫猜想 | C++ | Accepted | 1 MS | 240 KB | 442 | 2024-11-08 07:03:47 |
#include <iostream> using namespace std; int go(int n) { int prime(int n); int b,c; for (int i=3;i<n;i++) { if (prime(i)==1) { b=i; c=n-b; if(prime(c)==1)break; } } cout<<n<<'='<<b<<'+'<<c<<endl; return 0; } int main() { int a; for (int i=6;i<=100;i+=2) go(i); return 0; } int prime(int n) { for (int i=2;i<n;i++) if (n%i==0) return 0; return 1; }