Pagini recente » Cod sursa (job #210909) | Cod sursa (job #1702344) | Cod sursa (job #464645) | Cod sursa (job #2380180) | Cod sursa (job #165551)
Cod sursa(job #165551)
#include<fstream.h>
int s[1001],v[1001][1001],a,b,n,m,k=1,i,j,sol=0,p,cont,x[1001];
int main()
{
ifstream f("dusman.in");
ofstream g("dusman.out");
f>>n>>p>>m;
for(i=1;i<=m;i++)
{ f>>a>>b;
v[a][b]=1;
v[b][a]=1;
}
s[k]=0;
while(k>0)
if(s[k]<n)
{s[k]++;
cont=1;
if(v[s[k]][s[k-1]]||x[s[k]]) cont=0;
if(cont)
{x[s[k]]=1;
if(k==n)
{
sol++; if(sol==p) break;
x[s[k]]=0;
}
else {k++; s[k]=0;}
}
}
else {k--; x[s[k]]=0;}
for(i=1;i<=n;i++)
g<<s[i]<<" ";
f.close();
g.close();
return 0;
}