Cod sursa(job #633953)
Utilizator | Data | 15 noiembrie 2011 10:28:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int N=2000001;
bitset <N> biti;
int n,rez;
int main(){
int i,j;
in>>n;
for(i=2;i*i<=n;++i){
if(biti[i]==0){
for(j=i*i;j<=n;j+=i)
biti[j]=1;
}
}
for(i=2;i<=n;i++){
if(biti[i]==0){
rez++;
}
}
out<<rez;
return 0;
}