Pagini recente » Cod sursa (job #1889858) | Cod sursa (job #884124) | Cod sursa (job #1848593) | Cod sursa (job #2625083) | Cod sursa (job #896561)
Cod sursa(job #896561)
# include <fstream>
using namespace std;
ifstream cein ("ciur.in");
ofstream ceou ("ciur.out");
int n,k,i,p,m;
bool a[1001];
int ciur ();
void ceifs ()
{
cein>>n;
}
void ceofs ()
{
ceou<<ciur();
}
int main ()
{
ceifs ();
k = 0;
ceofs ();
}
int ciur ()
{
for (i = 2; i <= n; i++)
a[i] = true;
for (p = 2; p <= n; p++)
if (a[p])
for (m = 2*p; m <= n; m += p)
a[m] = false;
for (i = 2; i <= n; i++)
if (a[i])
k++;
return k;
}