Cod sursa(job #913380)

Utilizator Pop_EmilPal Tamas Pop_Emil Data 13 martie 2013 13:32:13
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.38 kb
#include <stdio.h>

using namespace std;
int prim[2000000];
int n,res=0;

int main()
{
  freopen("ciur.in","r",stdin);
  freopen("ciur.out","w",stdout);

 scanf("%d",&n);

 for(int i=1;i<=n;i++)
  prim[i]=1;

  for(int i=2;i<=n;i++)
   if(prim[i])
     {
       res++;
         for(int j=2*i;j<=n;j+=i)
            prim[j]=0;
     }

printf("%d",res);
return 0;
}