title: Double Factorial 1
signature: long long doubleFactorial1(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(24, 1961990553600); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(3, 3); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(22, 81749606400); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(2, 2); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(30, 42849873690624000); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(2, 2); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def double_factorial_1(n):
      res = 1
      for i in range(n, (- 1), (- 2)):
          if ((i == 0) or (i == 1)):
              return res
          else:
              res *= i
source_cpp: unsigned int double_factorial_1(unsigned int n) {
    int res = 1;
    for ( int i = n;
    i >= 0;
    i = i - 2 ) {
      if ( i == 0 || i == 1 ) return res;
      else res *= i;
    }
  }