Project Euler #159: Digital root sums of factorisations.

Sort by

recency

|

3 Discussions

|

  • + 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

  • + 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.

  • + 2 comments

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

No more comments