Pagini recente » Cod sursa (job #1705489) | Cod sursa (job #2827507) | Cod sursa (job #2912317) | Cod sursa (job #929093) | Cod sursa (job #2469191)
#include <fstream> //for ifstream, ofstream
#include <cmath> //for sqrt(x)
#include <bitset> //for bitset<>
#define ARR_MAX 100005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset<ARR_MAX> check; //boolean array made of only 0 and 1
int k; //the initial number
int sol; //the number of primes
int main()
{
fin >> k;
for(int i = 2; i < k; i++)
check[i] = 1;
for(int i = 2; i <= sqrt(k); i++)
if(check[i])
for(int j = i * i; j < k; j += i)
check[j] = 0;
for(int i = 2; i < k; i++)
if(check[i])
sol++;
fout << sol;
}