Cod sursa(job #1816833)
Utilizator | Data | 26 noiembrie 2016 23:10:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <bitset>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bitset<2000005> b;
int main(){
int n, nr=0;
in>>n;
for(int i=2; i<=n; i++){
if(!b[i]){
for(int j=2*i; j<=n; j+=i)b[j]=1;
nr++;
}
}
out<<nr;
return 0;
}