Pagini recente » Cod sursa (job #776117) | Cod sursa (job #2343727) | Cod sursa (job #1391234) | Monitorul de evaluare | Cod sursa (job #623478)
Cod sursa(job #623478)
#include<cstdio>
#include<iostream>
char x[1001][1001];
int v[10001],a[10001];
int n,k,m,c,d,t=0;
int bkt (int p)
{
if (t==k)
return 0;
if (p==n+1)
{
t++;
if (t==k)
for (int i=1;i<=n;i++)
printf ("%d ",v[i]);
bkt (p-1);
}
else
{
a[v[p]]=0;
for(v[p]++; v[p]<=n;v[p]++)
if (!a[v[p]] && !x[v[p-1]][v[p]])
{
a[v[p]]=1;
bkt (p+1);
}
v[p]=0;
bkt (p-1);
}
}
int main ()
{
freopen ("dusman.in","r",stdin );
freopen ("dusman.out","w",stdout);
scanf ("%d%d%d",&n,&k,&m);
for (int i=1;i<=m;i++)
{
scanf ("%d%d",&c,&d);
x[c][d]=x[d][c]=1;
}
bkt (1);
return 0;
}