Cod sursa(job #283803)
Utilizator | Data | 19 martie 2009 20:55:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<stdio.h>
int ciur[2000001],n,nr;
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(int i=2;i<=n;++i)
for(int j=i+i;j<=n;j+=i)
ciur[j]=1;
for (int i=2;i<=n;++i)
if(!ciur[i])
nr++;
printf("%d\n",nr);
return 0;
}