Pagini recente » Cod sursa (job #605650) | Cod sursa (job #1366997) | Cod sursa (job #1999328) | Cod sursa (job #2574853) | Cod sursa (job #2730568)
#include <fstream>
#include <vector>
using namespace std;
int main()
{
bool sieve[2000001];
long int n,totalprime;
ifstream f;
f.open("ciur.in");
f>>n;
totalprime = n-1;
for(long int i=0; i<=n; i++)
sieve[i] = false;
f.close();
for(long int i=2; i<=n; i++)
if(!sieve[i])
{
for(long int j=2*i; j<=n; j = j+i)
if(!sieve[j])
{
totalprime = totalprime - 1;
sieve[j] = true;
}
}
ofstream g;
g.open("ciur.out");
g<<totalprime;
g.close();
return 0;
}