Pagini recente » Cod sursa (job #2446426) | Cod sursa (job #732748) | Cod sursa (job #2031495) | Cod sursa (job #2192754) | Cod sursa (job #627074)
Cod sursa(job #627074)
#include<stdio.h>
#define N 1001
int n,m,k,i,j,sol[N],a[N][N];
bool X[N];
void dusman(int l)
{int i;
if(k<0)
return;
if(l>n)
{if(--k==0)
for(i=1;i<=n;i++)
printf("%d ",sol[i]);
return;}
for(i=1;i<=n;++i)
if(X[i]==0&&a[sol[l-1]][i]==0)
{sol[l]=i;
X[i]=true;
dusman(l+1);
X[i]=false;}}
int main()
{freopen("dusman.in","r",stdin);
freopen("dusman.out","w",stdout);
scanf("%d%d%d",&n,&k,&m);
while(m--)
scanf("%d%d",&i,&j),a[i][j]=a[j][i]=1;
dusman(1);
return 0;}