Cod sursa(job #1554337)

Utilizator Catalin_BorzaBorza Catalin-Mihai Catalin_Borza Data 21 decembrie 2015 12:01:44
Problema Ciurul lui Eratosthenes Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.41 kb
#include <iostream>
#include <cstdio>
using namespace std;
char p[20000];
int ciur(int N)
{
int k=0;

for(int i=2;i<=N;i++)
{
    if(p[i]==0)
    {for(int j=i*2; j<=N; j+=i)
    p[j]=1;
    k++;
    }
}
return k;
}


int main()
{
    int N,k;
    freopen("ciur.in", "r", stdin);
    freopen("ciur.out", "w", stdout);
    scanf("%d", &N);
    k=ciur(N);
    printf("%d", k);
    return 0;
}