title: Eulerian Number 1
signature: pub fn eulerian_number_1(n: i32, m: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, m: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n, m), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        6, 10, 
        0
      ));
      
      println!("TEST-1...{}", driver(
        26, 33, 
        0
      ));
      
      println!("TEST-2...{}", driver(
        74, 86, 
        0
      ));
      
      println!("TEST-3...{}", driver(
        65, 97, 
        0
      ));
      
  }
source_py: def eulerian_number_1(n, m):
      dp = [[0 for x in range((m + 1))] for y in range((n + 1))]
      for i in range(1, (n + 1)):
          for j in range(0, (m + 1)):
              if (i > j):
                  if (j == 0):
                      dp[i][j] = 1
                  else:
                      dp[i][j] = (((i - j) * dp[(i - 1)][(j - 1)]) + ((j + 1) * dp[(i - 1)][j]))
      return dp[n][m]
source_cpp: int eulerian_number_1(int n, int m) {
    int dp [ n + 1 ] [ m + 1 ];
    memset ( dp, 0, sizeof ( dp ) );
    for ( int i = 1;
    i <= n;
    i ++ ) {
      for ( int j = 0;
      j <= m;
      j ++ ) {
        if ( i > j ) {
          if ( j == 0 ) dp [ i ] [ j ] = 1;
          else dp [ i ] [ j ] = ( ( i - j ) * dp [ i - 1 ] [ j - 1 ] ) + ( ( j + 1 ) * dp [ i - 1 ] [ j ] );
        }
      }
    }
    return dp [ n ] [ m ];
  }