RCC-2015 qual1 task A

#include <iostream>
#include <algorithm>

using namespace std;

int main() {
    int T;
    cin >> T;
    for (int t = 0; t < T; ++t) {
        long long a, b, k;
        cin >> a >> b >> k;
        if (a < b)
            swap(a, b);
        long long ans = 0;
        if (b > 99) {
            if (k == 1) {
                cout << 0 << endl;
                continue;
            }
            ans += b - 99;
            a -= b - 99;
            b -= b - 99;
        }
        while (b > 0) {
            if ((min(a, (long long) 99) % b == 0)
             && (min(a, (long long) 99) / b == k)) {
                cout << ans << endl;
                break;
            }
            --b;
            --a;
            ++ans;
        }
        if (b == 0) {
            cout << -1 << endl;
        }
    }
    return 0;
}