title: Sum Binomial Coefficients 1
signature: sumBinomialCoefficients1 :: Integer -> Integer
  sumBinomialCoefficients1 n = 
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 -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (48) (281474976710656) )
  
      printf "TEST-1...%s\n" (driver (42) (4398046511104) )
  
      printf "TEST-2...%s\n" (driver (15) (32768) )
  
      printf "TEST-3...%s\n" (driver (23) (8388608) )
  
      printf "TEST-4...%s\n" (driver (41) (2199023255552) )
  
      printf "TEST-5...%s\n" (driver (46) (70368744177664) )
  
      printf "TEST-6...%s\n" (driver (36) (68719476736) )
  
      printf "TEST-7...%s\n" (driver (53) (9007199254740992) )
  
source_py: def sum_binomial_coefficients_1(n):
      return (1 << n)
source_cpp: int sum_binomial_coefficients_1(int n) {
    return ( 1 << n );
  }