Maximum points of intersection n lines in C++

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

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

Example

 Live Demo

#include <bits/stdc++.h>
using namespace std;
#define ll long int
//finding maximum intersection points
ll countMaxIntersect(ll n) {
   return (n) * (n - 1) / 2;
}
int main() {
   ll n = 8;
   cout << countMaxIntersect(n) << endl;
   return 0;
}

Output

28

Ayush Gupta

Published on 09-Sep-2020 12:18:22

• Related Questions & Answers
• Maximum points of intersection n circles in C++
• Program for Point of Intersection of Two Lines in C++
• Find intersection point of lines inside a section in C++
• Find the Number of Triangles Formed from a Set of Points on Three Lines using C++\n
• Maximum possible intersection by moving centers of line segments in C++
• Program to print last N lines in c++
• Maximum points covered after removing an Interval in C++
• Maximum Points You Can Obtain from Cards in C++
• Find the probability of reaching all points after N moves from point N in C++
• Maximum number of pieces in N cuts in C++
• Maximum number of fixed points using at most 1 swaps in C++
• Maximum number of segments that can contain the given points in C++
• Intersection of two arrays in C#
• Intersection of two HashSets in C#
• Intersection of Two Arrays in C++