Cod sursa(job #2327879)
Utilizator | Data | 25 ianuarie 2019 09:49:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
long long i,j,N,contor=0;
bool a[2000000];
fin >> N;
for (i=2;i<=N;++i)
{
a[i]=1;
}
a[1]=0;
for (i=2;i<=N;++i)
{
if (a[i]==1)
{
++contor;
for (j=i+i;j<=N;j+=i)
{
a[j]=0;
}
}
}
fout << contor;
return 0;
}