Pagini recente » Cod sursa (job #527216) | Cod sursa (job #2942912) | Cod sursa (job #2398155) | Cod sursa (job #1184369) | Cod sursa (job #474359)
Cod sursa(job #474359)
#include<cstdio>
const int N=500;
const int M=15;
int n,sol[N];
bool prieten[M][M];
char s[M];
void citire()
{
scanf("%d\n",&n);
for (int i=1;i<=n;++i)
{
gets(s);
for (int j=0;j<n;++j)
if (s[j]=='1')
prieten[i][j+1]=true;
}
}
void prelucrare()
{
for (int i=1;i<=n;++i)
printf("%d ",sol[i]);
printf("\n");
}
void bkt(int p,int max)
{
if (p==n+1)
{
prelucrare();
return;
}
for (int i=1;i<=max;++i)
{
sol[p]=i;
bkt(p+1,max);
}
sol[p]=max+1;
bkt(p+1,max+1);
}
int main()
{
freopen("copii.in","r",stdin);
freopen("copii.out","w",stdout);
citire();
bkt(1,0);
return 0;
}