Cod sursa(job #188391)
Utilizator | Data | 8 mai 2008 10:12:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<stdio.h>
#define DIM 2000001
int n,i,j,prim,k,a[DIM];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d", &n);
for(i=2;i<=n;++i)
{
if(a[i]==0)
{
++prim;
k=2;
j=i*k;
while(j<=n)
{
a[j]=1;
++k;
j=i*k;
}
}
}
printf("%d",prim);
return 0;
}