Cod sursa(job #2018594)
| Utilizator | Data | 5 septembrie 2017 15:24:27 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <stdio.h>
int n , nr;
char ciur[2000010];
int main(){
int i , j;
freopen( "ciur.in" , "r" , stdin );
freopen( "ciur.out" , "w" , stdout );
scanf( "%d" , &n );
for( i = 2; i <= n ; i++ ){
ciur[i] = 1;
}
for( i = 2 ; i <= n ; i++ ){
if( ciur[i] != 0 ){
nr++;
for( j = 2 * i ; j <= n ; j = j + i ){
ciur[j] = 0;
}
}
}
printf( "%d\n" , nr );
return 0;
}
