title: Count Ofdifferent Ways Express N Sum 1 3 4
signature: long long countOfdifferentWaysExpressNSum134(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(44, 821223649); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(9, 40); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(19, 4895); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(10, 64); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(78, 10472279279564025); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(70, 222915410843904); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(81, 44361286907595736); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(81, 44361286907595736); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(49, 9107509825); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def count_ofdifferent_ways_express_n_sum_1_3_4(n):
      DP = [0 for i in range(0, (n + 1))]
      DP[0] = DP[1] = DP[2] = 1
      DP[3] = 2
      for i in range(4, (n + 1)):
          DP[i] = ((DP[(i - 1)] + DP[(i - 3)]) + DP[(i - 4)])
      return DP[n]
source_cpp: int count_ofdifferent_ways_express_n_sum_1_3_4(int n) {
    int DP [ n + 1 ];
    DP [ 0 ] = DP [ 1 ] = DP [ 2 ] = 1;
    DP [ 3 ] = 2;
    for ( int i = 4;
    i <= n;
    i ++ ) DP [ i ] = DP [ i - 1 ] + DP [ i - 3 ] + DP [ i - 4 ];
    return DP [ n ];
  }