Cod sursa(job #1537929)
Utilizator | Data | 28 noiembrie 2015 12:06:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[200000001];
int gigel;
int main()
{
int n,j,i;
in>>n;
for(i=1;i<=n;i++)
{
in>>v[i];
}
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
for(j=i*i;j<=n;j=j+1)
{
v[j*i]=1;
}
}
}
for( i=1; i<=n; i++)
{
if(v[i]==0)
gigel++;
}
out <<gigel;
return 0;
}