Cod sursa(job #2069447)

Utilizator marcogoldPop Mihali Marco Silviu marcogold Data 18 noiembrie 2017 14:08:39
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.45 kb
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;

ifstream fi("ciur.in");
ofstream fo("ciur.out");



int main()
{   int N;
    fi>>N;
    int C[N+1],I, J,S=0;

    fi>>N;

    for(I=1; I<=N; I++) C[I] =1;

    for (I=2; I<=sqrt(N); I++)

        if(C[I] == 1)

            for(J=2; J*I <= N; J ++)  C[I*J] = 0;


    for(I=2; I<=N; I++)

        if(C[I] ==1) S++;
        fo<<S;
    return 0;
}