Cod sursa(job #1199793)

Utilizator RathebaSerbanescu Andrei Victor Ratheba Data 20 iunie 2014 17:02:31
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.57 kb
#include <cstdio>

using namespace std;
#define MAX 2000003
int ciur[MAX], n;
int fciur();
int main()
{
    freopen("ciur.in","r",stdin);
    freopen("ciur.out","w",stdout);
    scanf("%d",&n);
    printf("%d\n",fciur());
}
int fciur()
{
    int i, j, sol=0;
    for(i=4; i<=n; i+=2)
        ciur[i]=1;
    for(i=2; i<=n; i++){
        if(ciur[i]==0){
            for(j=i*i; j<=n; j+=i)
                ciur[j]=1;
            sol++;
        }
    }
    /*for(i=2; i<=n; i++)
        if(ciur[i]==0)
            printf("%d ",i);*/
    return sol;
}