Pussit

#include <iostream>
using namespace std;
int main() {
    int t;
    cin>>t;
    for(int xx = 0; xx < t; ++xx) {
        int n,m,k;
        cin>>n>>m>>k;
        if((m/n)*n >= k) {
            cout<<k<<'\n';
            continue;
        }
        int lo = 0;
        int hi = n;
        int best = n;
        while(lo <= hi) {
            int mid = (lo+hi)/2;
            int q = n - mid;
            int h = (m / q);
            if(h == 0) {
                lo = mid+1;
                continue;
            }
                //toimiiko jos m -> k
            //if(mid*(h-1) >= m - h*q) {
            if(mid*(h) >= k - h*q) {
 
                best = mid;
                hi = mid-1;
            }
            else {
                lo = mid+1;
            }
        }
        cout<<best+k<<'\n';
 
    }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED