Pagini recente » Cod sursa (job #1042675) | Cod sursa (job #1870815) | Cod sursa (job #2818512) | Cod sursa (job #5941) | Cod sursa (job #236521)
Cod sursa(job #236521)
#include <stdio.h>
int A[10][10],i,j,kk,n,m,s[1000],l[1000],a,b,ok=1;
void perm(int k)
{
int i;
//if (kk<0) return;
if (k==n+1) kk--;
if (kk==0 && ok)
{
for (i=1; i<n; ++i)
printf("%d ",s[i]);
printf("%d\n",s[n]);
ok=0;
// return;
}
for (i=1;i<=n;++i)
if ((l[i]==0 && A[s[k-1]][i]==0) && (l[i]==0 && A[i][s[k-1]]==0))
{
l[i]=1;
s[k]=i;
perm(k+1);
l[i]=0;
}
}
int main()
{
freopen("dusman.in","r",stdin);
scanf("%d %d %d", &n,&kk,&m);
for (i=1;i<=m;++i)
{
scanf("%d %d", &a,&b);
A[a][b]=1;
}
freopen("dusman.out","w",stdout);
perm(1);
return 0;
}