title: Eulerian Number 1
signature: function eulerianNumber1(n, m) {
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 ];
  }