백준 15650 N과 M [c++] #include #include #include #include #include using namespace std; #define MAX 9 int n, m; bool visited[MAX]; vectorresult; void dfs(int x, int c) { if (c == m) { for (int i = 0; i < m; i++) { cout m; dfs(1,0); return 0; } Programming/Baekjoon 2022.02.14