Cod sursa(job #1015424)

Utilizator barabasi_csongorBarabasi Csongor barabasi_csongor Data 24 octombrie 2013 17:01:32
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.5 kb
#include <cstdio>
using namespace std;
long int n;
bool t[20000003];
void ciur(long int a)
{
    t[0]=t[1]=true;
    for(int i=2;i*i<a+2;i++)
        {
            if(t[i]==false)
            {
                for(int j=i+i;j<a+2;j+=i) t[j]=true;
            }
        }
}

int main()
{freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%ld",&n);
ciur(n);
long int s=0;
for(int i=2;i<=10;i++)
    {
        if(t[i]==false) s++;
    }
printf("%ld",s);
return 0;
}