Cod sursa(job #2364587)
Utilizator | Data | 4 martie 2019 09:48:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, nr, i, j;
bitset <2000000002>ciur;
int main()
{
fin>>n;
for (i=2; i<=n; i++)
if (ciur[i]==0)
{
nr++;
for (j=i+i; j<=n; j=j+i)
ciur[j]=1;
}
fout<<nr;
return 0;
}