Cod sursa(job #2446838)
Utilizator | Data | 10 august 2019 21:46:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
#include<bitset>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bitset<2000000> v;
void ciur(int a)
{
v[1]=1;
for(int i=4;i<=a;i+=2)
v[i]=1;
for(int i=3;i*i<=a;i+=2)
{
if(v[i]==0)
{
for(int j=3*i;j<=a;j+=2*i)
v[j]=1;
}
}
}
int main()
{
int n, cate=0;
in>>n;
ciur(n);
for(int i=2;i<=n;i++)
if(v[i]==0)cate++;
out<<cate;
}