mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-02 10:12:45 +08:00
Resolve line length errors in math/mod_inverse_by_fermat_theorem.cpp
This commit is contained in:
@@ -73,7 +73,7 @@ int main() {
|
||||
std::cout << "The modular inverse of a with mod m is (a^(m-2)) : ";
|
||||
std::cout << binExpo(a, m-2, m) << std::endl;
|
||||
} else {
|
||||
std::cout << "m must be a prime number to apply Fermat's Little Theorem.";
|
||||
std::cout << "m must be a prime number.";
|
||||
std::cout << std::endl;
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user