Cod sursa(job #2096287)
Utilizator | Data | 28 decembrie 2017 22:11:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n,i,j,nr;
bitset <2000005> a;
int main()
{
fin>>n;
for(i=4;i<=n;i+=2)
a[i]=1;
for(i=3;i*i<=n;i+=2)
if(!a[i])for(j=i*i;j<=n;j+=j+2*i)a[j]=1;
for(i=1;i<=n;i+=2)if(!a[i])++nr;
fout<<nr;
fin.close(); fout.close();
return 0;
}