Cod sursa(job #2780949)
| Utilizator | Data | 8 octombrie 2021 10:15:40 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <stdio.h>
unsigned char ciur[ ( 1 << 17 ) ];
int main()
{
int n;
FILE *fin = fopen( "ciur.in", "r" );
fscanf( fin, "%d", &n );
fclose( fin );
int no = 1;
for( int i = 3; i <= n; i += 2 ){
if( ( ciur[ i >> 4 ] & ( 1 << ( ( i >> 1 ) & 7 ) ) ) ) continue;
++no;
for( int j = i + i + i; j <= n; j += i + i )
ciur[ j >> 4 ] |= 1 << ( ( j >> 1 ) & 7 );
}
FILE *fout = fopen( "ciur.out", "w" );
fprintf( fout, "%d\n", no );
fclose( fout );
return 0;
}
