Cod sursa(job #2168634)
Utilizator | Data | 14 martie 2018 11:48:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <bitset>
#define NM 2000001
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,nr;
bitset <NM> c;
int main()
{
f>>n;
for(i=2;i*i<=n;i++)
if(c[i]==0)
for(j=i*i;j<=n;j+=i) c[j]=1;
nr=0;
for(i=2;i<=n;i++)
if(c[i]==0) nr++;
g<<nr<<'\n';
return 0;
}