title: Find N Th Element From Sterns Diatomic Series
signature: findNThElementFromSternsDiatomicSeries :: Integer -> Integer
  findNThElementFromSternsDiatomicSeries n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      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) )
  
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 ];
  }