Cod sursa(job #1361034)

Utilizator zpaePopescu Andreea zpae Data 25 februarie 2015 19:17:39
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.48 kb
#include<cstdio>
using namespace std;
int n,k=1;//p[100]
bool u[2000002];

int main()
{
    freopen("ciur.in","r",stdin);
    freopen("ciur.out","w",stdout);
    int i,j;
    scanf("%d",&n);
    //p[k++]=2;
    for(i=3;i<=n;i+=2)
    {
        if(!u[i])
        {
            k++;//p[k++]=i;
            for(j=i*i;j<=n;j+=2*i)
                u[j]=true;
        }
    }
    printf("%d\n",k);
    //for(i=0;i<k;i++)
    //    printf("%d ",p[i]);
    return 0;
}