title: Count Obtuse Angles Circle K Equidistant Points 2 Given Points
signature: def count_obtuse_angles_circle_k_equidistant_points_2_given_points(a, b, k):
test_code: import array
  import bisect
  import collections
  import datetime
  import functools
  import heapq
  import itertools
  import math
  import queue
  import re
  import string
  import sys
  from typing import Any, Dict, List, Optional, Set
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  def validate_solution(actual, expected):
      return actual == expected
  
  def driver(a, b, k, expected):
      try:
          if validate_solution(PLACEHOLDER_FN_NAME(
              a, b, k),
              expected
          ):
              return "PASSED"
          return "FAILED"
      except Exception as exception_obj:
          return type(exception_obj).__name__
      
  if __name__ == "__main__":
      result = driver(83, 98, 86, 14)
      print(f"TEST-0...{result}")
  
      result = driver(3, 39, 87, 35)
      print(f"TEST-1...{result}")
  
      result = driver(11, 96, 30, -56)
      print(f"TEST-2...{result}")
  
      result = driver(50, 67, 48, 16)
      print(f"TEST-3...{result}")
  
      result = driver(40, 16, 32, -25)
      print(f"TEST-4...{result}")
  
      result = driver(62, 86, 76, 23)
      print(f"TEST-5...{result}")
  
      result = driver(40, 78, 71, 32)
      print(f"TEST-6...{result}")
  
      result = driver(66, 11, 74, -56)
      print(f"TEST-7...{result}")
  
      result = driver(6, 9, 19, 2)
      print(f"TEST-8...{result}")
  
      result = driver(25, 5, 5, -21)
      print(f"TEST-9...{result}")
  
      sys.exit(0)
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 );
  }