yea i am a novice and i understand this but takes a while before i know how the top one works

Fixed.

It's highly unlikely that you will get anywhere if you do not use some very specific number theory theorem. I think you just need to do some more research, until you stumple upon some particular approach.

I am hitting timeout exception with n=661915703. I have tried solving the problem using DP + memoization and BFS. Both the solution are encountering same timeout issue. I am unable to identify whats wrong. Any pointers will be great.

Thanks.

it's most probably a bug in c++ version of the kata. please check if adding include <cmath> in your solution helps, even if you don't use it.

What are these errors? I don't have these on my file. (C++)

In file included from main.cpp:7:
./tests.cpp:7:35: error: no member named 'sqrt' in namespace 'std'
return n == std::pow(int(std::sqrt(n)), 2);
~~~~~^
./tests.cpp:7:22: error: no member named 'pow' in namespace 'std'
return n == std::pow(int(std::sqrt(n)), 2);
~~~~~^
./tests.cpp:20:27: error: no member named 'sqrt' in namespace 'std'
int sqrt_n = int(std::sqrt(n));
~~~~~^
3 errors generated.

"I don't understand the guy, so I am going to throw some curse words at him." - yup, sounds perfectly reasonable.

i don't understand why he writes it here

why so salty? xD

damn you even coded longer than me

For those of you using C++ AND CAN ONLY PASS THE FIRST ONE IN THE ATTEMPT, when you are using vector array, try it in visual studio first, make a for loop of 10, loop your code and then you will see that you will only get the 1-3 correct results(most of them are repeated).

OK, put your functions into a class, seperate each executions into objects so that they will not clash into each others.

This is what I have found, I am not good at it, but have fun anyway.