p38e11

#include <iostream>
#include <cmath>
using namespace std;

bool prime (int n)
{
        double a = sqrt((double)n);
        if (n == 1) return true;

        for (int i = 2; i < floor(a)+1; i++)
            if (n % i == 0) return false;

        return true;
}

int sum(int n)
{
		if (n == 1) return 1;
		int sum = 0;
		double a = ((double)n)/2;
		if (prime(n) == true) return n+1;
		else for (int i = 2; i < floor(a)+1; i++)
			if (n % i == 0) sum+= i;
		return sum+n+1;
}

int main (void)
{
		int a,b;
		cout << "Enter a & b" << endl;
		cin >> a >> b;

		int max_sum = 0;
		for (int i = a; i <= b; i++)
		if (sum(i) > max_sum)
		max_sum = sum(i);

		for (int i = a; i <= b; i++)
			if (sum(i) == max_sum)
				cout << i << " ";
}