title: Padovan Sequence
signature: long long padovanSequence(int n) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(long long actual, long long expected){
      return actual == expected;
  }
  
  string driver(int n, long long expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(1, 1); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(92, 124155792775); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(29, 2513); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(52, 1618192); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(55, 3761840); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(13, 28); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(83, 9882257736); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(83, 9882257736); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(10, 12); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(67, 109870576); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
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;
  }