There are people which are to be grouped into exactly teams such that there is at least one person in each team. All members of a team are friends with each other. Find the minimum and maximum no. of pairs of friends that can be formed by grouping these people into exactly teams.

**Examples:**

Input :5 2

Output :4 6

For maximum no. of pairs, 1st team contains only 1 member and 2nd team contains 4 people which are friends which each other, so no. of pairs in 1st team + no. of pairs in 2nd team = 0 + 6 = total pairs = 6

For minimum no. of pairs, 1st team contains 2 members and 2nd team contains 3 people which are friends which each other, so no. of pairs in 1st team + no. of pairs in 2nd team = 1 + 3 = total pairs = 4

Input :2 1

Output :1 1

**Explanation:**

First of all, we have to put 1 member in each team to satisfy the constraint. So we are left with people.

**1. For maximum no. of pairs**

It can be seen that maximum no. pairs can result only by putting all of the remaining members of the same team. It can be explained as follows:

Consider 2 teams one containing x people and other containing 1 person, now we have to add 1 more person to both the teams, adding him/her to the team of x people increases the no. of pairs by x while adding him to the other team only increases the no. of pairs by 1. Hence, for maximum no. of pairs, we have to put all the remaining people in the same team.

Now the teams distribution for maximum no. of pairs would be something like this:

Hence,

Ex: If a team consists of 3 persons, the 3rd person has 1 and 2 as friends, the 2nd person has 1 as a friend. Therefore, 2+1 = ((3-1)*(3))/2 friends

**2. For minimum no. of pairs**

Now from the same explanation, it can be seen that minimum no. of pairs are obtained when all the persons are distributed equally in the teams. Hence remaining n-m people should be distributed in m teams so that each team contains (n-m)/m more people. Now there are people still remaining which are to be filled 1 in each team (can be seen contrary to the above condition of maximum).

Now the team distribution for minimum no. of pairs would be something like this:

Each team has members and teams have one member extra.

So total no. of pairs = Total no.s of pairs in m teams each of size + No. of pairs formed by adding 1 person in teams which have size

## C++

