title: Compute Ncr P Set 1 Introduction And Dynamic Programming Solution
signature: func computeNcrPSet1IntroductionAndDynamicProgrammingSolution(n int, r int, p int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, r int, p int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n, r, p),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(82, 
  	5, 
  	94, 50)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(45, 
  	24, 
  	95, 80)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(44, 
  	68, 
  	61, 0)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(88, 
  	24, 
  	43, 0)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(90, 
  	75, 
  	57, 0)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(98, 
  	55, 
  	43, 2)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(80, 
  	54, 
  	88, 0)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(60, 
  	75, 
  	65, 0)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(52, 
  	73, 
  	86, 0)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(71, 
  	26, 
  	45, 12)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def compute_ncr_p_set_1_introduction_and_dynamic_programming_solution(n, r, p):
      C = [0 for i in range((r + 1))]
      C[0] = 1
      for i in range(1, (n + 1)):
          for j in range(min(i, r), 0, (- 1)):
              C[j] = ((C[j] + C[(j - 1)]) % p)
      return C[r]
source_cpp: int compute_ncr_p_set_1_introduction_and_dynamic_programming_solution(int n, int r, int p) {
    int C [ r + 1 ];
    memset ( C, 0, sizeof ( C ) );
    C [ 0 ] = 1;
    for ( int i = 1;
    i <= n;
    i ++ ) {
      for ( int j = min ( i, r );
      j > 0;
      j -- ) C [ j ] = ( C [ j ] + C [ j - 1 ] ) % p;
    }
    return C [ r ];
  }