title: Find N Th Element From Sterns Diatomic Series
signature: function findNThElementFromSternsDiatomicSeries($n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        37, 
        11));
      
      printf("TEST-1...%s\n",driver(
        24, 
        2));
      
      printf("TEST-2...%s\n",driver(
        13, 
        5));
      
      printf("TEST-3...%s\n",driver(
        56, 
        3));
      
      printf("TEST-4...%s\n",driver(
        26, 
        5));
      
      printf("TEST-5...%s\n",driver(
        67, 
        11));
      
      printf("TEST-6...%s\n",driver(
        82, 
        11));
      
      printf("TEST-7...%s\n",driver(
        60, 
        4));
      
      printf("TEST-8...%s\n",driver(
        64, 
        1));
      
      printf("TEST-9...%s\n",driver(
        65, 
        7));
      
  }
  
  main();
  ?>
source_py: def find_n_th_element_from_sterns_diatomic_series(n):
      DP = ([0] * (n + 1))
      DP[0] = 0
      DP[1] = 1
      for i in range(2, (n + 1)):
          if (int((i % 2)) == 0):
              DP[i] = DP[int((i / 2))]
          else:
              DP[i] = (DP[int(((i - 1) / 2))] + DP[int(((i + 1) / 2))])
      return DP[n]
source_cpp: int find_n_th_element_from_sterns_diatomic_series(int n) {
    int DP [ n + 1 ];
    DP [ 0 ] = 0;
    DP [ 1 ] = 1;
    for ( int i = 2;
    i <= n;
    i ++ ) {
      if ( i % 2 == 0 ) DP [ i ] = DP [ i / 2 ];
      else DP [ i ] = DP [ ( i - 1 ) / 2 ] + DP [ ( i + 1 ) / 2 ];
    }
    return DP [ n ];
  }