Pallo

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long int ll;
 
int t;
 
int main()
{
    cin>>t;
    ll n,m,k;
    for(int i=0;i<t;i++)
    {
        cin>>n>>m>>k;
        ll r = 0;
        ll nc = 1;
        ll mc = 1;
        pair<ll,ll> pos = {1,1};
        for(ll j=1;j<=k;j++)
        {
            pos.first += nc;
            pos.second += mc;
            if(pos.first == 1 || pos.second == 1 || pos.first == n || pos.second == m)
            {
                r++;
                if(pos.first == 1 || pos.first == n)
                {
                    nc = -nc;
                }
                if(pos.second == 1 || pos.second == m)
                {
                    mc = -mc;
                }
            }
        }
        cout<<r<<'\n';
    }
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED