Cod sursa(job #2002438)
Utilizator | Alexandrescu Diana AlexDiana | Data | 19 iulie 2017 21:45:11 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int v[101];
int main()
{
int n,cnt;
cin>>n;
cnt=0;
for(int i=1;i<=n;i++)
cin>>v[i];
for(int i=1;i<=n;i++)
v[i]=1;
for(int i=2;i<=n;i++)
{
if(v[i]==1)
{
for(int j=2;j*i<=n;j++)
v[i*j]=0;
}
}
for(int i=2;i<=n;i++)
if(v[i]==1)
cnt++;
cout<<cnt;
return 0;
}