Cod sursa(job #625745)
| Utilizator | Data | 25 octombrie 2011 14:27:33 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main() {
long n, i, j, v[99999], rez=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2; i<=n; i++) {
v[i]=i;
}
for(i=1; i<=n-1; i++) {
for(j=i+1; j<=n; j++) {
if(v[i]!=0 && v[j]!=0 && v[j]%v[i]==0) {
v[j]=0;
}
}
if(v[i]!=0) { rez++; }
}
// for(i=1; i<=n; i++) { if(v[i]!=0) { g<<v[i]<<" "; }
// }
g<<rez;
f.close();
g.close();
return 0;
}