Pagini recente » Cod sursa (job #703249) | Cod sursa (job #875898) | Cod sursa (job #2073351) | Cod sursa (job #2037385) | Cod sursa (job #1235518)
#include <cstdio>
#define nmax 1005
using namespace std;
int mat[nmax][nmax],uz[nmax],b[nmax],n,m,i,j,k,x,y,s=1;
void enemy(int x){
if(x>n) --k;
else{
for(int i=1;i<=n&&k!=0;++i){
if(uz[i]==0&&mat[b[x-1]][i]==0){
uz[i]=1;
b[x]=i;
enemy(x+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);
mat[x][y]=1;
mat[y][x]=1;
}
enemy(s);
for(i=1;i<=n;++i)
printf("%d ",b[i]);
fclose(stdin);
fclose(stdout);
return 0;
}