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[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?
Read this thread. Here is a quote from it: We are not here to do your work, or your homework. How would you learn? Write some code and post here for help. Put the code in code tags when you post (see the aforementioned link about how to do that).
