title: Compute N Under Modulo P
signature: pub fn compute_n_under_modulo_p(n: i32, p: 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, p: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n, p), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        85, 18, 
        0
      ));
      
      println!("TEST-1...{}", driver(
        14, 13, 
        0
      ));
      
      println!("TEST-2...{}", driver(
        83, 21, 
        0
      ));
      
      println!("TEST-3...{}", driver(
        30, 35, 
        0
      ));
      
      println!("TEST-4...{}", driver(
        96, 51, 
        0
      ));
      
      println!("TEST-5...{}", driver(
        55, 58, 
        0
      ));
      
      println!("TEST-6...{}", driver(
        82, 71, 
        0
      ));
      
      println!("TEST-7...{}", driver(
        12, 74, 
        44
      ));
      
      println!("TEST-8...{}", driver(
        38, 3, 
        0
      ));
      
      println!("TEST-9...{}", driver(
        46, 73, 
        67
      ));
      
  }
source_py: def compute_n_under_modulo_p(n, p):
      if (n >= p):
          return 0
      result = 1
      for i in range(1, (n + 1)):
          result = ((result * i) % p)
      return result
source_cpp: int compute_n_under_modulo_p(int n, int p) {
    if ( n >= p ) return 0;
    int result = 1;
    for ( int i = 1;
    i <= n;
    i ++ ) result = ( result * i ) % p;
    return result;
  }