Cod sursa(job #1798964)
Utilizator | Data | 5 noiembrie 2016 17:01:04 | |
---|---|---|---|
Problema | Dusman | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream f("dusman.in");
ofstream g("dusman.out");
bool uz[1<<10],a[1<<10][1<<10];
int n,m,i,j,k,x,y,b[1<<10];
void enemy(int x)
{
if(x>n)
{
--k;
return;
}
for(int i=1;i<=n&&k;++i)
if(!uz[i]&&!a[b[x-1]][i])
uz[i]=1,b[x]=i,enemy(x+1),uz[i]=0;
}
int main()
{
f>>n>>k>>m;
for(i=1;i<=m;++i)
f>>x>>y,a[x][y]=a[y][x]=1;
enemy(1);
for(i=1;i<=n;++i) g<<b[i]<<' ';
return 0;
}