大桶小桶装水问题

最新推荐文章于 2021-09-25 20:50:19 发布

mdzzname

最新推荐文章于 2021-09-25 20:50:19 发布

阅读量1.4k

点赞数 1

分类专栏：算法

本文链接：https://blog.csdn.net/mdzzname/article/details/99686570

版权

算法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

今天看到一个小学的一个益智题，题目如下：

你有一个四升的水桶和一个九升的水桶,并且你有一个有水的水池.你最少需要多少步才能正好装满六升的水?

当然这个题不是很难，但是可以引申到一般情况，对于两个大小为 m 和 n 的桶，他们所能装的水可以去那些值？

容易得知，取值范围为[0, m+n], 借助一些例子可以发现，所能取到的值为 m 和 n 的最大公约数的倍数。后面简单写了个程序验证下这一结论，代码如下：

# 左边桶的最大容量
L = 4
# 右边桶的最大容量
R = 9

# 用于保存所有出现过的两水桶的水的和， 如 [9, 13]
ans = set([])
# 用于保存出现过的状态，以二元组为单位，如[(0, 9), (4, 9)]
series = set([])
# 用于保存到达每个状态的一条可能路径 如{(0, 9) : [(0, 0), [0, 9]]}
route = {}


def partition(array):
    # 水桶二元组未出现过 则把它加入到记录出现过的二元组的set中
    # 如果二元组出现过了 则直接返回 不需要继续下去了
    if array not in series:
        series.add(array)
    else:
        return
    sum = array[0] + array[1]
    # 计算两桶水的和 未出现过则将其加入到ans set中
    if sum not in ans:
        ans.add(sum)
    left, right = array
    # 左边装满
    temp = (L, right)
    judge(array, temp)
    # 右边装满
    temp = (left, R)
    judge(array, temp)
    # 左边倒空
    temp = (0, right)
    judge(array, temp)
    # 右边倒空
    temp = (left, 0)
    judge(array, temp)
    # 右边的倒到左边
    temp = (sum, 0) if sum < L else (L, sum - L)
    judge(array, temp)
    # 左边的倒到右边
    temp = (0, sum) if sum < R else (sum - R, R)
    judge(array, temp)


def judge(array, temp):
    # 如果对原来的二元组进行操作得到的temp二元组使一个新二元组，则记录下它的路径信息(等于原来的二元组的路径信息加上当前的二元组)
    if temp not in series:
        route[temp] = route[array] + [temp]
    partition(temp)


# 先添加初始二元组的路径信息
route[(0, 0)] = [(0, 0)]
partition((0, 0))
print('Possible sum: ', sorted(ans))
print('Possible state: ', sorted(series))
print('One route of every possible state:')
for k, v in route.items():
    print(k, " : ", v)

对于m = 4, n = 9 的输出如下(路径只是其中的一条,非最短路径）

Possible sum:  [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]
Possible state:  [(0, 0), (0, 1), (0, 2), (0, 3), (0, 4), (0, 5), (0, 6), (0, 7), (0, 8), (0, 9), (1, 0), (1, 9), (2, 0), (2, 9), (3, 0), (3, 9), (4, 0), (4, 1), (4, 2), (4, 3), (4, 4), (4, 5), (4, 6), (4, 7), (4, 8), (4, 9)]
One route of every possible state:
(0, 0)  :  [(0, 0)]
(4, 0)  :  [(0, 0), (4, 0)]
(4, 9)  :  [(0, 0), (4, 0), (4, 9)]
(0, 9)  :  [(0, 0), (4, 0), (4, 9), (0, 9)]
(4, 5)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5)]
(0, 5)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5)]
(4, 1)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1)]
(0, 1)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1)]
(1, 0)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0)]
(1, 9)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9)]
(4, 6)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6)]
(0, 6)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6), (0, 6)]
(4, 2)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6), (0, 6), (4, 2)]
(0, 2)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6), (0, 6), (4, 2), (0, 2)]
(2, 0)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6), (0, 6), (4, 2), (0, 2), (2, 0)]
(2, 9)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6), (0, 6), (4, 2), (0, 2), (2, 0), (2, 9)]
(4, 7)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6), (0, 6), (4, 2), (0, 2), (2, 0), (2, 9), (4, 7)]
(0, 7)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6), (0, 6), (4, 2), (0, 2), (2, 0), (2, 9), (4, 7), (0, 7)]
(4, 3)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6), (0, 6), (4, 2), (0, 2), (2, 0), (2, 9), (4, 7), (0, 7), (4, 3)]
(0, 3)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6), (0, 6), (4, 2), (0, 2), (2, 0), (2, 9), (4, 7), (0, 7), (4, 3), (0, 3)]
(3, 0)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6), (0, 6), (4, 2), (0, 2), (2, 0), (2, 9), (4, 7), (0, 7), (4, 3), (0, 3), (3, 0)]
(3, 9)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6), (0, 6), (4, 2), (0, 2), (2, 0), (2, 9), (4, 7), (0, 7), (4, 3), (0, 3), (3, 0), (3, 9)]
(4, 8)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6), (0, 6), (4, 2), (0, 2), (2, 0), (2, 9), (4, 7), (0, 7), (4, 3), (0, 3), (3, 0), (3, 9), (4, 8)]
(0, 8)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6), (0, 6), (4, 2), (0, 2), (2, 0), (2, 9), (4, 7), (0, 7), (4, 3), (0, 3), (3, 0), (3, 9), (4, 8), (0, 8)]
(4, 4)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6), (0, 6), (4, 2), (0, 2), (2, 0), (2, 9), (4, 7), (0, 7), (4, 3), (0, 3), (3, 0), (3, 9), (4, 8), (0, 8), (4, 4)]
(0, 4)  :  [(0, 0), (4, 0), (4, 9), (0, 9), (4, 5), (0, 5), (4, 1), (0, 1), (1, 0), (1, 9), (4, 6), (0, 6), (4, 2), (0, 2), (2, 0), (2, 9), (4, 7), (0, 7), (4, 3), (0, 3), (3, 0), (3, 9), (4, 8), (0, 8), (4, 4), (0, 4)]

对于m = 3, n = 9的输出如下：

Possible sum:  [0, 3, 6, 9, 12]
Possible state:  [(0, 0), (0, 3), (0, 6), (0, 9), (3, 0), (3, 3), (3, 6), (3, 9)]
One route of every possible state:
(0, 0)  :  [(0, 0)]
(3, 0)  :  [(0, 0), (3, 0)]
(3, 9)  :  [(0, 0), (3, 0), (3, 9)]
(0, 9)  :  [(0, 0), (3, 0), (3, 9), (0, 9)]
(3, 6)  :  [(0, 0), (3, 0), (3, 9), (0, 9), (3, 6)]
(0, 6)  :  [(0, 0), (3, 0), (3, 9), (0, 9), (3, 6), (0, 6)]
(3, 3)  :  [(0, 0), (3, 0), (3, 9), (0, 9), (3, 6), (0, 6), (3, 3)]
(0, 3)  :  [(0, 0), (3, 0), (3, 9), (0, 9), (3, 6), (0, 6), (3, 3), (0, 3)]

可以发现上述结果印证了之前推测的结论。