title: Maximum Points Intersection N Circles
signature: pub fn maximum_points_intersection_n_circles(n: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        30, 
        870
      ));
      
      println!("TEST-1...{}", driver(
        25, 
        600
      ));
      
      println!("TEST-2...{}", driver(
        69, 
        4692
      ));
      
      println!("TEST-3...{}", driver(
        39, 
        1482
      ));
      
      println!("TEST-4...{}", driver(
        14, 
        182
      ));
      
      println!("TEST-5...{}", driver(
        60, 
        3540
      ));
      
      println!("TEST-6...{}", driver(
        89, 
        7832
      ));
      
      println!("TEST-7...{}", driver(
        27, 
        702
      ));
      
      println!("TEST-8...{}", driver(
        29, 
        812
      ));
      
      println!("TEST-9...{}", driver(
        29, 
        812
      ));
      
  }
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 );
  }