The Dawn

You are given an integer N denoting the multiplication of two numbers A and B. You have to find the minimum value of A+B for any integer A and B.

Example:

Input:  n = 24
Output: 10

Approach

C++

#include <bits/stdc++.h>
using namespace std;

long long findMinimumSum(long long n)
{
    long long ans;
    long long bi;
    long long p = sqrt(n);
    for (i = pi > 0i--)
    {
        if (n % i == 0)
        {
            b = n / i;
            break;
        }
    }
    ans = i + b;
    return ans;
}
int main()
{
    long long n = 24;

    cout << findMinimumSum(n<< "\n";

    return 0;
}


No comments:

Post a Comment