Cod sursa(job #1542592)

Utilizator Vlad1111Sbengheci Vlad-Andrei Vlad1111 Data 5 decembrie 2015 15:01:25
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.42 kb
#include <stdio.h>

int n, s;
char ciur[2000005];

int main(void)
{
    int i, j;

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

    scanf("%d", &n);
    for(i=2;i<=n;++i)
        ciur[i]=1;
    for(i=2;i<=n;++i)
        if(prim[i])
        {
            ++s;
            for(j=i+i;j<=N;j+=i)
                ciur[j]=0;
        }

    printf("%d\n", s);

    return 0;
}