Pagini recente » Cod sursa (job #2328280) | Cod sursa (job #1868114) | Cod sursa (job #2220115) | Cod sursa (job #955221) | Cod sursa (job #763586)
Cod sursa(job #763586)
#include <fstream>
using namespace std;
ifstream in("dusman.in");
ofstream out("dusman.out");
const int N=1005;
int a[N][N],use[N],sol[N];
int n,m,k;
void afis()
{
for(int i=1;i<=n;i++)
out<<sol[i]<<" ";
out<<"\n";
}
void bkt(int l)
{
if(k<0)
return;
if(l-1==n)
{
k--;
if(k==0)
{
afis();
return;
}
}
for(int i=1;i<=n;i++)
{
if(!use[i] && ! a[sol[l-1]][i])
{
sol[l]=i;
use[i]=true;
bkt(l+1);
use[i]=false;
}
}
}
int main()
{
int x,y;
in>>n>>k>>m;
while(m--)
{
in>>x>>y;
a[x][y]=1;
a[y][x]=1;
}
bkt(1);
}