Given two integers N1 and N2 where, N1 is the number of people in group 1 and N2 is the number of people in group 2. The task is to count the maximum number of 3-person teams that can be formed when at least a single person is chosen from both the groups.
Input: N1 = 2, N2 = 8
Team 1: 2 members from group 2 and 1 member from group 1
Update: N1 = 1, N2 = 6
Team 2: 2 members from group 2 and 1 member from group 1
Update: N1 = 0, N2 = 4
No further teams can be formed.
Input: N1 = 4, N2 = 5
Approach: Choose a single person from the team with less members and choose 2 persons from the team with more members (while possible) and update count = count + 1. Print the count in the end.
Below is the implementation of the above approach:
- Minimum and Maximum number of pairs in m teams of n people
- Given number of matches played, find number of teams in tournament
- Number of triangles that can be formed
- Number of triangles that can be formed with given N points
- Number of triangles formed from a set of points on three lines
- Number of triangles formed by joining vertices of n-sided polygon with one side common
- Number of ways in which the substring in range [L, R] can be formed using characters out of the range
- Number which has the maximum number of distinct prime factors in the range M to N
- Find the number of words of X vowels and Y consonants that can be formed from M vowels and N consonants
- Ways to form a group from three groups with given constraints
- Ways of dividing a group into two halves such that two elements are in different groups
- Find the Number of Maximum Product Quadruples
- Maximum number of dots after throwing a dice N times
- Sum of all numbers that can be formed with permutations of n digits
- All possible strings of any length that can be formed from a given string
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.