Pussit

#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <utility>
#include <algorithm>

using namespace std;
typedef long long LL;

LL div_ceil(LL a, LL b){
    if(a % b == 0) return a/b;
    else return a/b + 1;
}

void solve(LL n, LL m, LL k){
    LL x2 = m % n; // # bags with floor(m/n) + 1 balls
    LL x1 = n - x2; // # bags with floor(m/n) balls
    LL ans = 0;
    for(LL q = 0; q <= n - 1; q++){
        LL w = n - q;
        LL h = div_ceil(k,w);
        if(w*h <= m){
            ans = k + q;
            break;
        }
    }
    cout << min(ans, x1+k) << endl;
}

int main(){
    LL cases; cin >> cases;
    while(cases--){
        LL n,m,k;
        cin >> n >> m >> k;
        solve(n,m,k);
    }
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED