- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
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
#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
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 number of pieces in N cuts in C++
- Intersection of two arrays in C#
- Intersection of two HashSets in C#
- Intersection of Two Arrays in C++
- Plot horizontal and vertical lines passing through a point that is an intersection point of two lines in Matplotlib
- Find the probability of reaching all points after N moves from point N in C++
- Maximum points covered after removing an Interval in C++
- Maximum Points You Can Obtain from Cards in C++
- Maximum distinct lines passing through a single point in C
Advertisements