Cod sursa(job #167378)
Utilizator | Data | 29 martie 2008 15:34:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<stdio.h>
int n,i,j,kkt,k;
char a[2000000];
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)
{
++kkt;
k=2;
j=i*k;
while(j<=n)
{
a[j]=1;
++k;
j=i*k;
}
}
}
printf("%d",kkt);
return 0;
}