Pagini recente » Cod sursa (job #3125277) | Cod sursa (job #1995423) | Cod sursa (job #1085775) | Cod sursa (job #3275588) | Cod sursa (job #2504656)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
short int p[2000002];
int main()
{
int n, contor=0;
fin>>n;
for (int i=2; i<=sqrt(n); i++)
{
if(p[i]==0)
{
for (int j=2*i; j<=n; j=j+i)
{
p[j]=1;
}
}
}
for (int i=2; i<=n; i++)
{
if (p[i]==0)
{
contor++;
}
}
fout<<contor;
return 0;
}