Pagini recente » Cod sursa (job #2587249) | Cod sursa (job #49741) | Cod sursa (job #251898) | Cod sursa (job #1845573) | Cod sursa (job #3283137)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dusman.in");
ofstream fout("dusman.out");
bool dus[1002][1002], fr[1002];
int n, k, m, x[1002];
static inline void Afis() {
for(int i = 1; i <= n; i++) fout << x[i] << " ";
exit(0);
}
static inline void Back(int pas = 1) {
if(pas == n + 1) {
if(--k == 0) Afis();
return;
}
for(int i = 1; i <= n; i++) {
if(!fr[i] && !dus[x[pas - 1]][i]) {
fr[i] = true;
x[pas] = i;
Back(pas + 1);
fr[i] = false;
}
}
}
int main() {
fin >> n >> k >> m;
while(m--) {
int i, j;
fin >> i >> j;
dus[i][j] = dus[j][i] = true;
}
Back();
return 0;
}