log in
Active Users
Feedback
About and Contact
© 2020 DOUBTCOOL
Chef Two and Chef Ten are playing a game with a number X. In one turn, they can multiply X by 2. The goal of the game is to
make X divisible by 10.
Help the Chefs find the smallest number of turns necessary to win the game (it may be possible to win in zero turns) or
determine that it is impossible.
make X divisible by 10.
Help the Chefs find the smallest number of turns necessary to win the game (it may be possible to win in zero turns) or
determine that it is impossible.
2 Expert answers available
This is very tricky question.
all test case input is asked in a single line and the output is display is next single line
HIDDEN TRICK IS , THEY SAY " IN ONE TURN THEY MULTIPLY THE NUMBER BY 2" NOT IN ALL TURNS
here the python code for your reference
variable "t" has nothing to do with the code.
Certified
Hey guys check out my code if you want to implement it using while.....
Certified