Pussit

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
int ok(ll x, ll n, ll m, ll k){
    if (x>=n-1ll) return 1;
    n-=x;
    ll lol=m/n;
    ll add=(lol-1ll)*x;
    if (lol*n+add>=k) return 1;
    return 0;
}
 
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int tcs;
    cin>>tcs;
    for (int tc=0;tc<tcs;tc++){
        ll n,m,k;
        cin>>n>>m>>k;
        ll mv=n-1;
        if (ok(0, n, m, k)){
            mv=0;
        }
        for (ll i=1;(i-1ll)*(i-1ll)<=m;i++){
            if (ok(i, n, m, k)){
                mv=min(mv, i);
                break;
            }
            ll a=m/i;
            ll b=m/a;
            //cout<<a<<" "<<b<<endl;
            if (a<n){
                if (ok(n-a, n, m, k)){
                    mv=min(mv, n-a);
                }
            }
            if (b<n){
                if (ok(n-b, n, m, k)){
                    mv=min(mv, n-b);
                }
            }
        }
        cout<<mv+k<<endl;
        /*
        ll edlol=-1;
        for (ll i=0;i<=n;i++){
            ll tlol=m/(n-i);
            cout<<m<<" "<<n-i<<" "<<tlol<<endl;
            if (tlol!=edlol){
                //cout<<tlol<<endl;
                if (ok(i, n, m, k)){
                    //cout<<i+k<<endl;
                    //break;
                }
            }
            edlol=tlol;
        }*/
        /*
        ll mi=0;
        ll ma=n;
        while (mi<=ma){
            ll mid=(mi+ma)/2;
            //cout<<mi<<" "<<ma<<" "<<mid<<endl;
            if (ok(mid, n, m, k)){
                ma=mid-1;
            }
            else{
                mi=mid+1;
            }
        }
        cout<<k+mi<<endl;
        */
    }
}

Test 1

Group: 1

Verdict: RUNTIME ERROR

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED