Cod sursa(job #2270698)
Utilizator | Data | 27 octombrie 2018 13:46:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool not_prime[2000007];
int prt_elemente(int n){
int s=0;
for(int i=2;i<=n;i++){
if(!not_prime[i])
s++;
for(int k=i*2;k<=n;k+=i){
not_prime[k]=true;
}
}
return s;
}
int main()
{
int n;
in>>n;
out<<prt_elemente(n);
return 0;
}