POJ 2739 解题报告

这道题也挺简单的。就是素数筛选法先筛选出1000以内的所有素数，然后按照题目描述的统计就好了。

2739

Accepted

156K

0MS

C++

1131B

/* 
ID: thestor1 
LANG: C++ 
TASK: poj2739 
*/
#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 = 10000;

int main()
{
	std::vector<bool> isprime(MAXN, true);
	for (int n = 2; n < MAXN; ++n)
	{
		if (isprime[n])
		{
			for (int k = n; n * k < MAXN; ++k)
			{
				isprime[n * k] = false;
			}
		}
	}

	std::vector<int> primes;
	for (int n = 2; n < MAXN; ++n)
	{
		if (isprime[n])
		{
			primes.push_back(n);
		}
	}

	// for (int i = 0; i < primes.size(); ++i)
	// {
	// 	printf("%d ", primes[i]);
	// }

	int n;
	while (scanf("%d", &n) && n)
	{
		int cnt = 0;

		for (int left = 0; primes[left] <= n; ++left)
		{
			int sum = primes[left];
			int right = left + 1;
			while (sum < n)
			{
				sum += primes[right];
				right++;
			}
			cnt += (sum == n);
		}

		printf("%d\n", cnt); 
	}

	return 0;  
}