Pagini recente » Cod sursa (job #2710912) | Cod sursa (job #1463246) | Cod sursa (job #968314) | Cod sursa (job #468968) | Cod sursa (job #1280567)
# include <bits/stdc++.h>
using namespace std;
ifstream fi("dusman.in");
ofstream fo("dusman.out");
bitset < 1005 > b[1005];
int s[1005];
int main(void)
{
int n,k,m,x,y;
fi>>n>>k>>m;
while (m --)
{
fi>>x>>y;
b[x][y]=1;b[y][x]=1;
}
for (int i=1;i<=n;++i) s[i]=i;
int p=0;
do
{
bool ok=0;
for (int i=2;i<n;++i) ok=ok || b[s[i]][s[i-1]] || b[s[i]][s[i+1]];
p+=!ok;
if (p == k) break;
} while (next_permutation(s+1,s+1+n));
for (int i=1;i<=n;++i) fo << s[i] << ' ';
return fo << '\n',0;
}