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