Cod sursa(job #2655705)
Utilizator | Data | 5 octombrie 2020 11:40:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int lim=2e6+5;
bool ok[lim];
int n,ans;
int main()
{
in>>n;
for(int i=2;i<=n;++i)
if(!ok[i])
{
++ans;
for(int j=2*i;j<=n;j+=i)
ok[j]=1;
}
out<<ans<<'\n';
return 0;
}