mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-02-03 02:25:57 +08:00
* fix: add <cstdint> to subset_sum.cpp * fix: add <cstdint> to subarray_sum.cpp * fix: add <cstdint> to wildcard_matching.cpp * fix: add <cstdint> to count_bit_flips.cpp * fix: add <cstdint> to count_of_set_bits.cpp * fix: add <cstdint> to trailing_ciphers.cpp * fix: add <cstdint> to hamming_distance.cpp * doc: include doc for hamming_distance * fix: add <cstdint> to next_higher_numebr_with_same_number_of_set_bits.cpp * fix: add <cstdint> to power_of_2.cpp * fix: add <cstdint> to set_kth_bit.cpp * fix: add <cstdint> to bit_manipulation/set_kth_bit.cpp * fix: add <cstdint> to bit_manipulation/travelling_salesman_using_bit_manipulation.cpp * fix: add <cstdint> to ciphers/base64_encoding.cpp * fix: add <cstdint> to ciphers/hill_cipher.cpp * fix: add <cstdint> to ciphers/uint128_t.hpp * fix: add <cstdint> to data_structures/dsu_path_compression.cpp * fix: add <cstdint> to data_structures/dsu_path_compression.cpp * fix add <cstdint> to datastructures/list_array>cpp * fix add <cstdint> to datastructures/queue_using_array.cpp * fix: add <cstdint> to sparse_table.cpp * fix: add <cstdint> to stack_using_list_queue.cpp * fix: add <cstdint> to treap.cpp * fix: add <cstdint> to graham_scan_functions.hpp * fix: add <cstdint> to graph/** * fix: add integral typdefs to hashing/** * fix: add <cstdint> to math/** * fix: add <cstdint> to numerical_methods/** * fix: add <cstdint> to other/** * fix: add <cstdint> to search/** * fix: add <cstdint> to sorting/** * fix: add <cstdint> to string/** * doc: remove include statement from comment * fix: make tests static Co-authored-by: David Leal <halfpacho@gmail.com> * fix: make tests static Co-authored-by: David Leal <halfpacho@gmail.com> * chore: use iwyu on backtracking/**.cpp * chore: use iwyu on bit_manip/**.cpp * chore: use iwyu on ciphers/**.cpp * chore: use iwyu on cpu_scheduling_algorithms/**.cpp * chore: use iwyu on data_structures/**.cpp * chore: use iwyu on divide_and_conquer/**.cpp * chore: use iwyu on geometry/**.cpp * chore: use iwyu on graph/**.cpp * chore: use iwyu on hashing/**.cpp * chore: use iwyu on machine_learning/**.cpp * chore: use iwyu on math/**.cpp * chore: use iwyu on numerical_methods/**.cpp * chore: use iwyu on others/**.cpp * chore: use iwyu on probablity/**.cpp * chore: use iwyu on search/**.cpp * chore: use iwyu on sorting/**.cpp * chore: use iwyu on strings/**.cpp * Revert "chore: use iwyu on strings/**.cpp" This reverts commitf2127456a8. * Revert "chore: use iwyu on sorting/**.cpp" This reverts commita290ae7ee2. * Revert "chore: use iwyu on search/**.cpp" This reverts commit19d136ae0f. * Revert "chore: use iwyu on probablity/**.cpp" This reverts commit5dd7f82a34. * Revert "chore: use iwyu on others/**.cpp" This reverts commit8a8fd42383. * Revert "chore: use iwyu on numerical_methods/**.cpp" This reverts commiteff2f44a50. * Revert "chore: use iwyu on math/**.cpp" This reverts commitc47117ca3f. * Revert "chore: use iwyu on machine_learning/**.cpp" This reverts commitc3897d3763. * Revert "chore: use iwyu on hashing/**.cpp" This reverts commit0c6611a835. * Revert "chore: use iwyu on graph/**.cpp" This reverts commitdabd6d2591. * Revert "chore: use iwyu on geometry/**.cpp" This reverts commit740bd65932. * Revert "chore: use iwyu on divide_and_conquer/**.cpp" This reverts commit16ee49e086. * Revert "chore: use iwyu on data_structures/**.cpp" This reverts commita3b719e368. * Revert "chore: use iwyu on cpu_scheduling_algorithms/**.cpp" This reverts commit24e597f7e2. * Revert "chore: use iwyu on ciphers/**.cpp" This reverts commit3d80295883. * Revert "chore: use iwyu on bit_manip/**.cpp" This reverts commit7edcb6e458. * Revert "chore: use iwyu on backtracking/**.cpp" This reverts commitf0a30d7cdb. * Update search/binary_search.cpp * Update backtracking/subarray_sum.cpp * Update backtracking/subset_sum.cpp * Update backtracking/wildcard_matching.cpp * Update bit_manipulation/count_bits_flip.cpp * Update bit_manipulation/count_of_set_bits.cpp * Update bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp * Update bit_manipulation/hamming_distance.cpp * Update bit_manipulation/next_higher_number_with_same_number_of_set_bits.cpp * Update bit_manipulation/power_of_2.cpp * Update others/lru_cache.cpp * Update bit_manipulation/set_kth_bit.cpp * Update bit_manipulation/travelling_salesman_using_bit_manipulation.cpp * Update ciphers/base64_encoding.cpp * Update ciphers/hill_cipher.cpp * Update ciphers/uint128_t.hpp * Update cpu_scheduling_algorithms/fcfs_scheduling.cpp * Update data_structures/dsu_path_compression.cpp * Update data_structures/dsu_union_rank.cpp * Update data_structures/list_array.cpp * Update data_structures/queue_using_array.cpp * Update data_structures/sparse_table.cpp * Update data_structures/stack_using_queue.cpp * Update data_structures/treap.cpp * Update geometry/graham_scan_functions.hpp * Update graph/bidirectional_dijkstra.cpp * Update graph/connected_components_with_dsu.cpp * Update graph/cycle_check_directed_graph.cpp * Update graph/is_graph_bipartite2.cpp * Update graph/travelling_salesman_problem.cpp * Update hashing/md5.cpp * Update hashing/sha1.cpp * Update math/n_choose_r.cpp * Update strings/z_function.cpp * Update strings/manacher_algorithm.cpp * Update sorting/wiggle_sort.cpp * Update sorting/selection_sort_recursive.cpp * Update sorting/selection_sort_iterative.cpp * Update sorting/recursive_bubble_sort.cpp * Update sorting/radix_sort2.cpp * Update sorting/dnf_sort.cpp * Update sorting/cycle_sort.cpp * Update search/sublist_search.cpp * Update search/saddleback_search.cpp * Update search/interpolation_search.cpp * Update search/floyd_cycle_detection_algo.cpp * Update search/exponential_search.cpp * Update search/exponential_search.cpp * Update math/n_bonacci.cpp * Update math/aliquot_sum.cpp * Update math/check_factorial.cpp * Update math/double_factorial.cpp * Update math/eulers_totient_function.cpp * Update math/factorial.cpp * Update math/fibonacci.cpp * Update math/fibonacci_matrix_exponentiation.cpp * Update math/fibonacci_sum.cpp * Update math/finding_number_of_digits_in_a_number.cpp * chore: remove "/// for integral typedefs" * chore: remove for integral typedefs from modular division * fix: remove comment from include * fix: add cstdint to gale shapely --------- Co-authored-by: David Leal <halfpacho@gmail.com>
90 lines
2.3 KiB
C++
90 lines
2.3 KiB
C++
/**
|
|
* @file
|
|
* @brief C++ Program for Modular Exponentiation Iteratively.
|
|
* @details The task is to calculate the value of an integer a raised to an
|
|
* integer exponent b under modulo c.
|
|
* @note The time complexity of this approach is O(log b).
|
|
*
|
|
* Example:
|
|
* (4^3) % 5 (where ^ stands for exponentiation and % for modulo)
|
|
* (4*4*4) % 5
|
|
* (4 % 5) * ( (4*4) % 5 )
|
|
* 4 * (16 % 5)
|
|
* 4 * 1
|
|
* 4
|
|
* We can also verify the result as 4^3 is 64 and 64 modulo 5 is 4
|
|
*
|
|
* @author [Shri2206](https://github.com/Shri2206)
|
|
*/
|
|
#include <cassert> /// for assert
|
|
#include <cstdint>
|
|
#include <iostream> /// for io operations
|
|
/**
|
|
* @namespace math
|
|
* @brief Mathematical algorithms
|
|
*/
|
|
namespace math {
|
|
/**
|
|
* @brief This function calculates a raised to exponent b under modulo c using
|
|
* modular exponentiation.
|
|
* @param a integer base
|
|
* @param b unsigned integer exponent
|
|
* @param c integer modulo
|
|
* @return a raised to power b modulo c
|
|
*/
|
|
uint64_t power(uint64_t a, uint64_t b, uint64_t c) {
|
|
uint64_t ans = 1; /// Initialize the answer to be returned
|
|
a = a % c; /// Update a if it is more than or equal to c
|
|
if (a == 0) {
|
|
return 0; /// In case a is divisible by c;
|
|
}
|
|
while (b > 0) {
|
|
/// If b is odd, multiply a with answer
|
|
if (b & 1) {
|
|
ans = ((ans % c) * (a % c)) % c;
|
|
}
|
|
/// b must be even now
|
|
b = b >> 1; /// b = b/2
|
|
a = ((a % c) * (a % c)) % c;
|
|
}
|
|
return ans;
|
|
}
|
|
|
|
} // namespace math
|
|
|
|
/**
|
|
* Function for testing power function.
|
|
* test cases and assert statement.
|
|
* @returns `void`
|
|
*/
|
|
static void test() {
|
|
uint32_t test_case_1 = math::power(2, 5, 13);
|
|
assert(test_case_1 == 6);
|
|
std::cout << "Test 1 Passed!" << std::endl;
|
|
|
|
uint32_t test_case_2 = math::power(14, 7, 15);
|
|
assert(test_case_2 == 14);
|
|
std::cout << "Test 2 Passed!" << std::endl;
|
|
|
|
uint64_t test_case_3 = math::power(8, 15, 41);
|
|
assert(test_case_3 == 32);
|
|
std::cout << "Test 3 Passed!" << std::endl;
|
|
|
|
uint64_t test_case_4 = math::power(27, 2, 5);
|
|
assert(test_case_4 == 4);
|
|
std::cout << "Test 4 Passed!" << std::endl;
|
|
|
|
uint16_t test_case_5 = math::power(7, 3, 6);
|
|
assert(test_case_5 == 1);
|
|
std::cout << "Test 5 Passed!" << std::endl;
|
|
}
|
|
|
|
/**
|
|
* @brief Main function
|
|
* @returns 0 on exit
|
|
*/
|
|
int main() {
|
|
test(); // execute the tests
|
|
return 0;
|
|
}
|