title: Sequences Given Length Every Element Equal Twice Previous 1
signature: sequencesGivenLengthEveryElementEqualTwicePrevious1(m, n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(m, n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(m, n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          10, 4, 
          4)
      }");
  
      print("TEST-1...${driver(
          5, 2, 
          6)
      }");
  
      print("TEST-2...${driver(
          2, 8, 
          0)
      }");
  
      print("TEST-3...${driver(
          83, 7, 
          330)
      }");
  
      print("TEST-4...${driver(
          91, 0, 
          0)
      }");
  
      print("TEST-5...${driver(
          18, 53, 
          0)
      }");
  
      print("TEST-6...${driver(
          83, 41, 
          0)
      }");
  
      print("TEST-7...${driver(
          98, 53, 
          0)
      }");
  
      print("TEST-8...${driver(
          43, 37, 
          0)
      }");
  
      print("TEST-9...${driver(
          31, 20, 
          0)
      }");
  
      return 0;
  }
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 ];
  }