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.
  • Hackerrank Home
  • Prepare
    NEW
  • Certify
  • Compete
  • Career Fair
  • Hiring developers?
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #188: The hyperexponentiation of a number
  4. Discussions

Project Euler #188: The hyperexponentiation of a number

Problem
Submissions
Leaderboard
Discussions

Sort 8 Discussions, By:

votes

Please Login in order to post a comment

  • arunkumarv222
    4 years ago+ 0 comments

    i got runtimeerror while submitting the code.why i can't understand please anyone help me......

    0|
    Permalink
  • jpitz
    5 years ago+ 0 comments

    https://github.com/retiman/project-euler/blob/bef367b700d350272707b728a99a69f83bb2eb99/strategies/problem-00188.txt

    Is this going into the right direction? What can you do if gcd(a, m) > 1

    I tried using phi(m) in all cases, but I get incorrect results (as expected), but not reducing the size of the exponent, even if I do so, only when gcd > 1, still gets me timeouts.

    Note: I already stop the recusion if m = 1;

    0|
    Permalink
  • jason_v12
    5 years ago+ 1 comment

    Mine won't work because of timeout! Is there any way around this?

    0|
    Permalink
  • Voazch
    5 years ago+ 1 comment

    Can someone give me any test please!!

    0|
    Permalink
  • luckymastermin
    5 years ago+ 0 comments

    What kind of test case 0 is , I am always getting WA for this.

    0|
    Permalink
Load more conversations

Need Help?


View top submissions
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature