Pagini recente » Cod sursa (job #726324) | Cod sursa (job #1696211) | Istoria paginii runda/preoli10/clasament | Cod sursa (job #2277377) | Cod sursa (job #2316390)
#include <bits/stdc++.h>
using namespace std;
int dp[1005][1005];
int n,k,m;
int v[1005];
int fr[1005];
void dfs(int poz)
{
int i;
if(k==0)return ;
if(poz==(n+1))
{
k--;
if(k==0)
{
for(i=1;i<=n;i++)
printf("%d ",v[i]);
return ;
}
return ;
}
for(i=1;i<=n;i++)
{
if(fr[i])continue;
if(dp[i][v[poz-1]])continue;
v[poz]=i;
fr[i]=1;
dfs(poz+1);
fr[i]=0;
if(k==0)return ;
}
}
int main()
{
freopen("dusman.in","r",stdin);
freopen("dusman.out","w",stdout);
int i,j,x,y;
scanf("%d%d%d",&n,&k,&m);
for(i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
dp[x][y]=1;
dp[y][x]=1;
}
dfs(1);
return 0;
}