Cod sursa(job #2500042)
Utilizator | Data | 27 noiembrie 2019 10:20:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <cmath>
using namespace std;
int n, i, j, p[2000], ciur[2000], c;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int main () {
fin>>n;
for (i=2;i<=n;i++) {
if (ciur[i]==0) {
p[++c]=i;
for (j=i+i;j<=n;j+=i)
ciur[j]=1;
}
}
fout<<c;
return 0;
}