Cod sursa(job #2867504)
Utilizator | Data | 10 martie 2022 13:27:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <bitset>
#include <vector>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,nr,j;
bitset <2000002> ciur;
int main()
{
fin>>n;
ciur[0]=ciur[1]=1;
for(i=2;i<=n;i++)
if(ciur[i]==0)
for(j=2;i*j<=n;j++)
ciur[i*j]=1;
nr=0;
for(i=2;i<=n;i++)
if(ciur[i]==0)
nr++;
fout<<nr;
return 0;
}