title: Count Ofdifferent Ways Express N Sum 1 3 4
signature: function countOfdifferentWaysExpressNSum134($n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        44, 
        821223649));
      
      printf("TEST-1...%s\n",driver(
        9, 
        40));
      
      printf("TEST-2...%s\n",driver(
        19, 
        4895));
      
      printf("TEST-3...%s\n",driver(
        10, 
        64));
      
      printf("TEST-4...%s\n",driver(
        78, 
        10472279279564025));
      
      printf("TEST-5...%s\n",driver(
        70, 
        222915410843904));
      
      printf("TEST-6...%s\n",driver(
        81, 
        44361286907595736));
      
      printf("TEST-7...%s\n",driver(
        81, 
        44361286907595736));
      
      printf("TEST-8...%s\n",driver(
        49, 
        9107509825));
      
  }
  
  main();
  ?>
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 ];
  }