Pagini recente » Cod sursa (job #2574995) | Junior Challenge 2015 Runda 1 | Cod sursa (job #834265) | Cod sursa (job #3127987) | Cod sursa (job #1337197)
#include <iostream>
#include <fstream>
using namespace std;
#define MAX_N 2000001
bool ciur[MAX_N],n;
int nr;
ifstream f("ciur.in");
ofstream g("ciur.out");
void compute()
{
long i;
for (i = 2; i <= n; i++)
{
if (!ciur[i])
{
++nr;
for (long j = i + i; j <= n; j = j + i)
{
ciur[j] = true;
}
}
}
}
int main()
{
f >> n;
compute();
g << nr;
f.close();
g.close();
}