there are n leaders . they are to sit in a round table meeting. suppose leader i dislikes leader j. then they wont sit together. Given a value of n an nXn matrix where a[i][j]=1 represents leader i dislikes leader j, u have to show the all possible ways those n leader can sit in the round table conference.
what to do n how to code it?