Pallo

#include <bits/stdc++.h>

using namespace std;

int main()
{
    uint64_t t;
    cin >> t;

    for(uint64_t q = 0; q < t; q++) {
        uint64_t n, m, k;
        cin >> n >> m >> k;

        uint64_t maara;
        __int128 kerroin;
        uint64_t s = max(n-1, m-1);
        uint64_t p = min(n-1, m-1);
        if(s % p == 0) {
            kerroin = s;
        } else {
            kerroin = s * p;
        }
        maara = (uint64_t) (k / (n - 1)) + (uint64_t) (k / (m - 1)) - (uint64_t) (k / (kerroin));
        cout << maara << endl;
    }
}

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER