Cod sursa(job #715332)
Utilizator | Data | 17 martie 2012 00:34:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <bitset>
using namespace std;
bitset<2000000> v;
int main(){
int n;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
int cate=0;
for(int start=2; start<=n; start++)
{
if(v[start]==1)
continue;
cate++;
for(int contor=start; contor<=n; contor+=start)
v[contor]=1;
}
fout<<cate;
return 0;
}