Cod sursa(job #1916850)
Utilizator | Data | 9 martie 2017 10:31:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int a[2000000],i,j,n,nrPrime;
int main()
{
fin>>n;
i=2;
while(i<n)
{
if(a[i]==0)
{
nrPrime++;
for(j=i*i;j<=n;j+=i)a[j]=1;
}
i++;
}
fout<<nrPrime;
return 0;
}