POJ - 2262 - Goldbach's Conjecture = 水题

http://poj.org/problem?id=2262

#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<queue>
#include<vector>
using namespace std;
typedef long long ll;

bool np[1000005];

int main() {
#ifdef Yinku
    freopen("Yinku.in", "r", stdin);
#endif // Yinku
    np[1] = 1;
    for(int i = 2; i <= 1000000; ++i) {
        if(np[i])
            continue;
        else {
            for(int j = i + i; j <= 1000000; j += i)
                np[j] = 1;
        }
    }

    int n;
    while(~scanf("%d", &n)) {
        if(n == 0)
            break;
        for(int i = 1;; ++i) {
            if(!np[i] && !np[n - i]) {
                printf("%d = %d + %d\n", n, i, n - i);
                break;
            }
        }
    }
    return 0;
}

POJ - 2262 - Goldbach's Conjecture = 水题

原文：https://www.cnblogs.com/Inko/p/11715052.html