Cod sursa(job #1672301)
Utilizator | Data | 2 aprilie 2016 16:02:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool ciur[2000001];
int main()
{
int n,d,i,nr=0;
in>>n;
ciur[0]=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]==0)
nr++;
out<<nr;
return 0;
}