Cod sursa(job #2546132)
Utilizator | Data | 13 februarie 2020 20:44:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
int N;
int E[200000001],nr;
int main()
{
fi>>N;
for (int i=2;i<=N;i++)
E[i]=1;
for (int i=2;i<=N;i++)
if (E[i]==1)
for (int j=i+i;j<=N;j=j+i)
E[j]=0;
for (int i=1;i<=N;i++)
if (E[i]==1)
nr++;
fo<<nr;
return 0;
}