Cod sursa(job #1121727)
Utilizator | Data | 25 februarie 2014 13:49:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long long n,i,j,c,x[2000001];
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>x[i];
}
c=0;
for(i=2;i<=n;i++)
{
if(x[i]==0)
{
c++;
for(j=i*i;j<=n;j=j+i)
x[i]=1;
}
}
g<<c;
f.close();
g.close();
return 0;
}