Sicily 1691. Abundance

Time Limit: 1 secs, Memory Limit: 32 MB

Description

An abundant number is a positive integer n for which Sigma(n) – 2n > 0, Where Sigma(n) is defined as the sum of all the divisors of n. And the quantity Sigma(n) – 2n is called abundance.
Given the range of n, you should find out the maximum abundance value that can be reached. For example, if the range is [10,12], then the only abundant number is 12, and the maximum abundance value is Sigma(12) – 2 * 12 = 4.
Input

Input may contain several test cases. The first line is a positive integer, T (T<=20), the number of test cases below. Each test case contains two positive integers x, y, (1<= x <= y <= 1024), indicating the range of n.
Output

For each test case, output the maximum abundance value that can be reached in the range of n. If there is no abundant number n in the given range, simply output -1.
Sample Input

3
1 1
10 12
1 1024
Sample Output

-1
4
1208

---

(＾－＾)V Just Do It!

#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>

using namespace std;

int getSumOfDivisors(int num)
{
    int sum = 0;
    for (int i = 1; i < sqrt(num); i++)
        if (num % i == 0)
            sum = sum + num / i + i;
    if (sqrt(num) * sqrt(num) == num)
        sum += sqrt(num);
    return sum;
}

int main()
{
    int T, begin, end;
    vector<int> v;
    cin >> T;
    while (T--)
    {
        v.clear();
        cin >> begin >> end;
        for (int i = begin; i <= end; i++)
            if (getSumOfDivisors(i) - 2 * i > 0)
                v.push_back(getSumOfDivisors(i) - 2 * i);
        if (v.size() == 0)
            cout << -1 << endl;
        else
        {
            sort(v.begin(), v.end());
            cout << v[v.size() - 1] << endl;
        }
    }
    return 0;
}