title: Sequences Given Length Every Element Equal Twice Previous 1
signature: class Solution {
  
      public int SequencesGivenLengthEveryElementEqualTwicePrevious1(int m, int n) {
test_code: using System;
  using System.Numerics;
  using System.Diagnostics;
  using System.Collections.Generic;
  using System.Linq;
  using System.Text;
  using System.Security.Cryptography;
  using System.Web.UI;
  using System.Web.Script.Serialization;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  namespace EvaluatePrediction {
      class TestRunner {
          public bool ValidateSolution(int actual, int expected){
              return new JavaScriptSerializer().Serialize(actual) == new JavaScriptSerializer().Serialize(expected);
          }
  
          public string driver(int m, int n, int expected){
              try{
                PLACEHOLDER_CLS_NAME solution_cls = new PLACEHOLDER_CLS_NAME();
                int pred_result = solution_cls.PLACEHOLDER_FN_NAME(m, n); 
                if (ValidateSolution(
                      pred_result,
                      expected)){
                  return "PASSED";
                }
                return "FAILED";
              } 
              catch (Exception exception_obj)
              {
                return exception_obj.GetType().FullName;
              }
          }
          static void Main(string[] args) {
              TestRunner runner = new TestRunner();
              String result;
              result = runner.driver(
                  10, 4, 
                  4
              );
              Console.WriteLine(string.Format(
                  "TEST-0...{0}",
                  result)
              );result = runner.driver(
                  5, 2, 
                  6
              );
              Console.WriteLine(string.Format(
                  "TEST-1...{0}",
                  result)
              );result = runner.driver(
                  2, 8, 
                  0
              );
              Console.WriteLine(string.Format(
                  "TEST-2...{0}",
                  result)
              );result = runner.driver(
                  83, 7, 
                  330
              );
              Console.WriteLine(string.Format(
                  "TEST-3...{0}",
                  result)
              );result = runner.driver(
                  91, 0, 
                  0
              );
              Console.WriteLine(string.Format(
                  "TEST-4...{0}",
                  result)
              );result = runner.driver(
                  18, 53, 
                  0
              );
              Console.WriteLine(string.Format(
                  "TEST-5...{0}",
                  result)
              );result = runner.driver(
                  83, 41, 
                  0
              );
              Console.WriteLine(string.Format(
                  "TEST-6...{0}",
                  result)
              );result = runner.driver(
                  98, 53, 
                  0
              );
              Console.WriteLine(string.Format(
                  "TEST-7...{0}",
                  result)
              );result = runner.driver(
                  43, 37, 
                  0
              );
              Console.WriteLine(string.Format(
                  "TEST-8...{0}",
                  result)
              );result = runner.driver(
                  31, 20, 
                  0
              );
              Console.WriteLine(string.Format(
                  "TEST-9...{0}",
                  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 ];
  }