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