动态规划之找零钱变体

有一定的钱，住宾馆，求住的最少宾馆数目，钱恰好花完

import sys

if __name__ == "__main__": 
    while 1: 
        line = sys.stdin.readline().strip()
        if not line:
            break
    hotel = map(int, line.split(" "))
    money = hotel.pop()
    hotel.sort()
    dp = [money + 1 for i in xrange(money + 1)]
    dp[0] = 0
    for i in xrange(1, money + 1): 
        for h in hotel: 
            if h <= i:
                dp[i] = min(dp[i], dp[i - h] + 1)
            else:
                break
    print -1 if dp[-1] == money + 1 else dp[-1]