Pagini recente » Borderou de evaluare (job #2476543) | Cod sursa (job #717905) | Cod sursa (job #641407) | Cod sursa (job #641405) | Cod sursa (job #2522321)
/*
ID: Sho10
LANG: C++
TASK:
*/
#include <bits/stdc++.h> //JuniorMonster a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,k,m,ans=0,x,y;
vector<ll>v[1005];
vector<ll>a;
int32_t main(){
CODE_START;
ifstream cin("dusman.in");
ofstream cout("dusman.out");
cin>>n>>k>>m;
for(ll i=0;i<m;i++)
{
cin>>x>>y;
v[x].pb(y);
v[y].pb(x);
}
for(ll i=1;i<=n;i++)
a.pb(i);
do{
for(ll i=1;i<n-1;i++)
{
for(ll j=0;j<v[a[i]].size();j++)
{
if(a[i-1]==v[a[i]][j]||a[i+1]==v[a[i]][j]){
goto Next;
}
}
}
ans++;
if(ans==k){
for(ll i=0;i<n;i++)
cout<<a[i]<<' ';
return 0;
}
Next:x=0;
}while(next_permutation(a.begin(),a.end()));
}