Pagini recente » Cod sursa (job #1989038) | Cod sursa (job #906375) | Cod sursa (job #139932) | Cod sursa (job #2199569) | Cod sursa (job #1647084)
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset<2000000> primes;
int main()
{
unsigned N, counter = 0;;
fin >> N;
for(unsigned i = 2; i <= N; ++i)
primes[i] = 1;
for(unsigned i = 2; i <= N; ++i)
{
if(primes[i])
{
for(unsigned j = i * i; j <= N; j += i)
primes[j] = 0;
++counter;
}
}
fout << counter;
fin.close();
fout.close();
return 0;
}