Cod sursa(job #1824982)

Utilizator alexghineaGhinea alexandru stefan alexghinea Data 8 decembrie 2016 17:21:22
Problema Ciurul lui Eratosthenes Scor 30
Compilator c Status done
Runda Arhiva educationala Marime 0.4 kb
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000000
int v[MAX];
int main()
{
    int i,j,nr=0,n;
    freopen("ciur.in","r",stdin);
    freopen("ciur.out","w",stdout);
    scanf("%d",&n);
    for(i=2;i<=n;i++)
        if(!v[i])
            for(j=i+i;j<=n;j=j+i)
                v[j]=1;
    for(i=2;i<=n;i++)
        if(v[i]==0)
            nr++;
    printf("%d",nr);
    return 0;
}