Cod sursa(job #1410292)
Utilizator | Data | 30 martie 2015 23:13:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <bitset>
int n;
int ciureanu()
{
int i, j, nrprime=0;
std::bitset<2000001> v;
v.set();
for (i=2;i<=n;i++)
{
if (v[i])
{
for (j=i+i;j<=n;j+=i)
v[j]=false;
nrprime++;
}
}
return nrprime;
}
int main()
{
std::ifstream fin("ciur.in");
std::ofstream fout("ciur.out");
fin>>n;
fout<<ciureanu();
return 0;
}