Pagini recente » Borderou de evaluare (job #367042) | Cod sursa (job #3141413) | Cod sursa (job #609172) | Cod sursa (job #3177252) | Cod sursa (job #316587)
Cod sursa(job #316587)
#include <stdio.h>
#include <stdlib.h>
#define N 1005
char v[N][N];
int n,poz,m,sol[N],solutie,stop=1;
void citire()
{
scanf("%d%d%d",&n,&poz,&m);
int x,y,i;
for (i=1; i<=m; i++)
{
scanf("%d%d",&x,&y);
v[x][y]=1;
v[y][x]=1;
}
}
int valid(int k)
{
int i;
if (v[sol[k-1]][sol[k]] || v[sol[k]][sol[k-1]])
return 0;
for (i=1; i<=k-1; i++)
if (sol[k]==sol[i])
return 0;
return 1;
}
int cond(int k)
{
int i;
for (i=1; i<=k-1; i++)
if (v[sol[i]][sol[i-1]])
return 0;
return 1;
}
void back(int k)
{
if (k==n+1 && cond(k) && stop)
{
solutie++;
if (solutie==poz)
{
for (int i=1; i<=n; i++)
printf("%d ",sol[i]);
stop=0;
//exit(EXIT_SUCCESS);
}
return;
}
for (int i=1; i<=n && stop; i++)
{
sol[k]=i;
if (valid(k))
back(k+1);
}
}
int main()
{
freopen("dusman.in","r",stdin);
freopen("dusman.out","w",stdout);
citire();
back(1);
return 0;
}