Pagini recente » Cod sursa (job #2089389) | Cod sursa (job #1820779) | Clasamentul arhivei de probleme | Cod sursa (job #1964315) | Cod sursa (job #252988)
Cod sursa(job #252988)
#include<fstream.h>
int z=0,n,k,m,i,s[1003],ok2,a,b,q,ok,car[1003];
int v[1003][1003];
int main()
{
ifstream f("dusman.in");
ofstream g("dusman.out");
f>>n>>k>>m;
for(i=0;i<m;i++)
{
f>>a>>b;
v[a][b]=1;
v[b][a]=1;
}
q=0;
s[q]=0;
while(q>=0)
if(s[q]<n)
{
s[q]++;
ok=1;
if(car[s[q]])ok=0;
if(v[s[q-1]][s[q]]==1)ok=0;
if(ok)
{car[s[q]]=1;
if(q==n-1)
{
z++;
if(z==k)
{for(i=0;i<n;i++)g<<s[i]<<" ";break;}
car[s[q]]=0;
}
else {q++;s[q]=0;}}
}
else {q--;car[s[q]]=0;}
f.close();
g.close();
return 0;
}