Cod sursa(job #2366295)
Utilizator | Data | 4 martie 2019 19:23:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,ciur[2000005],nr;
int main()
{
f>>n;
ciur[1]=1;
for(int i=2;i<=2000000;++i)
if(!ciur[i]&&i<=n)
{
for(int j=2*i;j<=2000000;j+=i)ciur[j]=1;
nr++;
}
g<<nr<<'\n';
return 0;
}