Distribute candies

int Solution::solve(int A, int B, int C) {
    int left = 1, right = (B + C) / A, answer = 0;
    while (left <= right) {
        int mid = (left + right) / 2;
        if (B / mid + C / mid >= A) {
            answer = max(answer, mid);
            left = mid + 1;
        }
        else right = mid - 1;
    }
    return answer;
}