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