# How to solve this

vanlalhmangaiha khiangte

Ranch Hand

Posts: 170

posted 8 years ago

I have three jugs :-

1) 19 litres Empty JUG

2) 13 litres JUG full of water

3) 7 litres JUG full of water

Total - 20 litres of water are there ...

I want 10 litres of water in the two jugs 1 and 2 ...

Tried to solve it but not able to get it ...

[ August 07, 2008: Message edited by: vanlalhmangaiha khiangte ]

1) 19 litres Empty JUG

2) 13 litres JUG full of water

3) 7 litres JUG full of water

Total - 20 litres of water are there ...

I want 10 litres of water in the two jugs 1 and 2 ...

Tried to solve it but not able to get it ...

[ August 07, 2008: Message edited by: vanlalhmangaiha khiangte ]

posted 8 years ago

You can't link to your local machine, you need to upload the image somewhere first.

Bill Shirley

Ranch Hand

Posts: 457

posted 8 years ago

Bill Shirley - bshirley - frazerbilt.com

if (Posts < 30) you.read( JavaRanchFAQ);

posted 8 years ago

I didn't check the solution yet (I don't want to spoil it), but since is a common type of problem and we're talking about programming, let me put a spin on it: what algorithm would you use to solve the problem?

Gabriel

Software Surgeon

vanlalhmangaiha khiangte

Ranch Hand

Posts: 170

Paul Yule

Ranch Hand

Posts: 229

posted 8 years ago

Jug1----->Jug1(19 litres)

Jug2-move->Jug2(13 litres)

Jug3----->Jug3(7litres)

0----->13----->13--X-->6----->6----->

13--X-->0---->7----->7----->13--X-->

7----->7--X-->0----->7--X-->1----->

19----->19--X-->12----->12--X-->5----->

0----->1----->1----->8----->8----->

1--X-->0----->7--X-->0----->7--X-->

5----->18----->18--X-->11----->11--X-->

13--X-->0----->2----->2----->9----->

2----->2--X-->0----->7--X-->0----->

4----->4----->17----->17--X-->10----->10

9----->13--X-->0----->3----->3----->10

7--X-->3----->3--X-->0----->7--X-->0

The X is which jug poured

So...what kind of pattern can we discern from this?

To me, it looks like we move from the lowest to the middle (until it will fill up the middle)

then from middle to biggest until it will over flow then we dump what we can into the small one and rinse repeat.

So

That should do it I think. Have no idea as to syntax or anything. It's all notepad psuedo'd

It's a really slow day at work...if only someone out there was bored enough to actually check my logic. >.>

[ August 18, 2008: Message edited by: Paul Yule ]

Jug2-move->Jug2(13 litres)

Jug3----->Jug3(7litres)

0----->13----->13--X-->6----->6----->

13--X-->0---->7----->7----->13--X-->

7----->7--X-->0----->7--X-->1----->

19----->19--X-->12----->12--X-->5----->

0----->1----->1----->8----->8----->

1--X-->0----->7--X-->0----->7--X-->

5----->18----->18--X-->11----->11--X-->

13--X-->0----->2----->2----->9----->

2----->2--X-->0----->7--X-->0----->

4----->4----->17----->17--X-->10----->10

9----->13--X-->0----->3----->3----->10

7--X-->3----->3--X-->0----->7--X-->0

The X is which jug poured

So...what kind of pattern can we discern from this?

To me, it looks like we move from the lowest to the middle (until it will fill up the middle)

then from middle to biggest until it will over flow then we dump what we can into the small one and rinse repeat.

So

That should do it I think. Have no idea as to syntax or anything. It's all notepad psuedo'd

It's a really slow day at work...if only someone out there was bored enough to actually check my logic. >.>

[ August 18, 2008: Message edited by: Paul Yule ]