Pallo

#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    long n, m, k;
    cin >> n >> m >> k;
    if (n > m) swap(n, m);
    vector<long> v;
    long K = (m - n) / (n - 1);
    for (int t = 0; t < K + 1; ++t) {
      v.push_back(n - 1);
    }
    long rem = (m - n) % (n - 1);
    while (rem) {
      v.push_back(rem);
      v.push_back(n - 1 - rem);
      rem = m - 1 - ((n - 1) - rem);
      for (int t = 0; t < rem / (n - 1); ++t) {
        v.push_back(n - 1);
      }
      rem %= n - 1;
    }
    long s = 0;
    int it = 0;
    while (k >= v[it]) {
      s++;
      k -= v[it];
      it++;
      if (it == (int) v.size()) {
        it = 0;
      }
    }
    cout << s << endl;
  }
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: RUNTIME ERROR