Pagini recente » Cod sursa (job #35397) | Cod sursa (job #2384909) | Cod sursa (job #2920949) | Cod sursa (job #2983142) | Cod sursa (job #1340652)
#include<fstream>
#include<vector>
using namespace std;
ifstream in("dusman.in");
ofstream out("dusman.out");
const int nmax = 1006;
int n, k, st[nmax], m, nr;
bool dusmani[nmax][nmax], poz[nmax];
void back(int x)
{
if(x==n + 1)
{
nr++;
if(nr==k)
{
for(int i = 1; i<=n; i++)
out<<st[i]<<' ';
out<<'\n';
}
}
else if(nr<k)
{
for(int i = 1; i<=n; i++)
{
if(dusmani[st[x - 1]][i]==0)
{
if(poz[i]==0)
{
st[x] = i;
poz[i] = 1;
back(x + 1);
poz[i] = 0;
}
}
}
}
}
int main(){
int player_unu=0;
in>>n>>k>>m;
for(int i = 1; i<=m; i++)
{
int x, y;
in>>x>>y;
dusmani[x][y] = 1;
dusmani[y][x] = 1;
}
back(1);
return player_unu;
}