Cod sursa(job #1295088)

Utilizator RaduToporanRadu Toporan RaduToporan Data 18 decembrie 2014 19:36:57
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.39 kb
#include <cstdio>

bool a[2000001];
int n,i,j,nrprime=0;

int main()
{
    freopen("ciur.in","r",stdin);
    freopen("ciur.out","w",stdout);
    scanf("%d",&n);
    for (i=1; i<=n; i++) a[i]=0;
    a[0]=1;
    a[1]=1;
    for (i=2; i*i<=n; i++) if (a[i]==0) for (j=i;j<=n/i;j++) a[i*j]=1;
    for (i=1; i<=n; i++) if (a[i]==0) nrprime++;
    printf("%d",nrprime);
    return 0;
}