title: Compute N Under Modulo P
signature: computeNUnderModuloP(n, p) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, p, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n, p), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          85, 18, 
          0)
      }");
  
      print("TEST-1...${driver(
          14, 13, 
          0)
      }");
  
      print("TEST-2...${driver(
          83, 21, 
          0)
      }");
  
      print("TEST-3...${driver(
          30, 35, 
          0)
      }");
  
      print("TEST-4...${driver(
          96, 51, 
          0)
      }");
  
      print("TEST-5...${driver(
          55, 58, 
          0)
      }");
  
      print("TEST-6...${driver(
          82, 71, 
          0)
      }");
  
      print("TEST-7...${driver(
          12, 74, 
          44)
      }");
  
      print("TEST-8...${driver(
          38, 3, 
          0)
      }");
  
      print("TEST-9...${driver(
          46, 73, 
          67)
      }");
  
      return 0;
  }
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;
  }