Cod sursa(job #2061843)
Utilizator | Data | 9 noiembrie 2017 19:20:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool ciur[2000000];
int d,i,j,n;
int main()
{
ciur[1]=1;
for(d=2;d*d<=200000;d++)
{
for(j=d*2;j<=200000;j=j+d)
{
ciur[j]=1;
}
}
fin>>n;
j=0;
for(i=1;i<=n;i++)
{
if(ciur[i]==0)
j++;
}
fout<<j;
return 0;
}