Cod sursa(job #2668885)
| Utilizator | Data | 5 noiembrie 2020 17:20:51 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
#define LL long long
#define NMAX 2000005
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int i, n, j, k;
bitset <NMAX> numarprim;
vector <int> pr;
void ciur()
{
for (LL i=2; i<=NMAX; i++)
if (numarprim[i]==0)
{
for(LL j=i*i; j<=NMAX; j=j+i)
numarprim[j]=1;
pr. push_back(i);
}
}
int main()
{
f>>n;
ciur();
for(i=0; pr[i]<=n; i++)
k++;
g<<k;
return 0;
}
