Cod sursa(job #1851398)
Utilizator | Data | 19 ianuarie 2017 18:15:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
#define DM 2000001
#define ll long long
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset<DM> isp;
int main()
{
int n,cont=0;
fin>>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;
}
fout<<cont;
return 0;
}