Cod sursa(job #501378)
Utilizator | Data | 14 noiembrie 2010 21:03:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <algorithm>
#include <bitset>
#include <fstream>
using namespace std;
#define dim 2000001
//char v[dim];
bitset <dim> v;
int main(){
long n, f=1;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(int i=2;i<n;++i){
++i;
if(!v[i]){
++f;
for(int j=i;j<=n/i;++j){
v[j*i]=1;
++j;
}
}
}
fout<<f ;
return 0;
}