title: Fibonacci Modulo P
signature: int fibonacciModuloP(int p) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int p, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(p), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(51, 36); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(40, 30); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(68, 18); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(7, 8); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(8, 6); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(32, 24); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(93, 60); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(75, 100); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(71, 70); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(15, 20); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
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;
  }