Cod sursa(job #1210550)
Utilizator | Data | 20 iulie 2014 14:16:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <bitset>
using namespace std;
bitset<2000001> b;
int n, i, j, nr;
int main() {
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for (i=2;i<=n;i++)
if (b[i] == 0) {
nr++;
for (j=i+i;j<=n;j+=i)
b[j] = 1;
}
fout<<nr<<"\n";
return 0;
}