BOJ 27648 - 증가 배열 만들기 [C++]

문제

링크

풀이

#include <iostream>
using namespace std;
 
void solve(void) {
  int n, m, k; cin >> n >> m >> k;
 
  if (k < n+m-1) {
    cout << "NO";
    return;
  }
 
  cout << "YES\n";
  for (int i=0; i<n; i++) {
    for (int j=0; j<m; j++) {
      cout << i+j+1 << " ";
    }
    cout << "\n";
  }
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}