如果不超过两点共线，则平面中的三角形数

给定平面上的 n 个点且共线的点不超过两个，任务是计算给定平面中三角形的数量。
例子：

Input :  n = 3
Output : 1

Input :  n = 4
Output : 4

设平面中有 n 个点且没有三个或更多点共线，则给定平面中的三角形数由下式给出$^{n}\textrm{C}_{3} = \frac{n(n-1)(n-2)}{6}$

C++

// C++ program to find the number of
// triangles in a plane if no more
// then two points are collinear.
#include 
using namespace std;
 
// Function to find number of triangles
// in a plane.
int countNumberOfTriangles(int n)
{
 
    // Formula to find number of triangles
    // nC3 = n * (n - 1) * (n - 2) / 6
    return n * (n - 1) * (n - 2) / 6;
}
 
// Driver code
int main()
{
    int n = 4;
    cout << countNumberOfTriangles(n);
    return 0;
}

Java

// Java program to find the number of
// triangles in a plane if no more
// then two points are collinear.
import java.io.*;
 
class GFG {
 
    // Function to find number of triangles
    // in a plane.
    static int countNumberOfTriangles(int n)
    {
 
        // Formula to find number of triangle
        // nC3 = n * (n - 1) * (n - 2) / 6
        return n * (n - 1) * (n - 2) / 6;
    }
 
    // Driver code
    public static void main(String[] args)
    {
        int n = 4;
 
        System.out.println(
            countNumberOfTriangles(n));
    }
}

Python3

# Python3 program to find
# the number of triangles
# in a plane if no more
# then two points are collinear.
 
# Function to find number
# of triangles in a plane.
def countNumberOfTriangles(n) :
     
    # Formula to find
    # number of triangles
    # nC3 = n * (n - 1) *
    # (n - 2) / 6
    return (n * (n - 1) *
                (n - 2) // 6)
 
# Driver Code
if __name__ == '__main__' :
     
    n = 4
    print(countNumberOfTriangles(n))
 
                 
# This code is contributed
# by ajit

C#

// C# program to find the
// number of triangles in
// a plane if no more then
// two points are collinear.
using System;
 
class GFG
{
 
    // Function to find number
    // of triangles in a plane.
    static int countNumberOfTriangles(int n)
    {
 
        // Formula to find number
        // of triangle
        // nC3 = n * (n - 1) *
        //           (n - 2) / 6
        return n * (n - 1) *
                   (n - 2) / 6;
    }
 
    // Driver code
    public static void Main()
    {
        int n = 4;
 
        Console.WriteLine(
            countNumberOfTriangles(n));
    }
}
 
// This code is contributed by anuj_67.

Javascript

// javascript program to find the number of
// triangles in a plane if no more
// then two points are collinear.
 
    // Function to find number of triangles
    // in a plane.
    function countNumberOfTriangles(n)
    {
 
        // Formula to find number of triangle
        // nC3 = n * (n - 1) * (n - 2) / 6
        return n * (n - 1) * (n - 2) / 6;
    }
 
    // Driver code
        var n = 4;
        document.write(countNumberOfTriangles(n));
 
// This code is contributed by aashish1995

输出：

4