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