Cod sursa(job #2184585)
Utilizator | Data | 24 martie 2018 09:59:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[2000001];
int main()
{
int i, n, d, j,x=0;
fin>>n;
for(d=2; d*d<=n; d++)
{
if(v[d]==false)
{
for(j=d*d; j<=n; j+=d)
v[j]=true;
}
}
for(i=2; i<=n; i++)
{
if(!v[i])
{
x++;
}
}
fout<<x;
return 0;
}