Pagini recente » Cod sursa (job #2384439) | Cod sursa (job #2200498) | Borderou de evaluare (job #2221000) | Cod sursa (job #1615358) | Cod sursa (job #2305390)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("dusman.in");
ofstream fout("dusman.out");
int n,q,m,p,z,i,x[1001],nr;
bool a[1001][1001],viz[1001],ok;
void show(){
for(int i=1;i<=n;i++)
fout<<x[i]<<' ';
}
int valid(int k){
if(k>1&&a[x[k-1]][x[k]]==1)
return 0;
return 1;
}
void back(int k){
int i;
for(i=1;i<=n&&ok==0;i++)
if(viz[i]==0 ){
viz[i]=1;
x[k]=i;
if(valid(k))
if(k==n){
nr++;
if(nr==z){
show();
ok=1;
return;
}
}
else
back(k+1);
viz[i]=0;
}
}
int main()
{
fin>>n>>z>>m;
for(i=1;i<=m;i++){
fin>>p>>q;
a[p][q]=a[q][p]=1;
}
back(1);
return 0;
}