title: Count Ofdifferent Ways Express N Sum 1 3 4
signature: countOfdifferentWaysExpressNSum134(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          44, 
          821223649)
      }");
  
      print("TEST-1...${driver(
          9, 
          40)
      }");
  
      print("TEST-2...${driver(
          19, 
          4895)
      }");
  
      print("TEST-3...${driver(
          10, 
          64)
      }");
  
      print("TEST-4...${driver(
          78, 
          10472279279564025)
      }");
  
      print("TEST-5...${driver(
          70, 
          222915410843904)
      }");
  
      print("TEST-6...${driver(
          81, 
          44361286907595736)
      }");
  
      print("TEST-7...${driver(
          81, 
          44361286907595736)
      }");
  
      print("TEST-8...${driver(
          49, 
          9107509825)
      }");
  
      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 ];
  }