Cod sursa(job #1554359)

Utilizator cristii2000cristiiPanaite Cristian cristii2000cristii Data 21 decembrie 2015 12:13:44
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.51 kb
#include <cstdio>
char p[2000000];
using namespace std;
int  ciur(int n)
{
    int c=0;
    for (int i=2; i<=n; i++)
    {
        if (p[i]==0)
        {
            int j=2*i;
            while (j<=n)
            {
                p[j]=1;
                j+=i;
            }
            c++;
        }

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