/**
 * @file
 * @brief simple implementation of adaption modular multiplicative inverse
 * algorithm
 *
 * @details
 * this algorithm calculate the modular inverse iteratively
 *
 * @ref
 * https://en.wikipedia.org/wiki/Modular_multiplicative_inverse
 */

#include <cassert>
#include <iostream>

using namespace std;

/**
 * @brief Function imod
 *  Responsible for calculating the modular inverse from x % y
 * @param x number
 * @param y number
 * @returns the modular inverse
 */
int imod(int x, int y) {
    int aux = 0;
    int itr = 0;

    do {  // run the algorithm while not find the inverse
        aux = y * itr + 1;
        itr++;
    } while (aux % x);  // while module aux % x is different of zero

    return aux / x;
}

/**
 * @brief Some test cases
 * @returns void
 */
static void test() {
    cout << "First case testing... \n";
    // for a = 3 and b = 11 return 4
    cout << imod(3, 11) << endl;
    assert(imod(3, 11) == 4);
    cout << "\nPassed!\n";

    cout << "Second case testing... \n";
    // for a = 3 and b = 26 return 9
    assert(imod(3, 26) == 9);
    cout << "\nPassed!\n";

    cout << "Third case testing... \n";
    // for a = 7 and b = 26 return 15
    assert(imod(7, 26) == 15);
    cout << "\nPassed!\n";

    cout << "\nAll test cases have successfully passed!\n";
}
/**
 * @brief Main function
 * @returns 0 on exit
 */
int main() {
    test();  // run tests implementations
};