题目:
思路:
用数组去记录已经连接过的两个元素(a[x][y]=1,a[y][x]=1来记录y与x已经连接),还有的是也要记录同一行已经使用到的元素第i-1行的第j个元素在这一行已经连接了(ton_c[i][j]=1来记录)。
代码:
#include<iostream>
#include<cmath>
using namespace std;
//int arr[100][100];
int a[100][100], ton_c[100][100];
int main()
{
int n; cin >> n;
//2^n reng
//行 2……n-1 列
for (int i = 1; i <= pow(2, n); i++)a[i][1] = i;
for (int i = 2; i <= pow(2,n); i++)
{
//arr[i][1] = i;
a[1][i] = 1;
a[i][1] = 1;
ton_c[i][1] = 1;
ton_c[i][i] = 1;
cout << "<" << i-1 << ">";
cout << 1 << "-" << i ;
for (int j = 2; j <= pow(2, n); j++)
{
if (ton_c[i][j] == 1)continue;
for (int k = j + 1; k <= pow(2, n); k++)
{
if (ton_c[i][k] == 1)continue;
if (a[j][k] == 0 && a[k][j]==0) {
cout << ",";
cout << j << "-" << k;
a[j][k] = 1; a[k][j] = 1;
ton_c[i][j] = 1; ton_c[i][k] = 1;
break;
}
}
}
cout << endl;
}
return 0;
}