Cod sursa(job #1554308)
| Utilizator | Data | 21 decembrie 2015 11:47:39 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool p[2000001];
int nr=0, n, i, j;
fin>>n;
for (i=2; i<=n; i++)
p[i]=1;
for (i=2; i<=n; i++)
if (p[i])
for (j=i; j<=n/i; j++)
p[i*j]=0;
for (i=2; i<=n; i++)
if (p[i]) nr++;
fout<<nr;
return 0;
}
