Sort 3 Discussions, By:
Please Login in order to post a comment
But how?! I wrote algorithm with complexity O(n) with memory O(1) but why is that not enough? "Terminated due to timeout :("
Hey there! Only now I just have passed my 12-month programming classes and I am thankful for professional experts help that the best resume writers company provided through these 12 months. Any nascent problems were addressed in time and my editor was fairly responsive in the course of completing my assignments and discussion board posts. I will definitely hire their help for the next classes in the next year!!!
Is answer not just:
2^m1 + 2 * m2 + A ? where m1 + m2 <= B.
m1 -> 0 to B and
m2 -> 0 to B
(It will count duplicates also but they can avoided easily by checking distance between 2^i and 2 ^(i+1)
No more comments