You've got someone working for you for seven days and a gold bar to pay them. The gold bar is segmented into seven connected pieces. You must give them a piece of gold at the end of every day. If you are only allowed to make two breaks in the gold bar, how do you pay your worker?
Source : http://www.sellsbrothers.com/fun/msiview/default.aspx?content=question.htm
skip to main |
skip to sidebar
"Gebo" means to "give and take". This is my attempt to share the knowledge & experience with the community. Focus on Puzzles, Algorithms, Problem Solving, Java & other Technical Discussions.
About Me
Search Gebo
Share & Subscribe
Books & Knowledge Base @ Amazon
Links
|
| Buttons reused from http://www.webfruits.it/freebies.htm and http://mysocialbuttons.com/ |
Archive
-
▼
2009
(26)
-
▼
September
(9)
- Walk the bridge, in pairs as fast a possible
- Find jar with the contaminated pills
- Algorithms from "100 Interview Questions for Softw...
- Algorithms from "100 Interview Questions for Softw...
- Find the bulb for the switch
- Find direction of rotation
- Pay for 7 days using 1 7-segment gold bar and 2 cuts
- [Probability] Divide 100 marbles into two piles
- Find the poisoned wine barrel
-
▼
September
(9)
Labels / Tag
algorithms
(15)
amazon
(3)
antivirus
(1)
arithmetic series
(1)
array
(5)
backtracking
(1)
bash
(1)
basics
(1)
binary trees
(1)
brindavan garden
(1)
bulb
(1)
C++
(1)
callback
(1)
clam
(1)
clamav
(1)
clock
(1)
CLRS
(2)
cormen
(3)
data structures
(1)
duplicate
(1)
easymock
(1)
education
(1)
excel
(1)
freshclam
(1)
hanoi
(1)
hashing
(1)
httpclient
(1)
humor
(1)
induction
(1)
interview question
(9)
irrational
(1)
Java
(5)
jmockit
(1)
learning
(1)
level_easy
(1)
linux
(3)
logger
(1)
macro
(1)
madhur
(2)
mathematics
(5)
matrix
(1)
microsoft
(6)
mock
(2)
mockito
(2)
mysore
(1)
networking
(1)
OCW
(1)
odd man out
(1)
oocalc
(1)
OOTB
(1)
pattern
(1)
Persistent
(1)
probability
(2)
problem
(1)
problem solving
(17)
proxy
(1)
proxy selector
(1)
puzzle
(5)
quote
(1)
randomized
(1)
recurrsion
(2)
repeating
(1)
resolution
(1)
reverse
(1)
riddle
(5)
road trip
(1)
script
(1)
search
(2)
shell
(1)
shell script
(1)
socks
(1)
solaris
(1)
solved
(1)
sort
(3)
stock
(1)
strategy
(1)
subversion
(1)
summation
(1)
svn
(1)
switch
(1)
tanwani
(2)
TDD
(2)
technology
(2)
theorem
(1)
timer
(1)
todo
(1)
travel
(1)
trees
(1)
tutorial
(1)
unimodal
(1)
unit test
(2)
walk the bridge
(1)
warmup
(1)
water jugs
(1)
windows
(1)
xkcd joke
(1)
© Madhur Kumar Tanwani
All material on this page, is free to use as long as references to the original source is maintained and credits are given to this website as one of the sources. Few clicks on the Ads on this page will help too :)
All material on this page, is free to use as long as references to the original source is maintained and credits are given to this website as one of the sources. Few clicks on the Ads on this page will help too :)
2 comments:
Simple... You know well that with binary you can come up with any number. For example, you can represent the number 10 in binary as 1010.
So all it needs is 1 bit for every place holder. If you cut the chain 1-2 and 3-4, you will have chains of length 1,2, and 4. Now you have the binary representations 001, 010, 100. With these 3, you can come up with any number till 7 using various combinations.
This should also work :
SPLIT 1 : Split into 3 and 4 segments
SPLIT 2 : Place the two small bars on top of each other and split into 3 2-segments and 1 1-segment
DAY 1 : Pay 1 1-segment
DAY 2 : Pay 1 2-segment, ask for yest's 1-segment back
DAY 3 : .. and so on...
DAY 7 : Pay the left over 1-segment
Post a Comment