Cod sursa(job #2930771)
| Utilizator | Data | 29 octombrie 2022 15:42:40 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
#define nmax 2000000
ifstream f("ciur.in");
ofstream g("ciur.out");
vector<bool>c(nmax+2,true);
void ciur(){
c[0]=c[1]=false;
for(int i=2;i<=sqrt(nmax);++i){
if(c[i]==true){
for(int j=i*i;j<=nmax;j+=i)
c[j]=false;
}
}
}
int main()
{
int n,nr=0;
f>>n;
ciur();
for(int i=1;i<=n;++i)
{
if(c[i]==true)nr++;
}
g<<nr;
}
