问题 C: Goldbach‘s Conjecture

题目链接

#pragma warning(disable:4996);
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<time.h>
#include<stdlib.h>
using namespace std;
const int maxn = 1000000;
int prime[maxn], pnum = 0;
bool p[maxn] = { 0 };
void findprime() {
	for (int i = 2;i < maxn;i++) {
		if (p[i] == false)
		{
			prime[pnum++] = i;
			for (int j = i + i;j < maxn;j += i)
				p[j] = true;
		}
	}
}
int main() {
	findprime();
	int k;
	while (scanf("%d", &k) != EOF) {
		if (k == 0) break;
		int sum = 0;
		for (int i = 0;prime[i] < k;i++) {
			for (int j = i;prime[j] < k;j++) {
				if (prime[i] + prime[j] == k) sum++;
			}//这样避免了对算过的素数对的重复计算；

		}
		printf("%d\n", sum);
	}
	return 0;
}