Cod sursa(job #675549)
Utilizator | Data | 7 februarie 2012 18:54:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<stdio.h>
int N,nr;
char v[2000001];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int i,j;
scanf("%d",&N);
for(i=2;i<=N;i++)
v[i]=0;
for(i=2;i<=N/2;i++)
if(v[i]==0)
{
nr++;
for(j=i*i;j<=N;j*=i)
v[i]=1;
}
printf("%d\n",nr);
}