Cod sursa(job #1120690)

Utilizator kappykkDragos kappykk Data 25 februarie 2014 09:29:45
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.41 kb
#include <iostream>
#include <fstream>

using namespace std;

bool pr[2000001];

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