Pagini recente » Cod sursa (job #2893836) | Cod sursa (job #2740546) | Cod sursa (job #422930) | Cod sursa (job #2568071) | Cod sursa (job #2280315)
#include <iostream>
#include <fstream>
using namespace std;
int isprim_neoptim(int a)
{
int k = 0;
for (int i = 1; i <= a; ++i)
{
if (a % i == 0)
{
k++;
}
}
if (k == 2)
return 1;
return 0;
}
int isprim(int a)
{
for (int i = 2; i*i <= a; i++)
{
if (a % i == 0)
{
return 0;
}
}
return 1;
}
bool a[2000001];
int main()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, x=0;
fin >> n;
for (int i=0; i<=n; i++)
{
a[i]=1;
}
a[0]=0;
a[1]=0;
for (int i=2; i<=n; ++i)
{
if (a[i]==0)
continue;
for ( int j=i+i; j<=n; j=j+i)
{
a[j]=0;
}
}
int k=0;
for ( int i=0; i<=n; i++)
{
if (a[i]==1)
{
k++;
}
}
fout <<k<<endl;
return 0;
}