title: Pizza Cut Problem Circle Division Lines
signature: pub fn pizza_cut_problem_circle_division_lines(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(
        46, 
        1082
      ));
      
      println!("TEST-1...{}", driver(
        68, 
        2347
      ));
      
      println!("TEST-2...{}", driver(
        4, 
        11
      ));
      
      println!("TEST-3...{}", driver(
        12, 
        79
      ));
      
      println!("TEST-4...{}", driver(
        56, 
        1597
      ));
      
      println!("TEST-5...{}", driver(
        14, 
        106
      ));
      
      println!("TEST-6...{}", driver(
        81, 
        3322
      ));
      
      println!("TEST-7...{}", driver(
        29, 
        436
      ));
      
      println!("TEST-8...{}", driver(
        26, 
        352
      ));
      
      println!("TEST-9...{}", driver(
        40, 
        821
      ));
      
  }
source_py: def pizza_cut_problem_circle_division_lines(n):
      return int((1 + ((n * (n + 1)) / 2)))
source_cpp: int pizza_cut_problem_circle_division_lines(int n) {
    return 1 + n * ( n + 1 ) / 2;
  }