Cod sursa(job #533511)

Utilizator nahsucpasat cristian nahsuc Data 14 februarie 2011 09:31:25
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.46 kb
#include<stdio.h>
#include<vector>
using namespace std;
FILE *in=fopen("ciur.in","rt");
FILE *out=fopen("ciur.out","wt");
int j,i,n,cont;
vector <bool> prim;
int main()
{
    fscanf(in,"%d",&n);
    prim.resize(n,true);
    for(i=2;i<=n;i++)
    if(prim[i]==true)
    {
        for(j=i*2;j<=n;j+=i)
            prim[j]=false;
    }
    for(i=2;i<=n;i++)
        if(prim[i]==true)
            cont++;
    fprintf(out,"%d",cont);
    return 0;
}