Cod sursa(job #278276)
Utilizator | Data | 12 martie 2009 10:51:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<stdio.h>
int main()
{
long int n,i,j,contor=0;
bool v[2000003];
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%ld",&n);
for(i=2;i<=n;++i)
if(!v[i])
{contor++;
for(j=2;j*i<=n;++j) v[i*j]=1; }
printf("%ld", contor); return 0;
}