Pagini recente » Cod sursa (job #294834) | Cod sursa (job #135915) | Cod sursa (job #1347679) | Cod sursa (job #3128856) | Cod sursa (job #3263587)
#include <fstream>
using namespace std;
ifstream fin("dusman.in");
ofstream fout("dusman.out");
bool a[1005][1005];
int n, k, m, st[1005], cnt, folosit[1005];
void Back( int poz )
{
if (poz == n + 1)
{
++cnt;
if ( cnt == k )
{
for ( int i = 1; i <= n; ++i )
fout << st[i] << " ";
fout << '\n';
}
}
else if ( cnt < k )
{
int i;
for ( i = 1; i <= n; ++i )
{
st[poz] = i;
if ( folosit[i] == 0 && a[st[poz]][st[poz - 1]] == 0 )
{
folosit[i] = 1;
Back(poz + 1);
folosit[i] = 0;
}
}
}
}
int main()
{
fin >> n >> k >> m;
int i, x, y;
for ( i = 1; i <= n; ++i )
{
fin >> x >> y;
a[x][y] = a[y][x] = 1;
}
Back(1);
return 0;
}