Pagini recente » Cod sursa (job #169511) | Cod sursa (job #3285683) | Cod sursa (job #3255103) | Cod sursa (job #3039483) | Cod sursa (job #457960)
Cod sursa(job #457960)
#include<fstream>
using namespace std;
ifstream f("dusman.in");
ofstream g("dusman.out");
int sol,v[10001],p,n,m,a[10001][10001],i,j,x,y,ok=0,l[10001];
void afis(){
int i;
for(i=1;i<=n;++i) g<<v[i]<<' ';
ok=1;
g<<'\n';
}
void back(int k){
if ( sol > p ) return ;
int i;
if(k>n){
++sol;
if(sol==p) afis();
}
else
for(i=1;i<=n;++i)
if(!(l[i]||a[v[k-1]][i])){
v[k]=i;
l[i] = 1;
back(k+1);
l[i] = 0;
}
}
int main(){
f>>n>>p>>m;
for(i=1;i<=m;++i){
f>>x>>y;
a[x][y]=a[y][x] = 1;
}
back(1);
return 0;
}