Pagini recente » Cod sursa (job #2161643) | Cod sursa (job #402326) | Cod sursa (job #2982503) | Cod sursa (job #2728404) | Cod sursa (job #1238004)
#include <fstream>
#include <math.h>
using namespace std;
bool prim[2000007];
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n , nr = 0 ;
cin>>n;
for ( int i = 2 ; i <= sqrt(n) ; ++i )
if ( prim [ i ] == 0 )
for ( int j = i*i ; j <= n ; j = j+i )
prim [ j ] = 1 ;
for ( int i = 2 ; i <= n ; ++i )
if ( prim [ i ] == 0 ) nr++ ;
cout<<nr;
return 0;
}