Cod sursa(job #933794)
Utilizator | Data | 30 martie 2013 12:33:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <bitset>
using namespace std;
bitset <2000001>neprim;
int prim;
int main()
{
int n;
ifstream f1("ciur.in");
ofstream f2("ciur.out");
f1>>n;
for (int y,i=2;i<=n;++i)
{
if (neprim[i])
continue;
++prim;
for (y=i+i;y<=n;y+=i)
neprim[y]=1;
}
f2<<prim<<'\n';
f1.close();
f2.close();
return 0;
}