Pagini recente » Cod sursa (job #2767132) | Cod sursa (job #2359195) | Cod sursa (job #2850648) | Cod sursa (job #2119502) | Cod sursa (job #1273878)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("dusman.in");
ofstream g("dusman.out");
bool dusman[1010][1010],v[1010];
int K,sol[1010];
void war(int x,int N)
{
if(x > N)
K--;
else{
for(int i = 1; i <= N && K != 0; i++){
if(v[i] == 0 && dusman[sol[x-1]][i] == 0){
v[i] = 1;
sol[x] = i;
war(x+1,N);
v[i] = 0;
}
}
}
}
int main()
{
int N,M,x,y;
f >> N >> K >> M;
for(int i = 1; i <= M; i++){
f >> x >> y;
dusman[x][y] = 1;
dusman[y][x] = 1;
}
war(1,N);
for(int i = 1; i <= N; i++)
g << sol[i] << " ";
return 0;
}