Cod sursa(job #2816114)
Utilizator | Data | 11 decembrie 2021 02:54:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main(){
deque<int> sieve = {2};
int n,i,j;
for(f>>n,i=3;i<=n;i+=2) sieve.push_back(i);
f.close();
for(i=1;i<sieve.size()-1;++i){
for(j=i;j<sieve.size();++j) sieve.erase(sieve[i]*sieve[j]);
}
g<<sieve.size()<<'\n';
g.close();
}