Pagini recente » Cod sursa (job #556215) | Cod sursa (job #1966765) | Cod sursa (job #372726) | Cod sursa (job #1848538) | Cod sursa (job #2971830)
#include <fstream>
using namespace std;
ifstream cin ("dusman.in");
ofstream cout ("dusman.out");
int n,K,m,nr,dusmani[1005][1005],p[1005],x[1005];
bool ok=1;
void bectreching(int k)
{
if (!ok) return;
if (k==n+1){
nr++;
if (nr==K){
for (int i=1; i<=n; ++i) cout<<x[i]<<" ";
ok=0;
return;
}
}
for (int i=1; i<=n; i++)
if (!p[i] && !dusmani[i][x[k-1]])
{
p[i]=1;
x[k]=i;
bectreching(k+1);
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;
}