title: Fibonacci Modulo P
signature: pub fn fibonacci_modulo_p(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(p: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(p), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        51, 
        36
      ));
      
      println!("TEST-1...{}", driver(
        40, 
        30
      ));
      
      println!("TEST-2...{}", driver(
        68, 
        18
      ));
      
      println!("TEST-3...{}", driver(
        7, 
        8
      ));
      
      println!("TEST-4...{}", driver(
        8, 
        6
      ));
      
      println!("TEST-5...{}", driver(
        32, 
        24
      ));
      
      println!("TEST-6...{}", driver(
        93, 
        60
      ));
      
      println!("TEST-7...{}", driver(
        75, 
        100
      ));
      
      println!("TEST-8...{}", driver(
        71, 
        70
      ));
      
      println!("TEST-9...{}", driver(
        15, 
        20
      ));
      
  }
source_py: def fibonacci_modulo_p(p):
      first = 1
      second = 1
      number = 2
      next = 1
      while next:
          next = ((first + second) % p)
          first = second
          second = next
          number = (number + 1)
      return number
source_cpp: int fibonacci_modulo_p(int p) {
    int first = 1, second = 1, number = 2, next = 1;
    while ( next ) {
      next = ( first + second ) % p;
      first = second;
      second = next;
      number ++;
    }
    return number;
  }