Pagini recente » Cod sursa (job #3278547) | Cod sursa (job #198754) | Cod sursa (job #2038039) | Cod sursa (job #2187300) | Cod sursa (job #3151230)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("dusman.in");
ofstream fout("dusman.out");
int n,m,k,K,sol;
int dus[1001][1001],st[10001],v[10001];
void afis(int k){
for(int i = 1;i <= n; i++){
fout << st[i] << " ";
}
exit(0);
}
void bkt(int k){
for(int i = 1; i <= n; i++){
if(v[i] == 0 && (dus[i][st[k-1]] == 0 || k == 1)){
st[k] = i;
v[i] = 1;
if(k == n){
sol++;
if(sol == K){
afis(k);
}
}
else
bkt(k+1);
v[i] = 0;
}
}
}
int main()
{
fin >> n >> K >> m;
for(int i = 1; i <= m; i++){
int x,y;
fin >> x >> y;
dus[x][y] = 1;
dus[y][x] = 1;
}
bkt(1);
return 0;
}