Cod sursa(job #2228113)
Utilizator | Data | 2 august 2018 18:22:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <bitset>
const int nmax=2000005;
using namespace std;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j;
bitset<nmax> ciur;
fin>>n;
int nr=0;
for(i=2;i<=n;i++) {
if(ciur[i]==0) {
nr++;
for(j=2*i;j<=n;j+=i) {
ciur[j]=1;
}
}
}
fout<<nr<<endl;
fin.close();
fout.close();
return 0;
}