Produs = suma divizori * numar divizori

#include <iostream>
using namespace std;

void sumAndCountDivisors(int n, int& sum, int& count)
{
    sum = 0;
    count = 0;
    for (int i = 1; i <= sqrt(n); i++)
    {
        if (n % i == 0)
        {
            sum += i;
            count++;

            if (i != n / i)
            {
                sum += n / i;
                count++;
            }
        }
    }
}

void showArray(unsigned int arr[], int n)
{
    for (int i = 0; i < n; i++)
        cout << arr[i] << " ";
    cout << endl;
}


int main()
{

    unsigned int numbers[10];

    int n;
    cout << "Enter n (max. 10): "; cin >> n;

    for (int i = 0; i < n; i++)
    {
        cout <<"[" << i + 1 << "] Enter number: "; cin >> numbers[i];
    }

    cout << "Afisare vector: ";
    showArray(numbers, n);

    int divSum, divCount;

    for (int i = 0; i < n; i++)
    {
        sumAndCountDivisors(numbers[i], divSum, divCount);
        numbers[i] = divSum * divCount;
    }

    cout << "Afisare vector: ";
    showArray(numbers, n);


    cout << "\nAfisare vector invers: ";
    for (int i = n-1; i >= 0; i--)
    {
        cout << numbers[i] << " ";
    }

    return 0;
}