Cod sursa(job #757848)
Utilizator | Data | 13 iunie 2012 17:25:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
int a[1000001];
int ciuruire(int n)
{
int i,j;
int s;
for(i=2;i<=1000;++i)
if(a[i] == 0)
{
s++;
for(j=i*i;j<=n;j += i)
{
a[j] = i;
}
}
for(;i<=n;i++)
if(a[i] == 0)
s++;
return s;
}
int main()
{
int n;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
printf("%ld",ciuruire(n));
return 0;
}