Pagini recente » Cod sursa (job #162627) | Cod sursa (job #40754) | Cod sursa (job #1141632) | Cod sursa (job #3267392) | Cod sursa (job #2529060)
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX = 2e6;
char ciur[NMAX + 1];
int main() {
ifstream fin( "ciur.in" );
ofstream fout( "ciur.out" );
int n, i, j, prime = 0;
fin >> n;
for ( i = 3; i * i <= n; i += 2 ) {
if ( ciur[i] == 0 && i % 2 == 1 ) {
for ( j = i * i; j <= NMAX; j += i ) {
ciur[j] = 1;
}
}
}
for ( i = 3; i <= n; i += 2 ) {
prime += 1 - ciur[i];
cout << (char)(ciur[i] + '0') << ' ';
}
prime += ( n >= 2 );
fout << prime;
return 0;
}