Cod sursa(job #654569)
Utilizator | Data | 30 decembrie 2011 17:36:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<stdio.h>
bool marcat[2000001];
int main()
{
int n,i,j,nr=0;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2;i*i<=n;i++)
if(!marcat[i])
for(j=i*i;j<=n;j+=i)
marcat[j]=true;
for(i=2;i<=n;i++)
if(!marcat[i])
nr++;
printf("%d\n",nr);
return 0;
}