title: Sum Binomial Coefficients 1
signature: function sum_binomial_coefficients_1(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(48, 281474976710656);
      @printf("TEST-0...%s\n",result);
      
      result = driver(42, 4398046511104);
      @printf("TEST-1...%s\n",result);
      
      result = driver(15, 32768);
      @printf("TEST-2...%s\n",result);
      
      result = driver(23, 8388608);
      @printf("TEST-3...%s\n",result);
      
      result = driver(41, 2199023255552);
      @printf("TEST-4...%s\n",result);
      
      result = driver(46, 70368744177664);
      @printf("TEST-5...%s\n",result);
      
      result = driver(36, 68719476736);
      @printf("TEST-6...%s\n",result);
      
      result = driver(53, 9007199254740992);
      @printf("TEST-7...%s\n",result);
      
  end
  
  main()
source_py: def sum_binomial_coefficients_1(n):
      return (1 << n)
source_cpp: int sum_binomial_coefficients_1(int n) {
    return ( 1 << n );
  }