Pagini recente » Cod sursa (job #220903) | Cod sursa (job #697453) | Cod sursa (job #2337921) | Cod sursa (job #66394) | Cod sursa (job #314998)
Cod sursa(job #314998)
#include<stdio.h>
#include<stdlib.h>
int n,m,k2,k3,sol[1001];
char mat[1001][1001];
void afisare()
{
for(int i=1;i<=n;++i)
printf("%d ",sol[i]);
printf("\n");
}
char valid(int k)
{
for(int i=1;i<k;++i)
if(sol[i]==sol[k])
return 0;
if (mat[sol[k]][sol[k-1]]) return 0;
return 1;
}
void back(int k)
{
if (k==n+1)
{
k3++;
if (k3==k2)
{
afisare();
exit (EXIT_SUCCESS);
}
return;
}
for(int i=1;i<=n;++i)
{
sol[k]=i;
if(valid(k))
back(k+1);
}
}
int main()
{
freopen("dusman.in","r",stdin);
freopen("dusman.out","w",stdout);
scanf("%d%d%d",&n,&k2,&m);
int a,b;
for (int i=1; i<=m; i++) {scanf("%d%d", &a, &b); mat[a][b]=1; mat[b][a]=1;}
k3=0;
back(1);
return 0;
}