Pagini recente » Cod sursa (job #1764379) | Cod sursa (job #636931) | Cod sursa (job #1535716) | Cod sursa (job #1285400) | Cod sursa (job #3151232)
#include <fstream>
#include <stdio.h>
using namespace std;
int n,st[10005],fr[10005],k,m,a[1005][1005],a1,b1,nr,i;
ifstream fin("dusman.in");
ofstream fout("dusman.out");
void back(int pas)
{
if(nr==k) exit(0);
else
if(pas>n)
{
nr++;
if(nr==k)
{
for(int i=1; i<=n; i++)
{
fout<<st[i]<<" ";
}
}
}
else
{
for(int i=1; i<=n; i++)
{
if(fr[i]==0)
{
st[pas]=i;
fr[i]++;
if(a[st[pas]][st[pas-1]]==0) back(pas+1);
fr[i]--;
}
}
}
}
int main()
{
fin >>n>>k>>m;
for (i=1;i<=m;i++)
{
fin >>a1>>b1;
a[a1][b1]=a[b1][a1]=1;
}
back(1);
return 0;
}