Pagini recente » Cod sursa (job #2959275) | Cod sursa (job #2155675) | Cod sursa (job #2341228) | Cod sursa (job #2382417) | Cod sursa (job #2022811)
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int prime [ 2000006 ] ;
void sieve()
{
prime[1] = 1 ;
prime[2] = 0 ;
prime[3] = 0 ;
for ( int i = 2 ; i <= 2000006 ; i ++ )
{
if ( prime[i] == 0 )
{
for ( int j = i + i ; j <= 2000006 ; j +=i )
{
prime[j] = 1 ;
}
}
}
}
int main()
{
sieve () ;
int n ;
in >> n ;
int cnt = 0 ;
for ( int i = 2 ; i <= n ;i ++ )
{
if ( prime[i] == 0 )
{
cnt ++ ;
}
}
out << cnt ;
return 0;
}