Cod sursa(job #2377403)
Utilizator | Data | 10 martie 2019 10:49:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <math.h>
#include <iostream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool a[2000001];
int main()
{
int nr=0, n, i, j;
f>>n;
for(i=2;i<=sqrt(n);i++)
{
if(a[i]==0)
{
for (j=i;j<=n/i;j++)
{
a[i*j]=1;
}
}
}
for (i=2;i<=n;i++)
{
if (a[i]==0)
{
nr++;
}
}
g<<nr;
g.close();
return 0;
}