[Cpp-Programming] i'm facing

below is a code chef problem:
The captain of the ship TITANIC is a little .... off the track. He
needs to select the crew for the ship. But everyone seems to be
eligible. So to test their intelligence, he plays a game.
The contestants have to stand in a line. They are given the numbers in
the order in which they stand, starting from 1. The captain then
removes all the contestants that are standing at an odd position.
Initially, standing people have numbers - 1,2,3,4,5...
After first pass, people left are - 2,4,...
After second pass - 4,....
And so on.
You want to board the ship as a crew member. Given the total number of
applicants for a position, find the best place to stand in the line so
that you are selected.

i've done it by taking an array and eliminating the nos recursively
but it is saying time limit exceeded
can u please tell me the optimized algorithm for such problem

--
You received this message because you are subscribed to the Google Groups "C++ Programming" group.
To post to this group, send email to cpp-programming@googlegroups.com.
To unsubscribe from this group, send email to cpp-programming+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/cpp-programming?hl=en.