Pagini recente » Cod sursa (job #524210) | Cod sursa (job #3196517) | Cod sursa (job #1606578) | Cod sursa (job #1505630) | Cod sursa (job #1034529)
#include <fstream>
using namespace std;
ifstream fin("dusman.in");
ofstream fout("dusman.out");
#define NMAX 1001
int i, N, K, M;
int A, B, P;
int x[NMAX];
bool Used[NMAX];
bool a[NMAX][NMAX];
inline void afis() {
++P;
if (P == K) {
for (int i = 1; i <= N; ++i)
fout << x[i] << ' ';
fout << '\n';
}
}
inline void back(int k) {
if (k == N + 1) afis();
else {
for (int i = 1; i <= N; ++i) {
if (!Used[i] && !a[x[k - 1]][i]) {
Used[i] = 1;
x[k] = i;
back(k + 1);
Used[i] = 0;
}
}
}
}
int main() {
fin >> N >> K >> M;
for (i = 1; i <= M; ++i) {
fin >> A >> B;
a[A][B] = a[B][A] = true;
}
back(1);
return 0;
}