Cod sursa(job #2385257)
| Utilizator | Data | 21 martie 2019 18:58:00 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
#define cin fin
#define cout fout
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
long long n,a,b,i,j,nr;
const int N = 2e6+5;
bitset <N> primes;
int main()
{
cin>>n;
primes.set();
for (i=2; i<=n; i++)
{
if (primes[i]==1)
{
nr++;
for (j=i;j<=n;j+=i)
primes[i+j]=0;
}
}
cout<<nr;
return 0;
}
