There are n boys and n girls are to be seated around a round table, in a circle. The task is to find number of ways in which n boys and n girls can sit alternatively aound a round table. Given n<10
Input: n = 5 Output: 2880 Input: n = 1 Output: 1
- First find the total number of ways in which boys can be arrange on round table.
No. of ways to arrange boys on table = (n-1)!
- After making boys arrangement, now make arrangement for girls. As after seating boys there are n space available between them. So there are n position and n number of girls. So total number of arrangement in which girls sit between boys are n!.
- Therefore Total number of ways = (number of arrangement of boys) * (number of ways to sit girl among boys) = (n-1)! * (n!)
Below is the implementation of the above approach:
- Seating arrangement of N boys sitting around a round table such that two particular boys sit together
- Puzzle | Neighbors in a round table
- Arrangement of the characters of a word such that all vowels are at odd places
- Maximum height of triangular arrangement of array values
- Arrangement of words without changing the relative position of vowel and consonants
- Shortest path from source to destination such that edge weights along path are alternatively increasing and decreasing
- Round the given number to nearest multiple of 10 | Set-2
- Round the given number to nearest multiple of 10
- Program for Binomial Coefficients table
- Compute the parity of a number using XOR and table look-up
- Find the number of cells in the table contains X
- Permutations to arrange N persons around a circular table
- Program to print multiplication table of a number
- Round-off a number to a given number of significant digits
- Number of ways to arrange 2*N persons on the two sides of a table with X and Y persons on opposite sides
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.