title: Maximum Points Intersection N Circles
signature: maximumPointsIntersectionNCircles(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(
          30, 
          870)
      }");
  
      print("TEST-1...${driver(
          25, 
          600)
      }");
  
      print("TEST-2...${driver(
          69, 
          4692)
      }");
  
      print("TEST-3...${driver(
          39, 
          1482)
      }");
  
      print("TEST-4...${driver(
          14, 
          182)
      }");
  
      print("TEST-5...${driver(
          60, 
          3540)
      }");
  
      print("TEST-6...${driver(
          89, 
          7832)
      }");
  
      print("TEST-7...${driver(
          27, 
          702)
      }");
  
      print("TEST-8...${driver(
          29, 
          812)
      }");
  
      print("TEST-9...${driver(
          29, 
          812)
      }");
  
      return 0;
  }
source_py: def maximum_points_intersection_n_circles(n):
      return (n * (n - 1))
source_cpp: int maximum_points_intersection_n_circles(int n) {
    return n * ( n - 1 );
  }