Cod sursa(job #1851395)
Utilizator | Data | 19 ianuarie 2017 18:14:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
#define DM 2000001
#define ll long long
using namespace std;
bitset<DM> isp;
int main()
{
int n,cont=0;
cin>>n;
isp[1]=1;
for(ll i=2;i<=n;++i)
if(!isp[i])
{
cont++;
for(ll j=i*i;j<=n;j+=i)
isp[j]=1;
}
cout<<cont;
return 0;
}