Cod sursa(job #301568)
Utilizator | Alexandra alex@ndra | Data | 8 aprilie 2009 11:54:42 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
using namespace std;
long prim[200001];
long n, i, j, nr=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
f>>n;
//prim[1]=0;
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
if(prim[i]==1)
for(j=i+i;j<=n;j=j+i)
prim[j]=0;
for(i=2;i<=n;i++)
if(prim[i]==1)
nr++;
g<<nr;
return 0;
}