Given three integers m, n and k that store the number of points on lines l1, l2 and l3 respectively that do not intersect. The task is to find the number of triangles that can possibly be formed from these set of points.
Input: m = 3, n = 4, k = 5 Output: 205 Input: m = 2, n = 2, k = 1 Output: 10
- The total number of points are (m + n + k) which must give number of triangles.
- But ‘m’ points on ‘l1’ gives combinations which cannot form a triangle.
- Similarly, and number of triangles can not be formed.
- Therefore, Required Number of Triangles =
Below is the implementation of the above approach:
- Number of Triangles that can be formed given a set of lines in Euclidean Plane
- Number of triangles that can be formed with given N points
- Number of triangles in a plane if no more than two points are collinear
- Maximum points of intersection n lines
- Find whether only two parallel lines contain all coordinates points or not
- Count of different straight lines with total n points with m collinear
- Count of triangles with total n points with m collinear
- Prime points (Points that split a number into two primes)
- Number of Integral Points between Two Points
- Count the number of possible triangles
- Number of triangles after N moves
- Number of Triangles in an Undirected Graph
- Count number of right triangles possible with a given perimeter
- Count number of unique Triangles using STL | Set 1 (Using set)
- Number of possible Triangles in a Cartesian coordinate system
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.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.