Cod sursa(job #896561)

Utilizator Luzar_rokyIlies Dragos Ionut Luzar_roky Data 27 februarie 2013 16:08:02
Problema Ciurul lui Eratosthenes Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.5 kb
# 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;
}