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

    HackerRank

  • |
  • Prepare
  • Certify
  • Compete
  • Hiring developers?
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #159: Digital root sums of factorisations.
  4. Discussions

Project Euler #159: Digital root sums of factorisations.

Problem
Submissions
Leaderboard
Discussions

Sort 3 Discussions, By:

recency

Please Login in order to post a comment

  • mhtarora39
    6 years ago+ 1 comment

    hay plz help me out My code is always timed out what should i do i am using c++ and i have removed all function call please and wrote a whole code inside main block suggest me what should i do

    0|
    Permalink
  • pacfish
    6 years ago+ 1 comment

    I'm not sure I understand this problem.

    Could someone attempt to reword how the input and output actually work?

    Trying to figure out how test case 10 has an output of 51 when the factors are 2 and 5.

    0|
    Permalink
  • rishabh10patel9
    6 years ago+ 2 comments

    my program takes too much time to work on 10^7 numbers :(

    -1|
    Permalink

No more comments

Need Help?


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