title: Count Obtuse Angles Circle K Equidistant Points 2 Given Points
signature: fun countObtuseAnglesCircleKEquidistantPoints2GivenPoints(a: Int, b: Int, k: Int): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(a: Int, b: Int, k: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(a, b, k), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(83, 98, 86, 14)
      println("TEST-0...${result}")
      
      result = driver(3, 39, 87, 35)
      println("TEST-1...${result}")
      
      result = driver(11, 96, 30, -56)
      println("TEST-2...${result}")
      
      result = driver(50, 67, 48, 16)
      println("TEST-3...${result}")
      
      result = driver(40, 16, 32, -25)
      println("TEST-4...${result}")
      
      result = driver(62, 86, 76, 23)
      println("TEST-5...${result}")
      
      result = driver(40, 78, 71, 32)
      println("TEST-6...${result}")
      
      result = driver(66, 11, 74, -56)
      println("TEST-7...${result}")
      
      result = driver(6, 9, 19, 2)
      println("TEST-8...${result}")
      
      result = driver(25, 5, 5, -21)
      println("TEST-9...${result}")
      
          
  }
  
  main()
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 );
  }