title: Dyck Path
signature: func dyckPath(n int) float64 {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual float64, expected float64) bool {
      return math.Abs(actual - expected) < 1e-09
  }
  
  func driver(n int, expected float64) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(28, 263747951750360.03)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(13, 742900.0)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(7, 429.0)
      fmt.Printf("TEST-2...%s\n", result)
      
          
  }
source_py: def dyck_path(n):
      res = 1
      for i in range(0, n):
          res *= ((2 * n) - i)
          res /= (i + 1)
      return (res / (n + 1))
source_cpp: int dyck_path(unsigned int n) {
    int res = 1;
    for ( int i = 0;
    i < n;
    ++ i ) {
      res *= ( 2 * n - i );
      res /= ( i + 1 );
    }
    return res / ( n + 1 );
  }