Cod sursa(job #2783775)
| Utilizator | Data | 15 octombrie 2021 08:10:47 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#define M 2000000
using namespace std;
#include <fstream>
ifstream in("ciur.in");
ofstream out("ciur.out");
bool ciur[M+1];
int main()
{
ciur[0]=1;
ciur[1]=1;
for(int i=2;i*i<=M;i++)
if(ciur[i]==0)
{
for(int j=i*i;j<=M;j=j+i)
ciur[j]=1;
}
int n;
in>>n;
int x;
int cnt=0;
for(int c=1;c<=n;c++)
{
in>>x;
if(ciur[x]==0)
cnt++;
}
out<<cnt;
return 0;
}
