title: Sum Of All Elements Up To Nth Row In A Pascals Triangle 1
signature: def sum_of_all_elements_up_to_nth_row_in_a_pascals_triangle_1(n):
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(n, expected):
      try:
          if validate_solution(PLACEHOLDER_FN_NAME(
              n),
              expected
          ):
              return "PASSED"
          return "FAILED"
      except Exception as exception_obj:
          return type(exception_obj).__name__
      
  if __name__ == "__main__":
      result = driver(53, 9007199254740991)
      print(f"TEST-0...{result}")
  
      result = driver(3, 7)
      print(f"TEST-1...{result}")
  
      result = driver(28, 268435455)
      print(f"TEST-2...{result}")
  
      result = driver(44, 17592186044415)
      print(f"TEST-3...{result}")
  
      result = driver(46, 70368744177663)
      print(f"TEST-4...{result}")
  
      result = driver(3, 7)
      print(f"TEST-5...{result}")
  
      result = driver(16, 65535)
      print(f"TEST-6...{result}")
  
      sys.exit(0)
source_py: def sum_of_all_elements_up_to_nth_row_in_a_pascals_triangle_1(n):
      sum = 0
      sum = (1 << n)
      return (sum - 1)
source_cpp: long long int sum_of_all_elements_up_to_nth_row_in_a_pascals_triangle_1(int n) {
    long long int sum = 0;
    sum = 1 << n;
    return ( sum - 1 );
  }