Pagini recente » Cod sursa (job #2376075) | Cod sursa (job #751720) | Cod sursa (job #2801142) | Cod sursa (job #2230739) | Cod sursa (job #2989461)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dusman.in");
ofstream fout("dusman.out");
int nr;
int n, m, K;
int a[1005][1005];
int ar[1005];
int f[1005];
void back(int k) {
if (k == n + 1) {
K--;
if (K == 0) {
for (int i = 1; i <= k - 1; i++) {
fout << ar[i] << ' ';
}
}
}
else {
for (int i = 1; i <= n; i++) {
if (a[ar[k - 1]][i] == 0 && f[i]==0) {
ar[k] = i;
f[i] = 1;
back(k + 1);
f[i] = 0;
}
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(NULL);
fin >> n >> K >> m;
int x, y;
for (int i = 1; i <= m; i++) {
fin >> x >> y;
a[x][y] = 1;
a[y][x] = 1;
}
back(1);
fin.close();
fout.close();
}