title: Padovan Sequence
signature: function padovan_sequence(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(1, 1);
      @printf("TEST-0...%s\n",result);
      
      result = driver(92, 124155792775);
      @printf("TEST-1...%s\n",result);
      
      result = driver(29, 2513);
      @printf("TEST-2...%s\n",result);
      
      result = driver(52, 1618192);
      @printf("TEST-3...%s\n",result);
      
      result = driver(55, 3761840);
      @printf("TEST-4...%s\n",result);
      
      result = driver(13, 28);
      @printf("TEST-5...%s\n",result);
      
      result = driver(83, 9882257736);
      @printf("TEST-6...%s\n",result);
      
      result = driver(83, 9882257736);
      @printf("TEST-7...%s\n",result);
      
      result = driver(10, 12);
      @printf("TEST-8...%s\n",result);
      
      result = driver(67, 109870576);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
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;
  }