Pagini recente » Cod sursa (job #1049042) | Cod sursa (job #1754835) | Cod sursa (job #2421944) | Cod sursa (job #1359438) | Cod sursa (job #1698188)
#include <iostream>
#include <fstream>
using namespace std;
bool v[2000010];
int ciur[1000000],nciur;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int N;
f>>N;
f.close();
ciur[++nciur]=2;
for(int i=3;i<=2000000;i+=2)
{
if(v[i]==false)
ciur[++nciur]=i;
if(1LL*i*i<=2000000LL)
for(int k=i;k*i<=2000000;k+=2)
v[k*i]=true;
}
int k=0;
for(int i=1;ciur[i]<=N;i++)
k++;
g<<k;
g.close();
return 0;
}