素数筛法1163

#include "stdafx.h"
#include<iostream>
#include<math.h>
using namespace std;
int prime[10000];
int primeSize=0;
bool marked[10001] = { false };
void init(){
	for (int i = 2; i <= 10000; i++)
	{
		if (marked[i] == true){
			continue;
		}
		prime[primeSize++] = i;
		for (int j = i*i; j< 10000; j += i){
			marked[j] = true;
		}
	}
}
int _tmain(int argc, _TCHAR* argv[])
{
	init();
	int n;

	while (cin>>n)
	{
		bool flag = false;

		for (int i = 0; i <= primeSize; i++){
			if ((prime[i] < n) && (prime[i] % 10 == 1)){
				if (flag == false){
					cout << prime[i];
					flag = true;
				}
				else
				{

					cout << " " << prime[i];
				}
			}
			
			}
		if (flag == false){
			cout << "-1";
			
		}
		else
		{

		}	cout << endl;
	}
}