Cod sursa(job #2365893)
Utilizator | Data | 4 martie 2019 17:15:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
unsigned int n;
vector<bool> ciur;
int main(){
fin>>n;
ciur = vector<bool>(n+1,true);
unsigned int counter=0;
for(int i=2;i<=n;i++)
if(ciur[i]) {
counter++;
for (int j = (i << 1); j <= n; j += i)
ciur[i] = false;
}
fout<<counter;
return 0;
}