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;
    if (lol*n>=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 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: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER