Pagini recente » Cod sursa (job #1286516) | Cod sursa (job #2109075) | Cod sursa (job #548093) | Cod sursa (job #2084741) | Cod sursa (job #162616)
Cod sursa(job #162616)
#include<stdio.h>
#define nmax 1005
int d[nmax][nmax], s[nmax], luat[nmax];
int n,m,k,ct;
void read()
{
int i,n1,n2;
freopen("dusman.in","r",stdin);
freopen("dusman.out","w",stdout);
scanf("%d%d%d",&n, &k, &m);
for (i=1; i<=m; ++i)
{
scanf("%d%d", &n1, &n2);
d[n1][n2]=1;
d[n2][n1]=1;
}
}
void print()
{
for(int i=1; i<=n; i++)
printf("%d ", s[i]);
printf("\n");
}
void bec(int p)
{
for(int i=1; i<=n; ++i)
{
if(d[s[p-1]][s[p]]==0&&luat[i]==0)
{
s[p]=i;
luat[s[p]]=1;
if(p==n)
{
ct++;
if(ct==k)
{
print();
return;
}
}
else
bec(p+1);
luat[s[p]]=0;
}
}
}
int main()
{
read();
bec(1);
return 0;
}