Cod sursa(job #1665617)

Utilizator MateiAruxandeiMateiStefan MateiAruxandei Data 27 martie 2016 10:21:17
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.42 kb

#include <stdio.h>

using namespace std;
int nmax,i,nr,j,m;
bool c[2000005];
int main()
{
   freopen("ciur.in","r",stdin);
   freopen("ciur.out","w",stdout);
   scanf("%d",&nmax);
   c[0]=c[1]=1;
   for(i=2;i*i<=nmax;i++)
        if(c[i]==0)
             for(m=2;m*i<=nmax;m++)
                 c[m*i]=1;
    for(i=1;i<=nmax;i++)
        if(c[i]==0)
           nr++;
    printf("%d\n",nr);
    return 0;
}