Cod sursa(job #1752305)
Utilizator | Data | 3 septembrie 2016 14:39:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#define nMax 2000001
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, Sol;
bool viz[nMax];
void read()
{
fin>>n;
}
void sieve()
{
Sol=1;
for(int i=3; i<=n; i+=2)
{
if(viz[i]==0)
{
Sol++;
for(int j=i*3; j<=n; j+=i*2)
viz[j]=1;
}
}
}
void write()
{
fout<<Sol;
}
int main()
{
read();
sieve();
write();
}