title: Padovan Sequence
signature: padovanSequence :: Integer -> Integer
  padovanSequence 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 (1) (1) )
  
      printf "TEST-1...%s\n" (driver (92) (124155792775) )
  
      printf "TEST-2...%s\n" (driver (29) (2513) )
  
      printf "TEST-3...%s\n" (driver (52) (1618192) )
  
      printf "TEST-4...%s\n" (driver (55) (3761840) )
  
      printf "TEST-5...%s\n" (driver (13) (28) )
  
      printf "TEST-6...%s\n" (driver (83) (9882257736) )
  
      printf "TEST-7...%s\n" (driver (83) (9882257736) )
  
      printf "TEST-8...%s\n" (driver (10) (12) )
  
      printf "TEST-9...%s\n" (driver (67) (109870576) )
  
source_py: def padovan_sequence(n):
      (pPrevPrev, pPrev, pCurr, pNext) = (1, 1, 1, 1)
      for i in range(3, (n + 1)):
          pNext = (pPrevPrev + pPrev)
          pPrevPrev = pPrev
          pPrev = pCurr
          pCurr = pNext
      return pNext
source_cpp: int padovan_sequence(int n) {
    int pPrevPrev = 1, pPrev = 1, pCurr = 1, pNext = 1;
    for ( int i = 3;
    i <= n;
    i ++ ) {
      pNext = pPrevPrev + pPrev;
      pPrevPrev = pPrev;
      pPrev = pCurr;
      pCurr = pNext;
    }
    return pNext;
  }