title: Number Of Triangles In A Plane If No More Than Two Points Are Collinear
signature: func numberOfTrianglesInAPlaneIfNoMoreThanTwoPointsAreCollinear(n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(67, 47905)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(58, 30856)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(67, 47905)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(60, 34220)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(4, 4)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(97, 147440)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(9, 84)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(16, 560)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(83, 91881)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(87, 105995)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def number_of_triangles_in_a_plane_if_no_more_than_two_points_are_collinear(n):
      return (((n * (n - 1)) * (n - 2)) // 6)
source_cpp: int number_of_triangles_in_a_plane_if_no_more_than_two_points_are_collinear(int n) {
    return n * ( n - 1 ) * ( n - 2 ) / 6;
  }