Cod sursa(job #843424)
| Utilizator | Data | 27 decembrie 2012 22:36:42 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
#include<math.h>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
long v[2000001],i,j,cont=0,n;
f>>n;
for (i=0;i<n;++i)
v[i]=0;
v[0]=v[1]=1;
for (i=4;i<=n;i+=2)
v[i]=1;
for (i=3;i<=sqrt(n);i=i+2)
if (v[i]==0)
for (j=i*2;j<=n;j=j+i)
v[j]=1;
for (i=2;i<=n;i++)
if(v[i]==0)
cont++;
g<<cont;
}
