Cod sursa(job #178691)
| Utilizator |  Andrei Dobre andrei.dobre |
Data | 14 aprilie 2008 22:04:55 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include <stdio.h>
#define N 2000012
char v[N]={0};
int sol[1024];
int main()
{
int n,pr=0,nr=0,i,j;
freopen("ciur.in", "r",stdin);
freopen("ciur.out", "w",stdout);
scanf("%d", &n);
for(i=2;i<=n;++i)
if(v[i]==0)
{ ++nr; for(j=i+i;j<=n;j+=i)
v[j]=1; }
printf("%d\n",nr);
return 0;
}