`// CPP program to find minimum and maximum no. of pairs ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `void` `MinimumMaximumPairs(` `int` `n, ` `int` `m) ` `{ ` ` ` `int` `max_pairs = ((n - m + 1) * (n - m)) / 2; ` ` ` ` ` `int` `min_pairs = m * (((n - m) / m + 1) * ((n - m) / m)) / 2 + ` ` ` `ceil` `((n - m) / ` `double` `(m)) * ((n - m) % m); ` ` ` ` ` `cout << ` `"Minimum no. of pairs = "` `<< min_pairs << ` `"\n"` `; ` ` ` `cout << ` `"Maximum no. of pairs = "` `<< max_pairs << ` `"\n"` `; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `n = 5, m = 2; ` ` ` `MinimumMaximumPairs(n, m); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`//Java program to find minimum ` `// and maximum no. of pairs ` ` ` `import` `java.io.*; ` ` ` `class` `GFG { ` ` ` `static` `void` `MinimumMaximumPairs(` `int` `n, ` `int` `m) ` `{ ` ` ` `int` `max_pairs = ((n - m + ` `1` `) * (n - m)) / ` `2` `; ` ` ` ` ` `int` `min_pairs = m * (((n - m) / m + ` `1` `) * ((n - m) / m)) / ` `2` `+ ` ` ` `(` `int` `)Math.ceil((` `double` `)((n - m) / ` ` ` `(` `double` `)(m))) * ((n - m) % m); ` ` ` ` ` `System.out.println(` `"Minimum no. of pairs = "` `+ min_pairs); ` ` ` `System.out.println(` `"Maximum no. of pairs = "` `+ max_pairs); ` `} ` ` ` `// Driver code ` ` ` `public` `static` `void` `main (String[] args) { ` ` ` ` ` `int` `n = ` `5` `, m = ` `2` `; ` ` ` `MinimumMaximumPairs(n, m); ` `} ` `} ` `// This code is contributed by Sachin. ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 program to find minimum ` `# and maximum no. of pairs ` ` ` `from` `math ` `import` `ceil ` ` ` `def` `MinimumMaximumPairs(n, m) : ` ` ` ` ` `max_pairs ` `=` `((n ` `-` `m ` `+` `1` `) ` `*` `(n ` `-` `m)) ` `/` `/` `2` `; ` ` ` ` ` `min_pairs ` `=` `(m ` `*` `(((n ` `-` `m) ` `/` `/` `m ` `+` `1` `) ` `*` ` ` `((n ` `-` `m) ` `/` `/` `m)) ` `/` `/` `2` `+` ` ` `ceil((n ` `-` `m) ` `/` `(m)) ` `*` ` ` `((n ` `-` `m) ` `%` `m)) ` ` ` ` ` `print` `(` `"Minimum no. of pairs = "` `, min_pairs) ` ` ` `print` `(` `"Maximum no. of pairs = "` `, max_pairs) ` ` ` `# Driver code ` `if` `__name__ ` `=` `=` `"__main__"` `: ` ` ` ` ` `n ,m` `=` `5` `, ` `2` ` ` `MinimumMaximumPairs(n, m) ` ` ` `# This code is contributed by Ryuga ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find minimum ` `// and maximum no. of pairs ` `using` `System; ` `class` `GFG ` `{ ` `static` `void` `MinimumMaximumPairs(` `int` `n, ` `int` `m) ` `{ ` ` ` `int` `max_pairs = ((n - m + 1) * (n - m)) / 2; ` ` ` ` ` `int` `min_pairs = m * (((n - m) / m + 1) * ((n - m) / m)) / 2 + ` ` ` `(` `int` `)Math.Ceiling((` `double` `)((n - m) / ` ` ` `(` `double` `)(m))) * ((n - m) % m); ` ` ` ` ` `Console.WriteLine(` `"Minimum no. of pairs = "` `+ min_pairs); ` ` ` `Console.WriteLine(` `"Maximum no. of pairs = "` `+ max_pairs); ` `} ` ` ` `// Driver code ` `public` `static` `void` `Main() ` `{ ` ` ` `int` `n = 5, m = 2; ` ` ` `MinimumMaximumPairs(n, m); ` `} ` `} ` ` ` `// This code is contributed by Akanksha Rai ` |

*chevron_right*

*filter_none*

## PHP

`<?php ` `// PHP program to find minimum ` `// and maximum no. of pairs ` `function` `MinimumMaximumPairs(` `$n` `, ` `$m` `) ` `{ ` ` ` `$max_pairs` `= ((` `$n` `- ` `$m` `+ 1) * (` `$n` `- ` `$m` `)) / 2; ` ` ` ` ` `$min_pairs` `= ` `$m` `* (int)((((int)(` `$n` `- ` `$m` `) / ` `$m` `+ 1) * ` ` ` `((int)(` `$n` `- ` `$m` `) / ` `$m` `)) / 2) + ` ` ` `(int)` `ceil` `((` `$n` `- ` `$m` `) / ` `$m` `) * ` ` ` `((` `$n` `- ` `$m` `) % ` `$m` `); ` ` ` ` ` `echo` `(` `"Minimum no. of pairs = "` `. ` ` ` `"$min_pairs"` `. ` `"\n"` `); ` ` ` `echo` `(` `"Maximum no. of pairs = "` `. ` ` ` `"$max_pairs"` `); ` `} ` ` ` `// Driver code ` `$n` `= 5; ` `$m` `= 2; ` `MinimumMaximumPairs(` `$n` `, ` `$m` `); ` ` ` `// This code is contributed ` `// by Mukul Singh ` `?> ` |

*chevron_right*

*filter_none*

**Output**

Minimum no. of pairs = 4 Maximum no. of pairs = 6

**Time Complexity:**

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Maximum number of teams that can be formed with given persons
- Maximum number of 3-person teams formed from two groups
- Maximum number of people that can be killed with strength P
- Maximum of minimum difference of all pairs from subsequences of given size
- Given number of matches played, find number of teams in tournament
- Count of ways to distribute N items among 3 people with one person receiving maximum
- Number of ways to pair people
- Find if two people ever meet after same number of jumps
- Ways to form n/2 pairs such that difference of pairs is minimum
- Number of subarrays whose minimum and maximum are same
- Minimum and maximum number of N chocolates after distribution among K students
- Minimum number of elements to be removed to make XOR maximum
- Sum of Maximum and Minimum prime factor of every number in the Array
- Break a number such that sum of maximum divisors of all parts is minimum
- Minimum and Maximum element of an array which is divisible by a given number k
- Number of times Maximum and minimum value updated during traversal of array
- Number of pairs such that path between pairs has the two vertices A and B
- Minimum distance between the maximum and minimum element of a given Array
- Minimum LCM of all pairs in a given array
- Find the maximum possible value of a[i] % a[j] over all pairs of i and j

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. 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.