Cod sursa(job #373891)
Utilizator | Data | 15 decembrie 2009 13:50:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <stdio.h>
#define DIM 2000000
char ciur[DIM] ;
int main()
{
freopen ("ciur.in","r" , stdin) ;
freopen ( "ciur.out" , "w" , stdout) ;
int n , k=0 ;
scanf ("%d" , &n ) ;
for ( int i=2 ; i<=n ; ++i )
{
if ( !ciur[i] )
k++ ;
for ( int j=2*i ; j<=n ; j+=i )
ciur[j]=1 ;
}
printf ("%d" , k) ;
return 0 ;
}