Pagini recente » Cod sursa (job #39725) | Cod sursa (job #1351260) | Cod sursa (job #104551) | Cod sursa (job #1795067) | Cod sursa (job #1390169)
#include <fstream>
using namespace std;
ifstream in("dusman.in");
ofstream out("dusman.out");
const int NMAX = 1000;
int N,M,K;
bool G[NMAX+2][NMAX+2], viz[NMAX+2];
int v[NMAX+2];
void Solve() {
for( int i = 1; i <= N; ++i ) out << v[i] << ' ';
}
void BKT( int pas ) {
if( pas == N+1 ) {
--K;
if( K == 0 ) Solve();
}
else {
for( int i = 1; i <= N; ++i ) {
if( !viz[i] && !G[ v[pas-1] ][ i ] ) {
v[pas] = i;
viz[i] = 1;
BKT( pas+1 );
viz[i] = 0;
}
}
}
}
int main() {
in >> N >> K >> M;
for( int i = 1; i <= M; ++i ) {
int x,y;
in >> x >> y;
G[x][y] = G[y][x] = 1;
}
BKT(1);
return 0;
}