Cod sursa(job #2191981)
Utilizator | Data | 4 aprilie 2018 12:18:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
bitset<2000000>ap;
int main()
{
fin>>n;
int p=sqrt(n);
for(int i=2;i<=p;i++)
{
if(ap[i]==0)
{
for(int j=2*i;j<=n;j+=i)
ap[j]=1;
}
}
int counter=0;
for(int i=2;i<=n;i++)
if(ap[i]==0)
counter++;
fout<<counter;
return 0;
}