Cod sursa(job #1888161)
Utilizator | Data | 21 februarie 2017 22:43:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int V[2000005],n,k,i,j,aux,t,nr;
int main()
{
fin>>n;
V[0]=1;
V[1]=1;
for(i=2;i*i<=n;i++)
{
if(V[i]==0)
{
for(j=i;j<=n/i;j++)
{
V[i*j]=1;
}
}
}
for(i=1;i<=n;i++)
{
fin>>t;
if(V[t]==0)
{
nr++;
}
}
fout<<nr;
return 0;
}