Cod sursa(job #526363)
| Utilizator |  Raul Andrei raul1520 |
Data | 28 ianuarie 2011 10:16:21 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <stdio.h>
using namespace std;
#define nmax 2000005
int n,x[nmax],i,j,d,k;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
x[0]=1;
x[1]=1;
d=0;
for(i=2;i<n;i++)
{
if(x[i]==0)
{
for(j=2;j<n/i;j++)
{
x[i*j]=1;
}
d=d+1;
}
}
printf("%d",d);
return 0;
}