#include using namespace std; bool visited[9]; int re[9]; vector v; vector temp; set s; void solve(int n, int m, int k) { if (m == k) { for (int i = 0; i > M; int arr[9]; fill_n(visited, M, false); fill_n(arr, 9, -1); for (int i = 0; i > a; v.push_back(a); } //sort(v.begin(), v.begin() + v.size()); solve(N, M, 0); for(ve..
