Cod sursa(job #1824975)

Utilizator dijmaDijmarescu Ion dijma Data 8 decembrie 2016 17:14:13
Problema Ciurul lui Eratosthenes Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.53 kb
#include <stdio.h>
#include <stdlib.h>
int nrprim(int x)
{
    int i;
    for(i=2;i<=x/2;i++)
    {
        if(x%i==0)
        {
            return 1;
        }
    }
    return 0;
}
int v[10000001];
int main()
{
    int n,k=0,j,i;
    scanf("%d",&n);
    for(i=2;i<=n;i++)
    {
        if(v[i]==0)
        {
            j=1;
            k++;
            while(i*j<=n)
            {
                v[i*j]=1;
                j++;
            }
        }
    }


    printf("%d ",k);

    return 0;
}