Cod sursa(job #1569682)

Utilizator iDanyelArvat Ovidiu Daniel iDanyel Data 15 ianuarie 2016 20:43:00
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;

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