Cod sursa(job #2011827)
Utilizator | Data | 17 august 2017 12:29:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int ciur[2000001], i, j;
long int nr, n;
int main()
{
fin>>n;
ciur[1]=1;
for (i=1;i<=n/2;i++)
if (ciur[i]==0)
for (j=i*2; j<=n; j=j+i)
ciur[j]=1;
for (i=2;i<=n;i++)
if (ciur[i]==0)
nr++;
fout<<nr;
return 0;
}