Cod sursa(job #1307325)

Utilizator DragosCDragos Corleanca DragosC Data 1 ianuarie 2015 22:51:01
Problema Ciurul lui Eratosthenes Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.58 kb
#include <iostream>
#include <fstream>
#include <cmath>
#define nmax 2000000
using namespace std;

int main()
{
    ifstream f("ciur.in");
    ofstream g("ciur.out");
    int n;
    f>>n;
    int i,k=0;
    bool a[nmax];
    for(i=2; i<=n; i++)
    {
        a[i]=1;
    }
    for(i=2; i<=sqrt(n); i++)
    {
        if(a[i])
        {
            for(int j=i; j<=n/i; j++)
            {
                a[i*j]=0;
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(a[i])
        {
            k++;
        }
    }
    g<<k;
    return 0;
}