Pagini recente » Cod sursa (job #1979549) | Cod sursa (job #2071978) | Cod sursa (job #32225) | Cod sursa (job #1633382) | Cod sursa (job #486841)
Cod sursa(job #486841)
#include<cstdio>
const int N=1002;
bool a[N][N],gasit[N];
int n,k,m,sol[N];
void citeste()
{
scanf("%d%d%d",&n,&k,&m);
int x,y;
for (int i=1;i<=m;++i)
{
scanf("%d%d",&x,&y);
a[x][y]=a[y][x]=true;
}
}
void afis()
{
for (int i=1;i<=n;++i)
printf("%d ",sol[i]);
printf("\n");
}
void bkt(int p)
{
if (k<0)
return;
if (p>n)
{
--k;
if (k==0)
afis();
return;
}
for (int i=1;i<=n;++i)
if (!gasit[i] && !a[sol[p-1]][i])
{
sol[p]=i;
gasit[i]=true;
bkt(p+1);
gasit[i]=false;
}
}
int main()
{
freopen("dusman.in","r",stdin);
freopen("dusman.out","w",stdout);
citeste();
bkt(1);
return 0;
}