title: Count Obtuse Angles Circle K Equidistant Points 2 Given Points
signature: pub fn count_obtuse_angles_circle_k_equidistant_points_2_given_points(a: i32, b: i32, k: 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(a: i32, b: i32, k: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(a, b, k), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        83, 98, 86, 
        14
      ));
      
      println!("TEST-1...{}", driver(
        3, 39, 87, 
        35
      ));
      
      println!("TEST-2...{}", driver(
        11, 96, 30, 
        -56
      ));
      
      println!("TEST-3...{}", driver(
        50, 67, 48, 
        16
      ));
      
      println!("TEST-4...{}", driver(
        40, 16, 32, 
        -25
      ));
      
      println!("TEST-5...{}", driver(
        62, 86, 76, 
        23
      ));
      
      println!("TEST-6...{}", driver(
        40, 78, 71, 
        32
      ));
      
      println!("TEST-7...{}", driver(
        66, 11, 74, 
        -56
      ));
      
      println!("TEST-8...{}", driver(
        6, 9, 19, 
        2
      ));
      
      println!("TEST-9...{}", driver(
        25, 5, 5, 
        -21
      ));
      
  }
source_py: def count_obtuse_angles_circle_k_equidistant_points_2_given_points(a, b, k):
      c1 = ((b - a) - 1)
      c2 = ((k - b) + (a - 1))
      if (c1 == c2):
          return 0
      return min(c1, c2)
source_cpp: int count_obtuse_angles_circle_k_equidistant_points_2_given_points(int a, int b, int k) {
    int c1 = ( b - a ) - 1;
    int c2 = ( k - b ) + ( a - 1 );
    if ( c1 == c2 ) return 0;
    return min ( c1, c2 );
  }