Cod sursa(job #1826326)
Utilizator | Data | 10 decembrie 2016 12:38:53 | |
---|---|---|---|
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");
int X[2000005];
int main()
{
int N, i, j, k=0;
fin>>N;
for (i=2; i<=N; i++)
X[i]=1;
for (i=2; i<=N; i++)
{
if (X[i]!=0)
for (j=i+i; j<=N; j=j+i)
X[j]=0;
}
for (i=2; i<=N; i++)
if (X[i]==1)
k++;
fout<<k;
return 0;
}