Cod sursa(job #1827878)
Utilizator | Data | 12 decembrie 2016 14:30:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int a[2000000];
int main()
{
int n,cnt,i,j;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
fin>>n;
a[1]=1;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=2;i*i<=n;i++)
if(a[i]==0)
for(j=i*i;j<=n;j=j+i)
a[j]=1;
cnt=0;
for(i=2;i<=n;i++)
if(a[i]==0) cnt++;
fout<<cnt;
fout.close();
return 0;
}