POJ 2262 解题报告

这道题是用素数筛选法加two sum算法解的。值得注意的地方是类似6 = 3 + 3这样的例子，left 是可以等于right的。

2262

Accepted

1308K

485MS

G++

1405B

/* 
ID: thestor1 
LANG: C++ 
TASK: poj2262 
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cassert>

using namespace std;

const int MAXN = 1000000;

int binary_search(const vector<int> &primes, int n)
{
	int left = 0, right = primes.size() - 1, mid;
	while (left < right)
	{
		mid = left + ((right - left) >> 1);
		if (primes[mid] < n)
		{
			left = mid + 1;
		}
		else
		{
			right = mid - 1;
		}
	}
	return right;
}

int main()
{
	std::vector<bool> isPrime(MAXN, true);
	std::vector<int> primes;
	for (int i = 2; i < MAXN; ++i)
	{
		if (!isPrime[i])
		{
			continue;
		}
		primes.push_back(i);
		for (int j = 2; i * j < MAXN; ++j)
		{
			isPrime[i * j] = false;
		}
	}

	int n;
	while (cin >> n && n)
	{
		assert (n % 2 == 0 && 6 <= n && n < MAXN);
		int left = 0, right = binary_search(primes, n), sum;
		while (left <= right)
		{
			sum = primes[left] + primes[right];
			if (sum < n)
			{
				left++;
			}
			else if (sum > n)
			{
				right--;
			}
			else
			{
				break;
			}
		}
		assert (left <= right);
		cout << n << " = " << primes[left] << " + " << primes[right] << endl;
	}

	return 0;  
}