Cod sursa(job #633957)
Utilizator | Data | 15 noiembrie 2011 10:50:58 | |
---|---|---|---|
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,nr;
int main ()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for (int i=2; i<=n; ++i)
if (!b[i])
{
++nr;
for (int j=i+i; j<=n; j+=i)
b[j]=1;
}
g<<nr;
return 0;
}