Cod sursa(job #1893612)

Utilizator alexmihaxPasca Mihai alexmihax Data 25 februarie 2017 20:21:36
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.35 kb
Raporteaza aceasta sursa 
#include <iostream>
#include <fstream>

using namespace std;

ifstream f("ciur.in");
ofstream g("ciur.out");

int main()
{int C[2000000], N, I, J,s=0;

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

for (I=2;I<=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++;
g<<s;
    return 0;
}