Cod sursa(job #278290)
Utilizator | Data | 12 martie 2009 10:57:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<stdio.h>
#include<stdlib.h>
int main()
{
long n,i,j,contor;
bool v[2000001];
freopen("ciur.in", "rt", stdin);
freopen("ciur.out", "wt", 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;
}