Pagini recente » Cod sursa (job #2000838) | Cod sursa (job #2292389) | Cod sursa (job #2382556) | Cod sursa (job #1881591) | Cod sursa (job #971303)
Cod sursa(job #971303)
#include <cstdio>
using namespace std;
int n, k, m, i, x, y, st[1001], sol, a[1001][1001];
bool uz[1001];
void tip()
{
for(i=1;i<=n;++i)
printf("%d ", st[i]);
printf("\n");
}
void back(int niv)
{
if(niv==n+1&&sol<k)
if(sol==k-1)
{
tip();
sol++;
}
else sol++;
else
if(sol<k)
for(int i=1;i<=n;++i)
if(!uz[i]&&!a[i][st[niv-1]])
{
st[niv]=i;
uz[i]=1;
back(niv+1);
uz[i]=0;
}
}
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", &x, &y);
a[x][y]=a[y][x]=1;
}
back(1);
return 0;
}