Cod sursa(job #1361025)

Utilizator zpaePopescu Andreea zpae Data 25 februarie 2015 19:14:22
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include<cstdio>
using namespace std;
int n,k=1;//p[100]
char 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]='x';
        }
    }
    printf("%d\n",k);
    //for(i=0;i<k;i++)
    //    printf("%d ",p[i]);
    return 0;
}