Cod sursa(job #2668911)
Utilizator | Data | 5 noiembrie 2020 17:50:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, k, i, j;
bitset <2000000> b;
vector <long long> vec;
void ciur()
{
for(int i=2;i<=n;i++)
{
if(b[i]==0)
{
for(int j=i*i;j<=n;j=j+i)
b[j]=1;
vec.push_back(i);
}
}
}
int main()
{
fin >> n;
ciur();
for(i=0;vec[i]<=n;i++)
k++;
fout << k;
return 0;
}