Pagini recente » Cod sursa (job #1552675) | Cod sursa (job #1744730) | Cod sursa (job #1566857) | Cod sursa (job #448042) | Cod sursa (job #1342580)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("dusman.in");
ofstream cout("dusman.out");
int n,m,k,nr,x,y,a[1005];
bool u,viz[1005],b[1005][1005];
void back(int x) {
int i;
if(x>n) if(++nr==m) for(i=u=1;i<=n;++i) cout<<a[i]<<' ';
else /* Trolling :) */;
else for(i=1;i<=n && !u;++i)
if(!viz[i] && !b[a[x-1]][i])
a[x]=i,viz[i]=1,back(x+1),viz[i]=0;
}
int main()
{
cin>>n>>m>>k;
while(k--) cin>>x>>y,b[x][y]=b[y][x]=1;
back(1);
return 0;
}