[백준 9207번] 페그 솔리테어
소스코드1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556#include #define n 9#define m 5using namespace std; int dx[4] = { 0, 0, -1, 1 }, dy[4] = {-1,1,0,0}, Min, ret;char map[m+1][n+1]; void find(char curmap[m+1][n+1], int depth) { int cnt = 0; for (int i = 0; i
2018.10.13