title: Sum Of All Elements Up To Nth Row In A Pascals Triangle 1
signature: pub fn sum_of_all_elements_up_to_nth_row_in_a_pascals_triangle_1(n: i32) -> i64 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i64, expected: i64)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i64)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        53, 
        9007199254740991
      ));
      
      println!("TEST-1...{}", driver(
        3, 
        7
      ));
      
      println!("TEST-2...{}", driver(
        28, 
        268435455
      ));
      
      println!("TEST-3...{}", driver(
        44, 
        17592186044415
      ));
      
      println!("TEST-4...{}", driver(
        46, 
        70368744177663
      ));
      
      println!("TEST-5...{}", driver(
        3, 
        7
      ));
      
      println!("TEST-6...{}", driver(
        16, 
        65535
      ));
      
  }
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 );
  }