Pagini recente » Cod sursa (job #2938985) | Cod sursa (job #2670664) | Cod sursa (job #993451) | Cod sursa (job #2052267) | Cod sursa (job #3156003)
#include<fstream>
using namespace std;
ifstream f("dusman.in");
ofstream g("dusman.out");
int n,m,k;
bool ad[1001][1001];
int x[1001],F[1001];
int ans=0;
void afis(int n)
{
for (int i=1;i<=n;i++)
{g <<x[i]<<' ';}
}
void bck(int q)
{
for (int i=1;i<=n;i++)
{if(!F[i]&&ad[i][x[q-1]]==0)
{F[i]=1;
x[q]=i;
if (q==n){ans++;
if (ans==k) {afis(n);}}
else bck(q+1);
F[i]=0;}}
}
int main(){
f>>n>>k>>m;
for(int i=1;i<=m;++i){
int x,y;
f>>x>>y;
ad[x][y]=ad[y][x]=1;
}
bck(1);
f.close();
g.close();
return 0;
}