Pagini recente » Cod sursa (job #867749) | Cod sursa (job #1032671) | Cod sursa (job #1764074) | Cod sursa (job #1402064) | Cod sursa (job #252208)
Cod sursa(job #252208)
#include <stdio.h>
int n,st[1010],as,ev,m,p,a,b,c,d,e,f,i,x[1000][1000];
int succ(int k)
{
if(st[k]<n)
{
st[k]++;
return 1;
}
return 0;
}
int valid(int k)
{
for (i=1;i<k;++i)
if (st[k]==st[i] || (x[st[i]][st[i+1]]==1 || x[st[i+1]][st[i]]==1))
return 0;
return 1;
}
void back(int k)
{
st[k]=0;
while(succ(k))
{
if(valid(k))
if(k==n) p--;
else back(k+1);
if (p==0) break;
}
}
int main()
{
freopen("dusman.in","r",stdin);
scanf("%d %d %d",&n,&p,&m);
for (i=1;i<=m;++i)
{
scanf("%d %d",&a,&b);
x[a][b]=1;
}
back(1);
freopen("dusman.out","w",stdout);
for (i=1;i<=n;++i)
printf("%d ",st[i]);
return 0;
}