title: Number Of Triangles In A Plane If No More Than Two Points Are Collinear
signature: numberOfTrianglesInAPlaneIfNoMoreThanTwoPointsAreCollinear(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          67, 
          47905)
      }");
  
      print("TEST-1...${driver(
          58, 
          30856)
      }");
  
      print("TEST-2...${driver(
          67, 
          47905)
      }");
  
      print("TEST-3...${driver(
          60, 
          34220)
      }");
  
      print("TEST-4...${driver(
          4, 
          4)
      }");
  
      print("TEST-5...${driver(
          97, 
          147440)
      }");
  
      print("TEST-6...${driver(
          9, 
          84)
      }");
  
      print("TEST-7...${driver(
          16, 
          560)
      }");
  
      print("TEST-8...${driver(
          83, 
          91881)
      }");
  
      print("TEST-9...${driver(
          87, 
          105995)
      }");
  
      return 0;
  }
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;
  }