title: Compute Ncr P Set 1 Introduction And Dynamic Programming Solution
signature: fun computeNcrPSet1IntroductionAndDynamicProgrammingSolution(n: Int, r: Int, p: Int): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(n: Int, r: Int, p: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(n, r, p), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(82, 5, 94, 50)
      println("TEST-0...${result}")
      
      result = driver(45, 24, 95, 80)
      println("TEST-1...${result}")
      
      result = driver(44, 68, 61, 0)
      println("TEST-2...${result}")
      
      result = driver(88, 24, 43, 0)
      println("TEST-3...${result}")
      
      result = driver(90, 75, 57, 0)
      println("TEST-4...${result}")
      
      result = driver(98, 55, 43, 2)
      println("TEST-5...${result}")
      
      result = driver(80, 54, 88, 0)
      println("TEST-6...${result}")
      
      result = driver(60, 75, 65, 0)
      println("TEST-7...${result}")
      
      result = driver(52, 73, 86, 0)
      println("TEST-8...${result}")
      
      result = driver(71, 26, 45, 12)
      println("TEST-9...${result}")
      
          
  }
  
  main()
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 ];
  }