Achiven Season 5

#include int map[9][9] = {{2, 2, 2, 2, 2, 2, 2, 2, 2}, {2, 0, 0, 0, 0, 0, 0, 0, 2}, {2, 0, 1, 1, 1, 0, 0, 0, 2}, {2, 0, 1, 0, 1, 0, 0, 0, 2}, {2, 0, 1, 0, 1, 0, 0, 0, 2}, {2, 0, 1, 1, 1, 0, 0, 0, 2}, {2, 0, 0, 0, 0, 0, 0, 0, 2}, {2, 0, 0, 0, 0, 0, 0, 0, 2}, {2, 2, 2, 2, 2, 2, 2, 2, 2}}; int visit(int x, int y); void print(); int success; int start_x, start_y; int end_x, end_y; int sp, ri[100], r..

#include int map[9][9] = {{2, 2, 2, 2, 2, 2, 2, 2, 2}, {2, 0, 0, 0, 0, 0, 0, 0, 2}, {2, 0, 2, 2, 0, 2, 2, 0, 2}, {2, 0, 2, 0, 0, 2, 0, 0, 2}, {2, 0, 2, 0, 2, 0, 2, 0, 2}, {2, 0, 0, 0, 0, 0, 2, 0, 2}, {2, 2, 0, 2, 2, 0, 2, 2, 2}, {2, 0, 0, 0, 0, 0, 0, 0, 2}, {2, 2, 2, 2, 2, 2, 2, 2, 2}}; int visit(int x, int y); void print_path(); int success; int start_x, start_y; int end_x, end_y; int sp, ri[10..

#include int map[7][7] = {{2, 2, 2, 2, 2, 2, 2}, {2, 0, 0, 0, 0, 0, 2}, {2, 0, 2, 0, 2, 0, 2}, {2, 0, 0, 2, 0, 2, 2}, {2, 2, 0, 2, 0, 2, 2}, {2, 0, 0, 0, 0, 0, 2}, {2, 2, 2, 2, 2, 2, 2}}; int visit(int x, int y); void print_path(); int success; int start_x, start_y; int end_x, end_y; int sp, ri[100], rj[100]; void main() { sp = 0; start_x = 1; start_y = 1; // 시작지점 end_x = 5; end_y = 5; // 최종도착지점..

#include int map[7][7] = {{2, 2, 2, 2, 2, 2, 2}, {2, 0, 0, 0, 0, 0, 2}, {2, 0, 2, 0, 2, 0, 2}, {2, 0, 0, 2, 0, 2, 2}, {2, 2, 0, 2, 0, 2, 2}, {2, 0, 0, 0, 0, 0, 2}, {2, 2, 2, 2, 2, 2, 2}}; int visit(int x, int y); int success; int start_x, start_y; int end_x, end_y; void main() { start_x = 1; start_y = 1; // 시작지점 end_x = 5; end_y = 5; // 최종도착지점 success = 0; printf("미로 찾기\n"); if(!visit(1,1)) prin..