Cod sursa(job #2360073)
| Utilizator | Data | 1 martie 2019 12:13:08 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <cstdio>
#include <cmath>
using namespace std;
bool s[2000005];
void ciur()
{
int i, j, lim;
lim = ( int ) sqrt( double ( 2000001 ) );
s[0] = 1;
s[1] = 1;
for( i = 2; i <= lim; ++ i )
{
if( s[i] == 0 )
{
for( j = i + i; j < 2000001; j += i)
s[j] = 1;
}
}
}
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
ciur();
int n, cnt = 0;
scanf( "%d", &n );
for( int i = 1; i <= n; ++ i )
if( s[i] == 0 )
cnt++;
printf( "%d", cnt );
return 0;
}
