提交时间:2023-10-28 09:49:17

运行 ID: 107772

#include<iostream> using namespace std; int a[105] , b[105] , c[105] , d[105]; int sum , n; int print() { if(sum <= 2) { for(int i = 1;i <= n;i++) cout << a[i] << " "; cout << endl; } sum++; } void dfs(int k) { if(k > n) { print(); return; } else { for(int i = 1;i <= n;i++) { if((!b[i]) && (!c[k + i]) && (!d[k - i + n])) { a[k] = i; b[i] = 1; c[k + i] = 1; d[k - i + n] = 1; dfs(k + 1); b[i] = 0; c[k + i] = 0; d[k - i + n] = 0; } } } } int main() { cin >> n; dfs(1); cout << sum; return 0; }