title: Number Of Triangles In A Plane If No More Than Two Points Are Collinear
signature: function number_of_triangles_in_a_plane_if_no_more_than_two_points_are_collinear(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(67, 47905);
      @printf("TEST-0...%s\n",result);
      
      result = driver(58, 30856);
      @printf("TEST-1...%s\n",result);
      
      result = driver(67, 47905);
      @printf("TEST-2...%s\n",result);
      
      result = driver(60, 34220);
      @printf("TEST-3...%s\n",result);
      
      result = driver(4, 4);
      @printf("TEST-4...%s\n",result);
      
      result = driver(97, 147440);
      @printf("TEST-5...%s\n",result);
      
      result = driver(9, 84);
      @printf("TEST-6...%s\n",result);
      
      result = driver(16, 560);
      @printf("TEST-7...%s\n",result);
      
      result = driver(83, 91881);
      @printf("TEST-8...%s\n",result);
      
      result = driver(87, 105995);
      @printf("TEST-9...%s\n",result);
      
  end
  
  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;
  }