Pagini recente » Cod sursa (job #2049333) | Cod sursa (job #2639792) | Cod sursa (job #228142) | Cod sursa (job #1411703) | Cod sursa (job #2971167)
#include <fstream>
using namespace std;
ifstream cin ("dusman.in");
ofstream cout ("dusman.out");
int n,k,m,nr,dusmani[1000][1000],p[1000],x[1000];
void bectreching(int k)
{
for (int i=1; i<=n; ++i)
if (!p[i])
{
if (k>1 && dusmani[x[k-1]][i]) continue;
p[i]=1;
x[k]=i;
if (k<n) bectreching(k+1);
else{
nr++;
if (nr==k){
for (int i=1; i<=n; ++i) cout<<x[i]<<" ";
cout<<"\n";
return;
}
}
p[i]=0;
}
}
int main()
{
cin>>n>>k>>m;
int a,b;
for (int i=1; i<=m; ++i){
cin>>a>>b;
dusmani[a][b]=dusmani[b][a]=1;
}
bectreching(1);
return 0;
}