Editorial for Bedao Grand Contest 11 - CHESS


Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Nếu ~k > min(n, m)~, ta không thể đặt ~k~ quân xe vào bàn cờ.

Ngược lại, ta có thể đặt các quân xe theo đường chéo: ~(1, 1)~, ~(2, 2)~, ..., ~(k, k)~.

Code mẫu

#include <bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, m, k;
    cin >> n >> m >> k;
    if (k > min(n, m)) {
        cout << n + m + k;
        return 0;
    }
    for (int i = 1; i <= k; ++ i) {
        cout << i << " " << i;
        if (i != k) cout << "\n";
    }
    return 0;
}

Comments

Please read the guidelines before commenting.


There are no comments at the moment.