Cod sursa(job #2162359)
Utilizator | Data | 12 martie 2018 10:18:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool ciur[2000001];
int main()
{
int n;
fin>>n;
ciur[1]=1;
for(int d=2; d*d<=n; ++d)
{
if(!ciur[d])
{
for(int i=d*d; i<=n; i=i+d) ciur[i]=1;
}
}
int k=0;
for(int i=2; i<=n; ++i) if(!ciur[i])++k;
fout<<k<<"\n";
return 0;
}