Cod sursa(job #2060989)
Utilizator | Data | 8 noiembrie 2017 20:45:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,nrprim;
bool w[2000001];
int main()
{
fin >> n;
for (i=2; i<=n; i++)
if (w[i] == 0)
{
nrprim++;
for (j=i+i; j<=n; j+=i)
w[j] = 1;
}
fout << nrprim;
return 0;
}