title: Sequences Given Length Every Element Equal Twice Previous 1
signature: func sequencesGivenLengthEveryElementEqualTwicePrevious1(m int, n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(m int, n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(m, n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(10, 
  	4, 4)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(5, 
  	2, 6)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(2, 
  	8, 0)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(83, 
  	7, 330)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(91, 
  	0, 0)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(18, 
  	53, 0)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(83, 
  	41, 0)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(98, 
  	53, 0)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(43, 
  	37, 0)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(31, 
  	20, 0)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def sequences_given_length_every_element_equal_twice_previous_1(m, n):
      T = [[0 for i in range((n + 1))] for i in range((m + 1))]
      for i in range((m + 1)):
          for j in range((n + 1)):
              if ((i == 0) or (j == 0)):
                  T[i][j] = 0
              elif (i < j):
                  T[i][j] = 0
              elif (j == 1):
                  T[i][j] = i
              else:
                  T[i][j] = (T[(i - 1)][j] + T[(i // 2)][(j - 1)])
      return T[m][n]
source_cpp: int sequences_given_length_every_element_equal_twice_previous_1(int m, int n) {
    int T [ m + 1 ] [ n + 1 ];
    for ( int i = 0;
    i < m + 1;
    i ++ ) {
      for ( int j = 0;
      j < n + 1;
      j ++ ) {
        if ( i == 0 || j == 0 ) T [ i ] [ j ] = 0;
        else if ( i < j ) T [ i ] [ j ] = 0;
        else if ( j == 1 ) T [ i ] [ j ] = i;
        else T [ i ] [ j ] = T [ i - 1 ] [ j ] + T [ i / 2 ] [ j - 1 ];
      }
    }
    return T [ m ] [ n ];
  }