Pagini recente » Cod sursa (job #1494864) | Cod sursa (job #2592280) | Cod sursa (job #481689) | Cod sursa (job #859158) | Cod sursa (job #1097187)
#include <cstdio>
#include <bitset>
#define Nmax 2000099
using namespace std;
int N,P[100000];
bitset < Nmax > v;
void Ciur(int N)
{
P[++P[0]]=2;
for(int i=3;i<=N;i+=2)
if(!v[i])
{
P[++P[0]]=i;
//if(1LL*i*i<=1LL*N)
for(int j=2*i;j<=N;j+=i)
if(!v[j])v[j]=1;
}
}
int main()
{
freopen("ciur.in", "rt", stdin);
freopen("ciur.out", "wt", stdout);
scanf("%d",&N);
Ciur(N);
printf("%d\n",P[0]);
return 0;
}