Pagini recente » Cod sursa (job #1234636) | Cod sursa (job #1460685) | Cod sursa (job #1468768) | Cod sursa (job #2300357) | Cod sursa (job #1807069)
#include <iostream>
#include <fstream>
#define MAX 2000001
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char a[MAX];
int p[MAX-1];
int n,i,j,k;
void ciur()
{ cin>>n;
for (i=2;i*i<=MAX;i++)
if (a[i]==0)
for (j=i*i;j<=MAX;j=j+i)
a[j]=1;
for (i=2;i<=n;i++)
{if (a[i]==0) k++;
}
p[0]=k;
}
int main()
{ ciur();
cout<<p[0];
return 0;
}