Pagini recente » Cod sursa (job #2428017) | Cod sursa (job #2104404) | Cod sursa (job #2974149) | Cod sursa (job #3243638) | Cod sursa (job #1112973)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool *sieve;
int main()
{
int n, count = 0;
fin>>n;
sieve = new bool[n]();
for(int i = 2; i< n; i++) sieve[i] = 0;
for(int i = 2; i< n; i++)
{
if(sieve[i] != 0) continue;
for(int j = 2; j<= n/i; j++)
{
if(sieve[i*j] == 0){sieve[i*j] = 1; count++;}
}
}
for(int i = 2; i< n; i++) cout<<sieve[i]<<" ";cout<<endl;
fout<<n-2-count<<endl;
return 0;
}