Pagini recente » Cod sursa (job #2492511) | Cod sursa (job #2241053) | Cod sursa (job #2950072) | Cod sursa (job #279485) | Cod sursa (job #2971828)
#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];
bool ok=1;
void bectreching(int poz)
{
for (int i=1; i<=n; i++)
if (!p[i] && !dusmani[i][x[poz-1]])
{
p[i]=1;
x[poz]=i;
if (poz<n) bectreching(poz+1);
else{
nr++;
if (nr==k){
for (int j=1; j<=n; ++j) cout<<x[j]<<" ";
exit(0);
}
}
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;
}