Cod sursa(job #793217)

Utilizator bogfodorBogdan Fodor bogfodor Data 2 octombrie 2012 12:35:29
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include <cstdio>

using namespace std;

FILE *fin=freopen("ciur.in","r",stdin);
FILE *fout=freopen("ciur.out","w",stdout);

int n;
int s[2000005];

void ciur()
{
    for(int i=2;i<=n;i++)
    {
        if(s[i]==0)
            for(int j=i;j<=n;j+=i)
                s[i]=1;
    }
}

void af()
{
    int nr=0;
    for(int i=1;i<=n;i++)
        if(s[i]==0)
            nr++;
    printf("%d\n",nr);
}

int main()
{
    scanf("%d",&n);
    ciur();
    af();
    return 0;
}