Cod sursa(job #1213802)
Utilizator | Data | 28 iulie 2014 23:34:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
int n,nr;
bitset<2000008> b;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main(){
fin>>n;
for(int i=2;i<=n;++i){
if(b[i]==0){
nr++;
for(int j=2;j<=n/i;++j){
b[i*j]=1;
}
}
}
fout<<nr;
return 0;
}