Pagini recente » Cod sursa (job #1734173) | Cod sursa (job #2377590) | Cod sursa (job #911777) | Cod sursa (job #2668248) | Cod sursa (job #2759105)
#include <stdio.h>
#define MAX_N 2000000
int ciur[MAX_N + 1];
int main() {
FILE *fin, *fout;
int n, prime, i, j;
fin = fopen( "ciur.in", "r" );
fscanf( fin, "%d", &n );
fclose( fin );
for ( i = 2; i * i <= n; i++ ) {
if ( ciur[i] == 0 ) {
for ( j = i * i; j <= n; j += i )
ciur[j] = 1;
}
}
prime = 0;
for ( i = 2; i <= n; i++ )
prime += 1 - ciur[i];
fout = fopen( "ciur.out", "w" );
fprintf( fout, "%d", prime );
fclose( fout );
return 0;
}