title: Count Obtuse Angles Circle K Equidistant Points 2 Given Points
signature: countObtuseAnglesCircleKEquidistantPoints2GivenPoints :: Integer -> Integer -> Integer -> Integer
  countObtuseAnglesCircleKEquidistantPoints2GivenPoints a b k = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> Integer -> Integer -> String
  driver a b k expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME a b k) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (83) (98) (86) (14) )
  
      printf "TEST-1...%s\n" (driver (3) (39) (87) (35) )
  
      printf "TEST-2...%s\n" (driver (11) (96) (30) (-56) )
  
      printf "TEST-3...%s\n" (driver (50) (67) (48) (16) )
  
      printf "TEST-4...%s\n" (driver (40) (16) (32) (-25) )
  
      printf "TEST-5...%s\n" (driver (62) (86) (76) (23) )
  
      printf "TEST-6...%s\n" (driver (40) (78) (71) (32) )
  
      printf "TEST-7...%s\n" (driver (66) (11) (74) (-56) )
  
      printf "TEST-8...%s\n" (driver (6) (9) (19) (2) )
  
      printf "TEST-9...%s\n" (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 );
  }