- Related Questions & Answers
- Count Number of Teams in C++
- Convert a number m to n using minimum number of given operations in C++
- Find the minimum number of steps to reach M from N in C++
- Maximum and minimum of an array using minimum number of comparisons in C
- Number of pairs with maximum sum in C++
- Maximum number of 3-person teams formed from two groups in C++
- Find a positive number M such that gcd(N^M,N&M) is maximum in Python
- Finding minimum number of required operations to reach n from m in JavaScript
- Maximum sum and product of the M consecutive digits in a number in C++
- Maximum number of pieces in N cuts in C++
- Count of numbers satisfying m + sum(m) + sum(sum(m)) = N in C++
- C++ Program to Generate N Number of Passwords of Length M Each
- Maximum Length Chain of Pairs in C++
- Print first m multiples of n in C#
- Cost of painting n * m grid in C++

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

**N** participants of the competition were split into **M** teams in some manner so that each team has at least one participant. After the competition each pair of participants from the same team became friends.

Your task is to write a program that will find the minimum and the maximum number of pairs of friends that could have formed by the end of the competition.

1. We can obtain max pairs using below formula: maxPairs = ((n – m) * (n – m + 1)) / 2 2. We can obtain min pairs using below formula: minPairs = m * (((n - m) / m + 1) * ((n - m) / m)) / 2 + ceil((n - m) / double(m)) * ((n - m) % m);

#include <iostream> #include <cmath> using namespace std; void getPairs(int n, int m){ int maxPairs = ((n - m + 1) * (n - m)) / 2; int minPairs = m * (((n - m) / m + 1) * ((n - m) / m)) / 2 + ceil((n - m) / double(m)) * ((n - m) % m); cout << "Minimum pairs = " << minPairs << "\n"; cout << "Maximum pairs = " << maxPairs << "\n"; } int main(){ getPairs(3, 2); return 0; }

When you compile and execute the above program. It generates the following output−

Minimum pairs = 1 Maximum pairs = 1

Advertisements