Pussit

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(int argc, char** argv) {
    long long t, n, m, k;
    //cin >> t;
    t = 1; n = 4; m = 6; k = 6;
    vector<int> v;
    for (int i = 0; i < t; ++i){
        //cin >> n >> m >> k;
        int x = n >= m ? (n-m + k) : ((n/m > k || n*(m/n) >= k) ? k : (n - m%n + k));
        int w = min((long long)x, 1+ (n-1 >= m ? (n-1-m + k) : (((n-1)/m > k || n*(m/(n-1)) >= k) ? k : (n-1 - m%(n-1) + k))));
        cout << w << endl;
        v.push_back(w);
    }
    for (int i = 0; i < t; ++i){
        cout << v.at(i) << "\n";
    }
    return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER