title: Number Of Triangles In A Plane If No More Than Two Points Are Collinear
signature: function numberOfTrianglesInAPlaneIfNoMoreThanTwoPointsAreCollinear($n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        67, 
        47905));
      
      printf("TEST-1...%s\n",driver(
        58, 
        30856));
      
      printf("TEST-2...%s\n",driver(
        67, 
        47905));
      
      printf("TEST-3...%s\n",driver(
        60, 
        34220));
      
      printf("TEST-4...%s\n",driver(
        4, 
        4));
      
      printf("TEST-5...%s\n",driver(
        97, 
        147440));
      
      printf("TEST-6...%s\n",driver(
        9, 
        84));
      
      printf("TEST-7...%s\n",driver(
        16, 
        560));
      
      printf("TEST-8...%s\n",driver(
        83, 
        91881));
      
      printf("TEST-9...%s\n",driver(
        87, 
        105995));
      
  }
  
  main();
  ?>
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;
  }