Cod sursa(job #1015484)
Utilizator | Data | 24 octombrie 2013 18:47:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#include<bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset <2000005> p;
int n,nr;
int main()
{
int i,j;
fin>>n;
for (i=2;i<=n;++i)
if (!p[i])
{
++nr;
for (j=2;i*j<=n;++j)
p[i*j]=1;
}
fout<<nr<<'\n';
return 0;
}