Given an integer N where 4 ≤ N ≤ 100. There are N lines vertically and N lines horizontally. So, There are N2 intersections. The task is find the number of ways to place 4 items in these N2 positions such that each row and column contain not more than one item.
Input: N = 4
Input: N = 5
Approach: The number of ways to choose 4 horizontal lines that will have items from n is nC4. There are n ways to place an item on the first of these lines. Given the place of the first item, there are n – 1 ways to place an item on the second of these lines because one of the vertical lines is already taken. Given the places of the first and second items, there are n – 2 ways to place an item on the third line and the same way n – 3 for the fourth item. The total number of ways to place items on selected 4 horizontal paths is n * (n – 1) * (n – 2) * (n – 3). So the result is nC4 * n * (n – 1) * (n – 2) * (n – 3).
Below is the implementation of the above approach:
- Total number of ways to place X and Y at n places such that no two X are together
- Count ways to distribute m items among n people
- Program to find the profit or loss when CP of N items is equal to SP of M items
- Probability of distributing M items among X bags such that first bag contains N items
- Minimum numbers with one's place as 9 to be added to get N
- Find the unit place digit of sum of N factorials
- Find the top K items with the highest value
- Find a number containing N - 1 set bits at even positions from the right
- Number of different positions where a person can stand
- Buy minimum items without change and given coins
- Find a way to fill matrix with 1's and 0's in blank positions
- Minimum cost to cover the given positions in a N*M grid
- Maximum items that can be bought with the given type of coins
- Number of positions such that adding K to the element is greater than sum of all other elements
- Count of Numbers in a Range divisible by m and having digit d in even positions
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.