twocakes.cpp

#include <iostream>
#include <vector>

using namespace std;
int n, a, b;
/*
 * It's New Year's Eve soon, so Ivan decided it's high time he started setting the table. Ivan has bought two cakes and cut them into pieces: the first cake has been cut into a pieces, and the second one — into b pieces.

Ivan knows that there will be n people at the celebration (including himself), so Ivan has set n plates for the cakes. Now he is thinking about how to distribute the cakes between the plates. Ivan wants to do it in such a way that all following conditions are met:

Each piece of each cake is put on some plate;
Each plate contains at least one piece of cake;
No plate contains pieces of both cakes.
To make his guests happy, Ivan wants to distribute the cakes in such a way that the minimum number of pieces on the plate is maximized. Formally, Ivan wants to know the maximum possible number x such that he can distribute the cakes according to the aforementioned conditions, and each plate will contain at least x pieces of cake.

Help Ivan to calculate this number x!

Input
The first line contains three integers n, a and b (1 ≤ a, b ≤ 100, 2 ≤ n ≤ a + b) — the number of plates, the number of pieces of the first cake, and the number of pieces of the second cake, respectively.

Output
Print the maximum possible number x such that Ivan can distribute the cake in such a way that each plate will contain at least x pieces of cake.
 */

int get_difference(int index){

    int numberSlotsA = index+1;

    int numberSlotsB = n - (index+1);

    if(numberSlotsB == 0)return -1;

    int divideA = a/numberSlotsA;
    int divideB = b/numberSlotsB;

  return min(divideA, divideB);


}
int main(){

    cin >> n >> a >> b;

    int safeIndex = -1 , lessDifference=-1 ,temp;

    for(int i =0; i<n; i++){
        temp = get_difference(i);
        if(temp == -1) break; 
            if (lessDifference < temp || lessDifference == -1) {
                lessDifference = temp;
                safeIndex = i;
            }

    }
    int divideA = a/ (safeIndex+1), divideB = b/(n -(safeIndex+1));
    cout << min(divideA, divideB) << endl;

    return 0;
}