S + X - Y = 10*(10+1) / 2 (1)
minus Y
I will send you a total explaination of this HUGE problemOn 12/21/05, elzacho [EMAIL PROTECTED] wrote:
Yeah, it seems that the problem may be poorly thought out or stated.If there are extra pieces to the puzzle that are not needed then
(ignoring the 10 piece minimum) isn't one single piece a
S is the sum of the numbers from 1 to 10 other then X and Y ie
the missing number and the repeating number
S + X + Y = 10*(10+1) / 2
and in the input stream we dont have X rather an extra Y in that place
so summing the numbers of the stream we
get S + Y + Y
On 12/21/05, ridvansg
what if we use backtracking to find the hamiltonian cycles and
finding the min of that. It reduces the space required.since we need to
store only one cycle at one shot. am i missing the stack space required
of recursion of backtrack.??
Dhyanesh, what about time. does it reduces the time as well??
Thanks, Mattia. Good post!
adak
And hopefully, a nail gun, to nail down all the loose ends! grin
These word problems...!!!
adak