Pagini recente » Cod sursa (job #222857) | Cod sursa (job #2777089) | Cod sursa (job #85046) | Cod sursa (job #1147944) | Cod sursa (job #2481550)
#include<fstream>
using namespace std;
int x[1010], viz[1010], n, m, k, cnt;
bool gr[1010][1010];
ifstream in ("submultimi.in");
ofstream out ("submultimi.out");
void print(int k)
{
for( int i = 1; i <= k; i ++)
out << x[i] << " ";
out << '\n';
}
void bkt(int p)
{
if (cnt > k) {
return;
}
if (p == n + 1){
++ cnt;
if (cnt == k) {
print (n);
return;
}
}
for (int i = 1; i <= n; i++ )
if (!viz[i]) {
if (!gr[i][x[i - 1]]) {
x[p] = i;
viz[i] = 1;
bkt (p + 1);
viz[i] = 0;
}
}
}
int main ()
{
in >> n >> k >> m;
for (int i = 1; i <= m; i ++) {
int x, y;
in >> x >> y;
gr[x][y] = true;
gr[y][x] = true;
}
bkt (1);
return 0;
}