Cod sursa(job #3234856)
Utilizator | Data | 12 iunie 2024 04:34:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[2000001];
int i,j,n,k=0;
int main()
{
fin>>n;
for(i=1;i<=maxi;i++)
v[i]=0;
v[1]=1;
for(i=2;i*i<=maxi;i++)
if(v[i]==0)
for(j=i*i;j<=maxi;j=j+i)
v[j]=1;
for(i=1;i<=n;i++)
if(v[a[i]]==0)
k++;
fout<<k;
return 0;
}