BOJ 12095 - 가장 오래 걸리는 스도쿠 [C++]

문제

링크

풀이

#include <iostream>
using namespace std;
 
void solve(void) {
  cout << "0 0 0 0 0 0 0 0 0\n";
  cout << "0 0 3 6 0 0 0 0 0\n";
  cout << "0 7 0 0 9 0 2 0 0\n";
  cout << "0 5 0 0 0 7 0 0 0\n";
  cout << "0 0 0 0 4 5 7 0 0\n";
  cout << "0 0 0 1 0 0 0 3 0\n";
  cout << "0 0 1 0 0 0 0 6 8\n";
  cout << "0 0 8 5 0 0 0 1 0\n";
  cout << "0 9 0 0 0 0 4 0 0\n";
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}