Pagini recente » Cod sursa (job #1847962) | Cod sursa (job #2540473) | Cod sursa (job #1850010) | Cod sursa (job #813230) | Cod sursa (job #623400)
Cod sursa(job #623400)
#include <stdio.h>
int n,k,m,zz;
int i;
int a,b;
int v[1001][1001];
int sol[1001];
int vs[1001];
int back(int p)
{
int ii=0;
if(zz==k) return 0;
if(p==n+1){
zz++;
if(zz==k){
for(ii=1;ii<=n;ii++){
printf("%d ",sol[ii]);
}
printf("\n");
}
back(p-1);
}else{
//printf("%d ",p);
vs[sol[p]]=0;
for(sol[p]++;sol[p]<=n;sol[p]++){
if(vs[sol[p]]==0 && v[sol[p-1]][sol[p]]==0){
vs[sol[p]]=1;
back(p+1);
}
}
sol[p]=0;
back(p-1);
}
}
int main()
{
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",&a,&b);
v[a][b]=v[b][a]=1;
}
back(1);
return 0;
}