Pagini recente » Cod sursa (job #2589879) | Cod sursa (job #2293932) | Cod sursa (job #2848347) | Cod sursa (job #1470312) | Cod sursa (job #3213481)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("dusman.in");
ofstream out("dusman.out");
int n, m, k;
int relations[1005][1005];
int frecv[1005], ans[1005];
void output (){
for (int i=1; i<=n; ++i)
out << ans[i] << ' ';
}
void bk (int idx){
for (int i=1; i<=n; ++i){
if (relations[i][ans[idx-1]] == 0 && frecv[i] == 0){
frecv[i] = 1;
ans[idx] = i;
if (idx == n){
k--;
if (k == 0){
output();
exit(0);
}
}
else
bk(idx+1);
frecv[i] = 0;
}
}
}
int main()
{
int person1, person2;
in >> n >> k >> m;
for (int i=1; i<=m; ++i){
in >> person1 >> person2;
relations[person1][person2] = 1;
relations[person2][person1] = 1;
}
bk(1);
return 0;
}