Cod sursa(job #2490543)

Utilizator PopDragosTheLamacorn PopDragos Data 10 noiembrie 2019 14:47:11
Problema Ciurul lui Eratosthenes Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.43 kb
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
int n,v[2000000], cont;
int main()
{
    ifstream fin("ciur.in");
    ofstream fout("ciur.out");
    fin>>n;
    for(int i=2; i<n; i++)
    {
        if(v[i]==0)
        {
            cont++;

            for(int j=2; j<=n/2; j++)
            {
                v[i*j]=1;
            }
        }

    }

    fout<<cont;

    return 0;
}