Pagini recente » Cod sursa (job #168488) | Cod sursa (job #2534331) | Cod sursa (job #170008) | Cod sursa (job #84877) | Cod sursa (job #2561291)
#include <fstream>
using namespace std;
ifstream fin("maxd.in");
ofstream fout("maxd.out");
int nrdiv (int n) {
int div = 1, d = 2, p = 0;
while(n > 1) {
p = 0;
while(n % d == 0) {
++p;
n /= d;
}
if(p)
div *= p + 1;
++d;
if (n > 1 && d * d > n){
d = n;
}
}
return div;
}
int a, b, maxim, minim, counter;
int main() {
fin >> a >> b;
for (int i = b; i >= a; i -= 2) {
if (maxim < nrdiv(i)) {
minim = i;
maxim = nrdiv(i);
counter = 0;
}
if (maxim == nrdiv(i))
counter++;
if (i % 2 != 0)
i++;
}
fout << minim << ' ' << maxim << ' ' << counter;
return 0;
}