Maximum points of intersection n circles in C++

In this tutorial, we will be discussing a program to find maximum points of intersection n circles

For this we will be provided with the number of circles. Our task is to find the maximum number of intersections the given number of circles meet.

Example

 Live Demo

#include <bits/stdc++.h>
using namespace std;
//returning maximum intersections
int intersection(int n) {
   return n * (n - 1);
}
int main() {
   cout << intersection(3) << endl;
   return 0;
}

Output

6