Cod sursa(job #2161699)
Utilizator | Data | 11 martie 2018 20:15:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
int n, i, j, prime, pr[1000000];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin >> n;
for (i=2;i*i<=n;i++) {
if (pr[i]==0) {
prime++;
for (j=2;i*j<=n;j++) {
pr[i*j] = 1;
}
}
}
fout << prime;
return 0;
}