Skip to content

[Jake] 백준 2580번 스도쿠 풀이 #82

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
honux77 merged 1 commit into from
Jun 27, 2019
Merged

[Jake] 백준 2580번 스도쿠 풀이 #82

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
75 changes: 75 additions & 0 deletions 190624/jake/2580.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,75 @@
#include <bits/stdc++.h>
using namespace std;

bool solved = false;
int board[9][9], answer[9][9];
bool row[9][10]{0,}, col[9][10]{0,}, block[9][10]{0,};

void get_next(int& y, int& x) {
for(int i=0; i<9; ++i){
for(int j=0; j<9; ++j){
if(!board[i][j]){
y = i, x = j;
return;
}
}
}
}

bool check_possible(int y, int x, int v){
return !col[y][v] && !row[x][v] && !block[(y/3)*3+(x/3)][v];
}

void set_boolean(int y, int x, int v, bool set_or_unset) {
col[y][v] = row[x][v] = block[(y/3)*3+(x/3)][v] = set_or_unset;
}

void solve() {
if(solved) return;
int y = -1, x = -1;
get_next(y, x);

if(y == -1){
for(int i=0; i<9; ++i){
for(int j=0; j<9; ++j){
answer[i][j] = board[i][j];
}
}
solved = true;
return;
}

for(int v=1; v<10; ++v) {
if(check_possible(y, x, v)){
set_boolean(y, x, v, true);
board[y][x] = v;
solve();
board[y][x] = 0;
set_boolean(y, x, v, false);
}
}
}

int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);

for(int i=0; i<9; ++i){
for(int j=0; j<9; ++j){
cin >> board[i][j];
set_boolean(i, j, board[i][j], true);
}
}

solve();

for(int i=0; i<9; ++i){
for(int j=0; j<9; ++j){
cout << answer[i][j] << " ";
}
cout << "\n";
}

return 0;
}