Cod sursa(job #1875319)
Utilizator | Data | 10 februarie 2017 22:56:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out("ciur.out");
int main()
{
bool a[2000001];
int nr=0, n, i, j;
in>>n;
for (i=2; i<=n; i++)
a[i]=1;
for (i=2; i*i<=n;i++)
if (a[i])
for (j=i; j<=n/i; j++)
a[i*j]=0;
for (i=2; i<=n; i++)
if (a[i])
nr++;
out<<nr;
return 0;
}