We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I am always getting wrong answer except 1st test case. Is there any other method other than modular exponentiation and modular addition and multiplication? I have submitted my code in both Python and C++.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #97: Large non-Mersenne prime
You are viewing a single comment's thread. Return to all comments →
minutes ago
I am always getting wrong answer except 1st test case. Is there any other method other than modular exponentiation and modular addition and multiplication? I have submitted my code in both Python and C++.