Cod sursa(job #1905201)
Utilizator | Data | 5 martie 2017 22:45:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, i, k, d;
bool ciur[2000001];
int main()
{
fin>>n;
ciur[1]=1;
for(d=2; d*d<=n; ++d)
{
if(ciur[d]==0)
{
for(i=d*d; i<=n; i=i+d) ciur[i]=1;
}
}
for(i=1; i<=n; ++i) if(!ciur[i]) ++k;
fout<<k<<"\n";
return 0;
}