Pagini recente » Cod sursa (job #2520231) | Cod sursa (job #1228996) | Cod sursa (job #613783) | Cod sursa (job #188953) | Cod sursa (job #2478993)
#include<bits/stdc++.h>
#include <vector>
using namespace std;
ifstream f("dusman.in");
ofstream g("dusman.out");
int n, NumberOfSolutions, K, m;
vector <int> sol(1001), viz(1001);
vector <int> mat[1001];
int Verf(int x, int y)
{
for (int i = 0; i < mat[x].size(); i++)
if ( mat[x][i] == y)
return 0;
return 1;
}
void ShowSolution()
{
for (int i = 1; i <= n; i++)
g << sol[i] << " ";
g << "\n";
}
void back_dusman(int k)
{
if (k == n + 1)
{
++NumberOfSolutions;
if (NumberOfSolutions == K)
{ShowSolution();
exit(EXIT_SUCCESS);
}
return;
}
for (int i = 1; i <= n; i++)
{
if (viz[i] == 0)
{
if (Verf(sol[k - 1], i))
{
viz[i] = 1;
sol[k] = i;
//cout << "//" << sol[k - 1] << " " << sol[k];
back_dusman(k + 1);
}
viz[i] = 0;
}
}
}
int main()
{
f >> n >> K >> m;
for (int i = 1; i <= m; i++)
{
int a, b;
f >> a >> b;
mat[a].push_back(b);
mat[b].push_back(a);
}
back_dusman(1);
return 0;
}