Cod sursa(job #1026182)

Utilizator Daniel3717Aleca Daniel Adrian Daniel3717 Data 11 noiembrie 2013 11:25:29
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.48 kb
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
bitset <2000005> b;
int n,i,i1,k;
int main(void)
{
    FILE * f;
    f=fopen("ciur.in","r");
    ofstream g("ciur.out");
    fscanf(f,"%d",&n);
    b[0]=1;
    b[1]=1;
    k=0;
    for (i=2;i<=n/2;i++)
        if (b[i]==0)
            for (i1=i*2;i1<=n;i1=i1+i)
                b[i1]=1;
    for (i=2;i<=n;i++)
        if (b[i]==0)
            k++;
    g<<k;
    g.close();
    return 0;
}